Kun Zhang, Peng Xu, Yujiu Yang, Guangyi Chen, Jiaqi Sun, Lin Zhang
None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2305.06142.json · badge: /api/ran/2305.06142.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| sajqavril/feature-extension-graph-neural-networks | marked official in Papers with Code Papers with Code archive |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| BasisGenerator | Not yet run unverified (harvested, no recorded run) |
sajqavril/feature-extension-graph-neural-networks/FEGNN_model.py pointer only (licence: NONE) · get_code("bac25b4b57e34db8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sajqavril/feature-extension-graph-neural-networks when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| MP | Not yet run unverified (harvested, no recorded run) |
sajqavril/feature-extension-graph-neural-networks/FEGNN_model.py pointer only (licence: NONE) · get_code("0c6c5cbbbcce1c1c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sajqavril/feature-extension-graph-neural-networks when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph neural networks aim to learn representations for graph-structured data and show impressive performance, particularly in node classification. Recently, many methods have studied the representations of GNNs from the perspective of optimization goals and spectral graph theory. However, the feature space that dominates representation learning has not been systematically studied in graph neural networks. In this paper, we propose to fill this gap by analyzing the feature space of both spatial and spectral models. We decompose graph neural networks into determined feature spaces and trainable weights, providing the convenience of studying the feature space explicitly using matrix space analysis. In particular, we theoretically find that the feature space tends to be linearly correlated due to repeated aggregations. In this case, the feature space is bounded by the poor representation of shared weights or the limited dimensionality of node attributes in existing models, leading to poor performance. Motivated by these findings, we propose 1) feature subspaces flattening and 2) structural principal components to expand the feature space. Extensive experiments verify the effectiveness of our proposed more comprehensive feature space, with comparable inference time to the baseline, and demonstrate its efficient convergence capability.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.06142")
get_code_for_paper("2305.06142")
have("2305.06142")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2305.06142.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2305.06142)
Connect an agent — have() is free.