Papers › Benchmarking Graph Neural Networks
Benchmarking Graph Neural Networks
Vijay Prakash Dwivedi, Chaitanya K. Joshi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, Xavier Bresson
In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs. This emerging field has witnessed an extensive growth of promising techniques that have been applied with success to computer science, mathematics, biology, physics and chemistry. But for any successful field to become mainstream and reliable, benchmarks must be developed to quantify progress. This led us in March 2020 to release a benchmark framework that i) comprises of a diverse collection of mathematical and real-world graphs, ii) enables fair model comparison with the same parameter budget to identify key architectures, iii) has an open-source, easy-to-use and reproducible code infrastructure, and iv) is flexible for researchers to experiment with new theoretical ideas. As of December 2022, the GitHub repository has reached 2,000 stars and 380 forks, which demonstrates the utility of the proposed open-source framework through the wide usage by the GNN community. In this paper, we present an updated version of our benchmark with a concise presentation of the aforementioned framework characteristics, an additional medium-sized molecular dataset AQSOL, similar to the popular ZINC, but with a real-world measured chemical target, and discuss how this framework can be leveraged to explore new GNN designs and insights. As a proof of value of our benchmark, we study the case of graph positional encoding (PE) in GNNs, which was introduced with this benchmark and has since spurred interest of exploring more powerful PE for Transformers and GNNs in a robust experimental setting.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2003.00982")
Code
Syntology Ran 1 of 23 code samples harvested from 4 repositories linked to this paper; 22 have no recorded run. Of those that ran: 1 ran · our draft was wrong.
By repository: official repository: 3 samples from 1 repository, 1 ran; community (archive-listed): 20 samples from 3 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
15 repositories listed; official and paper-mentioned ones first.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
23 samples harvested; 1 ran; 0 honoured the contract we drafted; 22 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 23 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 4 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
f72434c0dcd5d11b · report
15bb4b29cca9b4a1 · report
8a8a1e482dac9901 · report
4c77cfa0f2d2f37d · report
08ec4232dc9afa5b · report
0e0d8b04e0a30007 · report
6926e1ccdf433cce · report
da2d1d33aa78c510 · report
61782edfe2cb4a92 · report
9ab8241d3faddf35 · report
4ae9983fc353b1f9 · report
61a050f11d9e1f7e · report
e8e462381451afcd · report
5759d6efe4e482a4 · report
fa65de5b1c005eee · report
41db54384fdd01d6 · report
48c452849a73cec5 · report
0fccc3114c12388a · report
3d5e4058d7d4c01b · report
63102c67281002a7 · report
98f002b1572282d2 · report
a8fbb0de9230475b · report
c7a98eaf8183d806 · report
Tasks
Datasets
Introduced by this paper, per the archive.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Graph Classification | CIFAR10 100k | GatedGCN | Accuracy (%) | 67.312 | #16 of 20 | Archive leaderboard | report |
| Graph Classification | MNIST | GatedGCN | Accuracy | 97.340 | #13 of 13 | Archive leaderboard | report |
| Graph Regression | ZINC 100k | GatedGCN | MAE | 0.363 | #6 of 8 | Archive leaderboard | report |
| Graph Regression | ZINC-500k | GatedGCN-PE | MAE | 0.214 | #27 of 36 | Archive leaderboard | report |
| Graph Regression | ZINC-500k | GatedGCN-E-PE | MAE | 0.214 | #28 of 36 | Archive leaderboard | report |
| Link Prediction | COLLAB | GatedGCN-PE | Hits | 52.849 | #1 of 1 | Archive leaderboard | report |
| Link Prediction | TSP/HCP Benchmark set | GatedGCN-E | F1 | 0.838 | #4 of 4 | Archive leaderboard | report |
| Node Classification | CLUSTER | GatedGCN-PE | Accuracy | 76.08 | #12 of 12 | Archive leaderboard | report |
| Node Classification | PATTERN | GatedGCN | Accuracy | 86.508 | #11 of 11 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Introduced by this paper: Laplacian PE
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections