Papers › Benchmarking Graph Neural Networks

Benchmarking Graph Neural Networks

2 Mar 2020arXiv:2003.00982archive 2025-07-28

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.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 23 code samples harvested from 4 repositories linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 3 samples from 1 repository, 3 ran (2 with no instrument failure; 1 where Syntology's instrument failed); community (archive-listed): 20 samples from 3 repositories, 7 ran (7 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 5 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

15 repositories listed; official and paper-mentioned ones first.

graphdeeplearning/benchmarking-gnns officialmentioned in papermentioned on GitHubpytorchMITSyntology: 3 samples, 3 ran (1 instrument-failed) · 0 unverified report
karl-zhao/benchmarking-gnns-pyg officialmentioned in paperpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A pipeline for fair comparison of graph neural networks in node classification tasks (arXiv:2012.10619; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PGL mentioned on GitHubpaddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification (arXiv:2009.03509; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
changminwu/expandergnn mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Principal Neighbourhood Aggregation for Graph Nets (arXiv:2004.05718; that paper's own run record: 33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report
chenfengzhao/gnnhls mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
guillaumejaume/tuto-dl-on-graphs mentioned on GitHubpytorchMITSyntology: not harvested report
icml2024357/hombasis-gnn mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Homomorphism Counts for Graph Neural Networks: All About That Basis (arXiv:2402.08595; that paper's own run record: 8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
liketheflower/jimmy_dgl mentioned on GitHubpytorchApache-2.0Syntology: 18 samples, 5 ran (0 instrument-failed) · 13 unverified report
shamim-hussain/egt mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Global Self-Attention as a Replacement for Graph Convolution (arXiv:2108.03348; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
yashkotadia/GatedGCN-PATTERN mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report

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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

23 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
9ran
13unverified

Licence: 1 of the 23 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

graphdeeplearning/benchmarking-gnns official repository 3 samples, 3 ran (1 instrument-failed) · 0 unverified
diag_offdiag_maxpool in 5 papers layers/three_wl_gnn_layers.py ran fingerprinted MIT (permissive) · 15bb4b29cca9b4a1 · report fixture: signature input:Tensor/4/float · returned Tensor · level recorded 2026-09-25
gpu_setup in 13 papers main_COLLAB_edge_classification.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · f72434c0dcd5d11b · report fixture: signature use_gpu:bool/0/bool, gpu_id:int/0/int · returned device · level recorded 2026-09-22
ops_2_to_2 layers/ring_gnn_equiv_layer.py ran MIT (permissive) · 8a8a1e482dac9901 · report fixture: signature inputs:Tensor/4/float, dim:int/0/int, normalization:str/0/str, normalization_val:float/0/float · returned list · level recorded 2026-09-25
chenfengzhao/gnnhls community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
ops_2_to_2 benchmarking-gnns/layers/ring_gnn_equiv_layer.py ran MIT (permissive) · 98f002b1572282d2 · report fixture: signature inputs:Tensor/4/float, dim:int/0/int, normalization:str/0/str, normalization_val:float/0/float · returned list · level recorded 2026-09-24
liketheflower/jimmy_dgl community (archive-listed) 18 samples, 5 ran (0 instrument-failed) · 13 unverified
find_src_dst_ntypes python/dgl/heterograph.py ran Apache-2.0 (permissive) · 61782edfe2cb4a92 · report fixture: signature ntypes:list/1/str, metagraph:MockGraphIndex/0/? · returned tuple · level recorded 2026-09-24
from_csr python/dgl/graph_index.py ran Apache-2.0 (permissive) · 61a050f11d9e1f7e · report fixture: returned GraphIndex · level recorded 2026-09-24
is_all python/dgl/base.py ran Apache-2.0 (permissive) · 48c452849a73cec5 · report fixture: signature arg:str/0/str · returned bool · level recorded 2026-09-24
is_unibipartite python/dgl/heterograph.py ran Apache-2.0 (permissive) · 0fccc3114c12388a · report fixture: signature graph:GraphIndex/0/? · returned bool · level recorded 2026-09-24
make_canonical_etypes python/dgl/heterograph.py ran Apache-2.0 (permissive) · 3d5e4058d7d4c01b · report fixture: signature etypes:list/1/str, ntypes:list/1/str, metagraph:GraphIndex/0/? · returned list · level recorded 2026-09-24
bipartite python/dgl/convert.py unverified Apache-2.0 (permissive) · 08ec4232dc9afa5b · report
create_heterograph_from_relations python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 0e0d8b04e0a30007 · report
create_unitgraph_from_coo python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 6926e1ccdf433cce · report
create_unitgraph_from_csr python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · da2d1d33aa78c510 · report
frame_like python/dgl/frame.py unverified Apache-2.0 (permissive) · 9ab8241d3faddf35 · report
from_coo python/dgl/graph_index.py unverified Apache-2.0 (permissive) · 4ae9983fc353b1f9 · report
from_shared_mem_graph_index python/dgl/graph_index.py unverified Apache-2.0 (permissive) · e8e462381451afcd · report
graph in 6 papers python/dgl/convert.py unverified Apache-2.0 (permissive) · 5759d6efe4e482a4 · report
hetero_from_relations python/dgl/convert.py unverified Apache-2.0 (permissive) · fa65de5b1c005eee · report
infer_scheme python/dgl/frame.py unverified Apache-2.0 (permissive) · 41db54384fdd01d6 · report
mutation in 6 papers python/dgl/graph.py unverified Apache-2.0 (permissive) · 63102c67281002a7 · report
rand_graph python/dgl/generators.py unverified Apache-2.0 (permissive) · a8fbb0de9230475b · report
zero_initializer python/dgl/init.py unverified Apache-2.0 (permissive) · c7a98eaf8183d806 · report
yashkotadia/GatedGCN-PATTERN community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
accuracy_SBM in 8 papers train/metrics.py ran MIT (permissive) · 4c77cfa0f2d2f37d · report fixture: signature scores:Tensor/2/float, targets:Tensor/1/int · returned float64 · level recorded 2026-09-24

Tasks

BenchmarkingGraph ClassificationGraph RegressionLink PredictionNode Classification

Datasets

Introduced by this paper, per the archive.

CLUSTERCSLPATTERN

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
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

Graph Convolutional NetworksLaplacian 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