2 of 5 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; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 0 failures of our instrument; 3 no recorded run), measured 2026-11-21; 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/2002.10306.json · badge: /api/ran/2002.10306.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 |
|---|---|---|
| spindro/AP-GCN | canonical (classifier label) classifier basis: census |
2 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| gen_seeds | Ran ran on a synthesized input |
spindro/AP-GCN/seeds.py code served (permissive licence) · get_code("95c286604696f55a") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family int, shape (5,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| normalize_attributes | Ran ran on a synthesized input |
spindro/AP-GCN/data.py code served (permissive licence) · get_code("fb4d68470e0d7707") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 2, dtype family float, shape (4, 3) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| create_subgraph | Not yet run unverified (harvested, no recorded run) |
spindro/AP-GCN/sparsegraph.py code served (permissive licence) · get_code("2b47e13833729e6e") How it ranno invocation recorded. |
| largest_connected_components | Not yet run unverified (harvested, no recorded run) |
spindro/AP-GCN/sparsegraph.py code served (permissive licence) · get_code("f696fb0f5b7895f8") How it ranno invocation recorded. |
| remove_self_loops | Not yet run unverified (harvested, no recorded run) |
spindro/AP-GCN/sparsegraph.py code served (permissive licence) · get_code("d22abf00bf0257bb") How it ranno invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 4 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 |
|---|---|---|---|
| gen_seeds | 1 other paper 1 dated earlier |
1810.05997 (2018-10) Predict then Propagate: Graph Neural Networks meet Personalized PageRank |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph convolutional networks (GCNs) are a family of neural network models that perform inference on graph data by interleaving vertex-wise operations and message-passing exchanges across nodes. Concerning the latter, two key questions arise: (i) how to design a differentiable exchange protocol (e.g., a 1-hop Laplacian smoothing in the original GCN), and (ii) how to characterize the trade-off in complexity with respect to the local updates. In this paper, we show that state-of-the-art results can be achieved by adapting the number of communication steps independently at every node. In particular, we endow each node with a halting unit (inspired by Graves' adaptive computation time) that after every exchange decides whether to continue communicating or not. We show that the proposed adaptive propagation GCN (AP-GCN) achieves superior or similar results to the best proposed models so far on a number of benchmarks, while requiring a small overhead in terms of additional parameters. We also investigate a regularization term to enforce an explicit trade-off between communication and accuracy. The code for the AP-GCN experiments is released as an open-source library.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.10306")
get_code_for_paper("2002.10306")
have("2002.10306")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.10306.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.10306)
Connect an agent — have() is free.