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/2206.11972.json · badge: /api/ran/2206.11972.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/tent | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| l2_normalize | Ran ran, honoured the contract we drafted |
songw-sw/tent/train_TENT.py pointer only (licence: NONE) · get_code("f06b0faae251c6c8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, songw-sw/tent 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 | Ran ran, violated the contract we drafted |
this paper's copy was not recorded; identical code first harvested from songw-sw/x-fnc pointer only; the stored copy get_code serves, from songw-sw/x-fnc, is pointer only (licence: NONE) · get_code("aa9c29936dee40a7") 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_adj | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from songw-sw/x-fnc pointer only; the stored copy get_code serves, from songw-sw/x-fnc, is pointer only (licence: NONE) · get_code("21b0199200507ff0") 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. |
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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 2 later) and 1 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 11 dated earlier, 13 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 |
| normalize_adj | 14 other papers 6 dated earlier, 1 the same month, 7 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.
Node classification is of great importance among various graph mining tasks. In practice, real-world graphs generally follow the long-tail distribution, where a large number of classes only consist of limited labeled nodes. Although Graph Neural Networks (GNNs) have achieved significant improvements in node classification, their performance decreases substantially in such a few-shot scenario. The main reason can be attributed to the vast generalization gap between meta-training and meta-test due to the task variance caused by different node/class distributions in meta-tasks (i.e., node-level and class-level variance). Therefore, to effectively alleviate the impact of task variance, we propose a task-adaptive node classification framework under the few-shot learning setting. Specifically, we first accumulate meta-knowledge across classes with abundant labeled nodes. Then we transfer such knowledge to the classes with limited labeled nodes via our proposed task-adaptive modules. In particular, to accommodate the different node/class distributions among meta-tasks, we propose three essential modules to perform \emph{node-level}, \emph{class-level}, and \emph{task-level} adaptations in each meta-task, respectively. In this way, our framework can conduct adaptations to different meta-tasks and thus advance the model generalization performance on meta-test tasks. Extensive experiments on four prevalent node classification datasets demonstrate the superiority of our framework over the state-of-the-art baselines. Our code is provided at https://github.com/SongW-SW/TENT.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2206.11972")
get_code_for_paper("2206.11972")
have("2206.11972")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2206.11972.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2206.11972)
Connect an agent — have() is free.