SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2106.10934 · 2021

GRAND: Graph Neural Diffusion

arXiv · PDF · Open in the Atlas

Code that ran

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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 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/2106.10934.json · badge: /api/ran/2106.10934.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.

RepositoryRoleRan
copy not recorded community
not in the paper's declared repositories
3 ran · 0 no recorded run
FunctionStatusWhere it lives
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 ran

The 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
this paper's copy was not recorded; identical code first harvested from twitter-research/graph-neural-pde
pointer only · get_code("14ff093eb3815088")
How it ran

The 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_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 ran

The 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.

Also present in other papers' code

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 (0 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.

FunctionAlso present inEarliest-datedOthers named
get_optimizer 8 other papers
8 later
2110.09443 (2021-10)
Beltrami Flow and Neural Diffusion on Graphs
2202.02296 (2022-02)
Graph-Coupled Oscillator Networks
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
6 later
2110.09443 (2021-10)
Beltrami Flow and Neural Diffusion on Graphs
2202.02296 (2022-02)
Graph-Coupled Oscillator Networks
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
6 later
2110.09443 (2021-10)
Beltrami Flow and Neural Diffusion on Graphs
2202.02296 (2022-02)
Graph-Coupled Oscillator Networks
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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present Graph Neural Diffusion (GRAND) that approaches deep learning on graphs as a continuous diffusion process and treats Graph Neural Networks (GNNs) as discretisations of an underlying PDE. In our model, the layer structure and topology correspond to the discretisation choices of temporal and spatial operators. Our approach allows a principled development of a broad new class of GNNs that are able to address the common plights of graph learning models such as depth, oversmoothing, and bottlenecks. Key to the success of our models are stability with respect to perturbations in the data and this is addressed for both implicit and explicit discretisation schemes. We develop linear and nonlinear versions of GRAND, which achieve competitive results on many standard graph benchmarks.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2106.10934")
get_code_for_paper("2106.10934")
have("2106.10934")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2106.10934.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2106.10934.svg)](https://syntology.ai/paper/2106.10934)

Connect an agent — have() is free.