3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 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/2301.02708.json · badge: /api/ran/2301.02708.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 |
|---|---|---|
| songw-sw/x-fnc | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| accuracy | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from TianxiangZhao/GraphSmote pointer only; the stored copy get_code serves, from TianxiangZhao/GraphSmote, is pointer only (licence: NONE) · get_code("18557871f0c93b3f") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. A run is recorded. |
| normalize | Ran ran, violated the contract we drafted |
songw-sw/x-fnc/train_xfnc.py pointer only (licence: NONE) · get_code("aa9c29936dee40a7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, songw-sw/x-fnc 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. A run is recorded. |
| normalize_adj | Ran ran; our contract draft was wrong, not the code |
songw-sw/x-fnc/train_xfnc.py pointer only (licence: NONE) · get_code("21b0199200507ff0") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, songw-sw/x-fnc 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. A run is recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 0 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| normalize | 24 other papers 14 dated earlier, 10 later |
1609.02907 (2016-09) Semi-Supervised Classification with Graph Convolutional Networks |
1803.03735 (2018-03) Attention-based Graph Neural Network for Semi-supervised Learning 1805.09112 (2018-05) Hyperbolic Neural Networks and 21 more not named here |
| accuracy | 14 other papers 7 dated earlier, 7 later |
1902.07153 (2019-02) Simplifying Graph Convolutional Networks |
1905.09550 (2019-05) Revisiting Graph Neural Networks: All We Have is Low-Pass Filters 2002.07128 (2020-02) Disease State Prediction From Single-Cell Data Using Graph Attention Networks and 11 more not named here |
| normalize_adj | 14 other papers 9 dated earlier, 5 later |
1812.00971 (2018-12) Learning to Learn How to Learn: Self-Adaptive Visual Navigation Using Meta-Learning |
2003.06749 (2020-03) Learning hierarchical relationships for object-goal navigation 2104.09807 (2021-04) Visual Navigation with Spatial Attention and 11 more not named here |
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.
Few-shot node classification aims at classifying nodes with limited labeled nodes as references. Recent few-shot node classification methods typically learn from classes with abundant labeled nodes (i.e., meta-training classes) and then generalize to classes with limited labeled nodes (i.e., meta-test classes). Nevertheless, on real-world graphs, it is usually difficult to obtain abundant labeled nodes for many classes. In practice, each meta-training class can only consist of several labeled nodes, known as the extremely weak supervision problem. In few-shot node classification, with extremely limited labeled nodes for meta-training, the generalization gap between meta-training and meta-test will become larger and thus lead to suboptimal performance. To tackle this issue, we study a novel problem of few-shot node classification with extremely weak supervision and propose a principled framework X-FNC under the prevalent meta-learning framework. Specifically, our goal is to accumulate meta-knowledge across different meta-training tasks with extremely weak supervision and generalize such knowledge to meta-test tasks. To address the challenges resulting from extremely scarce labeled nodes, we propose two essential modules to obtain pseudo-labeled nodes as extra references and effectively learn from extremely limited supervision information. We further conduct extensive experiments on four node classification datasets with extremely weak supervision to validate the superiority of our framework compared to the state-of-the-art baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2301.02708")
get_code_for_paper("2301.02708")
have("2301.02708")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2301.02708.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2301.02708)
Connect an agent — have() is free.