Michael Bronstein, T Rusch, Siddhartha Mishra, Benjamin Chamberlain, James Rowbottom
4 of 4 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 0 have no contract verdict; 4 failures 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/2202.02296.json · badge: /api/ran/2202.02296.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 |
|---|---|---|
| tk-rusch/graphcon | canonical (classifier label) classifier basis: classifier_2025 |
2 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 |
|---|---|---|
| SymplecticEuler_step_func | Ran ran; our contract draft was wrong, not the code |
tk-rusch/graphcon/src/homophilic_graphs/geometric_integrators.py pointer only (licence: NONE) · get_code("1511f7031d44eafb") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, tk-rusch/graphcon 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. |
| add_labels | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from twitter-research/graph-neural-pde pointer only · get_code("2ca430b1c5874d57") 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. |
| get_label_masks | Ran ran; our contract draft was wrong, not the code |
tk-rusch/graphcon/src/homophilic_graphs/run_GNN.py pointer only (licence: NONE) · get_code("5198723f26aa8e49") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, tk-rusch/graphcon 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. |
| get_optimizer | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from twitter-research/graph-neural-pde pointer only · get_code("dab3444777a2e6c7") 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 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 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 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 |
|---|---|---|---|
| get_optimizer | 8 other papers 2 dated earlier, 6 later |
2106.10934 (2021-06) GRAND: Graph Neural Diffusion |
2110.09443 (2021-10) Beltrami Flow and Neural Diffusion on Graphs 2206.05437 (2022-06) ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks and 5 more not named here |
| add_labels | 6 other papers 2 dated earlier, 4 later |
2106.10934 (2021-06) GRAND: Graph Neural Diffusion |
2110.09443 (2021-10) Beltrami Flow and Neural Diffusion on Graphs 2206.05437 (2022-06) ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks and 3 more not named here |
| get_label_masks | 6 other papers 2 dated earlier, 4 later |
2106.10934 (2021-06) GRAND: Graph Neural Diffusion |
2110.09443 (2021-10) Beltrami Flow and Neural Diffusion on Graphs 2206.05437 (2022-06) ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks and 3 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.
We propose Graph-Coupled Oscillator Networks (GraphCON), a novel framework for deep learning on graphs. It is based on discretizations of a second-order system of ordinary differential equations (ODEs), which model a network of nonlinear controlled and damped oscillators, coupled via the adjacency structure of the underlying graph. The flexibility of our framework permits any basic GNN layer (e.g. convolutional or attentional) as the coupling function, from which a multi-layer deep neural network is built up via the dynamics of the proposed ODEs. We relate the oversmoothing problem, commonly encountered in GNNs, to the stability of steady states of the underlying ODE and show that zero-Dirichlet energy steady states are not stable for our proposed ODEs. This demonstrates that the proposed framework mitigates the oversmoothing problem. Moreover, we prove that GraphCON mitigates the exploding and vanishing gradients problem to facilitate training of deep multi-layer GNNs. Finally, we show that our approach offers competitive performance with respect to the state-of-the-art on a variety of graphbased learning tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.02296")
get_code_for_paper("2202.02296")
have("2202.02296")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.02296.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.02296)
Connect an agent — have() is free.