Papers › How Powerful are Graph Neural Networks?

How Powerful are Graph Neural Networks?

1 Oct 2018ICLR 2019 5arXiv:1810.00826archive 2025-07-28

Keyulu Xu, Weihua Hu, Jure Leskovec, Stefanie Jegelka

Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood aggregation scheme, where the representation vector of a node is computed by recursively aggregating and transforming representation vectors of its neighboring nodes. Many GNN variants have been proposed and have achieved state-of-the-art results on both node and graph classification tasks. However, despite GNNs revolutionizing graph representation learning, there is limited understanding of their representational properties and limitations. Here, we present a theoretical framework for analyzing the expressive power of GNNs to capture different graph structures. Our results characterize the discriminative power of popular GNN variants, such as Graph Convolutional Networks and GraphSAGE, and show that they cannot learn to distinguish certain simple graph structures. We then develop a simple architecture that is provably the most expressive among the class of GNNs and is as powerful as the Weisfeiler-Lehman graph isomorphism test. We empirically validate our theoretical findings on a number of graph classification benchmarks, and demonstrate that our model achieves state-of-the-art performance.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

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 10 code samples harvested from 4 repositories linked to this paper: 6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 2 samples from 1 repository, 2 ran (2 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 8 samples from 3 repositories, 4 ran (4 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 6 of its repositories that Syntology harvested for other papers:

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

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

weihua916/powerful-gnns officialmentioned in papermentioned on GitHubpytorchSyntology: 2 samples, 2 ran (0 instrument-failed) · 0 unverified report
PurdueMINDS/RelationalPooling mentioned on GitHubpytorchSyntology: 3 samples, 0 ran · 3 unverified report
calciver/Graph-Isomorphism-Networks mentioned on GitHubtfSyntology: not harvested report
egyptdj/graph-neural-mapping mentioned on GitHubpytorchSyntology: 2 samples, 1 ran (0 instrument-failed) · 1 unverified report
gmum/umwpl2021 mentioned on GitHubSyntology: not harvested report
gospodima/extended-simgnn mentioned on GitHubpytorchMITSyntology: 3 samples, 3 ran (0 instrument-failed) · 0 unverified report
guillaumejaume/tuto-dl-on-graphs mentioned on GitHubpytorchMITSyntology: not harvested report
igorsterner/commute-opt-gnn mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Commute-Time-Optimised Graphs for GNNs (arXiv:2407.08762; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
k4my4r/ECG-Classification mentioned on GitHubpytorchSyntology: not harvested report
karolismart/dropgnn mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks (arXiv:2111.06283; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
mfmceneaney/Lambda-GNNs mentioned on GitHubpytorchSyntology: not harvested report
pfnet-research/treewidth-prediction mentioned on GitHubMITSyntology: not harvested report
willy-b/tiny-GIN-for-ogbg-molhiv mentioned on GitHubpytorchMITSyntology: not harvested report
yuwvandy/g2gnn mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Graph Contrastive Learning with Augmentations (arXiv:2010.13902; that paper's own run record: 17 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 14 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
zhliping/Deep-Learning mentioned on GitHubpytorchSyntology: not harvested report
alexOarga/haiku-geometric jaxSyntology: 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
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
lukecavabarrett/pna pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Graph Attention Networks (arXiv:1710.10903; that paper's own run record: 61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified); nothing checks that they implement this paper's method. 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

10 samples harvested: 6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 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.

6ran
4unverified

Licence: 5 of the 10 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; 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”. For 1 sample that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “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.

weihua916/powerful-gnns official repository 2 samples, 2 ran (0 instrument-failed) · 0 unverified
GraphCNN models/graphcnn.py ran · metamorphic tier: deterministic MIT (permissive) · 201255c60d21f681 · report fixture: returned GraphCNN · level recorded 2026-09-22
MLP in 375 papers models/graphcnn.py ran · metamorphic tier: deterministic MIT (permissive) · 315335a707b61ec4 · report fixture: returned MLP · level recorded 2026-09-22
PurdueMINDS/RelationalPooling community (archive-listed) 3 samples, 0 ran · 3 unverified
GinMultiGraph GIN/GIN_model.py unverified no licence file found · pointer only · c36f76cf05961797 · report
GinParent GIN/GIN_model.py unverified no licence file found · pointer only · c29df0a91a98fef7 · report
MLP in 375 papers GIN/GIN_model.py unverified no licence file found · pointer only · a514a7e4552016d2 · report
egyptdj/graph-neural-mapping community (archive-listed) 2 samples, 1 ran (0 instrument-failed) · 1 unverified
Discriminator in 42 papers models/graphcnn.py ran · metamorphic tier: invariant fingerprinted GPL-3.0 (copyleft) · pointer only · 6e6181d4f831ff7a · report fixture: signature c:Tensor/2/float, h_pl:Tensor/2/float, h_mi:Tensor/2/float, s_bias1:Tensor/2/float, s_bias2:Tensor/2/float · returned Tensor · level recorded 2026-09-22
GIN_InfoMaxReg models/graphcnn.py unverified GPL-3.0 (copyleft) · pointer only · 7a017149093e4cd2 · report
gospodima/extended-simgnn community (archive-listed) 3 samples, 3 ran (0 instrument-failed) · 0 unverified
calculate_prec_at_k src/utils.py ran MIT (permissive) · c3ce89e1da779042 · report fixture: signature k:int/0/int, prediction:ndarray/1/float, target:ndarray/1/int · returned float · level recorded 2026-09-26
calculate_ranking_correlation src/utils.py ran MIT (permissive) · 1697183cb2ca07d3 · report fixture: signature rank_corr_function:callable/0/?, prediction:ndarray/1/float, target:ndarray/1/float · returned float64 · level recorded 2026-09-26
denormalize_sim_score src/utils.py ran MIT (permissive) · 47f530d7cd2a3985 · report fixture: signature g1:Graph/0/?, g2:Graph/0/?, sim_score:float/0/float · returned int · level recorded 2026-09-26

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

3 assemblies on this paper: 3 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

3 sibling assemblies for a simple architecture (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for a simple architecture (graph method: a simple architecture). 2 bricks; individually on a fixture: 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 3 siblings

  1. GraphCNN entry · level 1 · ran · 201255c60d21f681
  2. MLP model · level 1 · ran · 315335a707b61ec4

harvested Assembly for a simple architecture (graph method: a simple architecture). 3 bricks; individually on a fixture: 0 ran · 3 unverified. The assembly has not been run end-to-end.

one of 3 siblings

  1. GinMultiGraph entry · level 0 · unverified · c36f76cf05961797
  2. GinParent model · level 0 · unverified · c29df0a91a98fef7
  3. MLP model · level 0 · unverified · a514a7e4552016d2

harvested Assembly for a simple architecture (graph method: a simple architecture). 3 bricks; individually on a fixture: 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.

one of 3 siblings

  1. GIN_InfoMaxReg entry · level 0 · unverified · 7a017149093e4cd2
  2. Discriminator loss · level 1 · ran · 6e6181d4f831ff7a
  3. MLP model · level 1 · ran · 315335a707b61ec4

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="1810.00826") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

General ClassificationGraph ClassificationGraph RegressionGraph Representation LearningMolecular Property PredictionNode ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification BP-fMRI-97 GIN Accuracy 45.4% #7 of 7 Archive leaderboard report
Graph Classification BP-fMRI-97 GIN F1 42.3% #7 of 7 Archive leaderboard report
Graph Classification CIFAR10 100k GIN Accuracy (%) 53.28 #20 of 20 Archive leaderboard report
Graph Classification COLLAB GIN-0 Accuracy 80.2% #13 of 39 Archive leaderboard report
Graph Classification COX2 GIN-0 Accuracy(10-fold) 81.13 #1 of 3 Archive leaderboard report
Graph Classification D&D GIN Accuracy 77.311±2.223 #33 of 53 Archive leaderboard report
Graph Classification ENZYMES GIN Accuracy 68.303±4.170 #16 of 54 Archive leaderboard report
Graph Classification HIV-DTI-77 GIN Accuracy 55.1% #4 of 6 Archive leaderboard report
Graph Classification HIV-DTI-77 GIN F1 53.6% #4 of 6 Archive leaderboard report
Graph Classification HIV-fMRI-77 GIN Accuracy 52.5% #5 of 7 Archive leaderboard report
Graph Classification HIV-fMRI-77 GIN F1 35.6% #5 of 7 Archive leaderboard report
Graph Classification IMDb-B GIN Accuracy 81.250±3.775 #5 of 51 Archive leaderboard report
Graph Classification IMDb-B GIN-0 Accuracy 75.1% #25 of 51 Archive leaderboard report
Graph Classification IMDb-M GIN-0 Accuracy 52.3% #11 of 36 Archive leaderboard report
Graph Classification MUTAG GIN-0 Accuracy 89.4% #28 of 74 Archive leaderboard report
Graph Classification NCI1 GIN Accuracy 84.818±0.936 #18 of 69 Archive leaderboard report
Graph Classification NCI1 GIN-0 Accuracy 82.7% #30 of 69 Archive leaderboard report
Graph Classification NCI109 GIN Accuracy 84.155±0.812 #6 of 38 Archive leaderboard report
Graph Classification PROTEINS GIN Accuracy 75.536±1.851 #65 of 103 Archive leaderboard report
Graph Classification PROTEINS GIN-0 Accuracy 76,2% #103 of 103 Archive leaderboard report
Graph Classification PTC GIN-0 Accuracy 64.40% #24 of 37 Archive leaderboard report
Graph Classification Peptides-func GIN AP 0.6043±0.0216 #39 of 44 Archive leaderboard report
Graph Classification RE-M5K GIN-0 Accuracy 57.5% #1 of 8 Archive leaderboard report
Graph Classification REDDIT-B GIN-0 Accuracy 92.4 #3 of 12 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN+virtual node Ext. data No #14 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN+virtual node Number of params 13841815 #14 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN+virtual node Test F1 score 0.1581 ± 0.0026 #14 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN+virtual node Validation F1 score 0.1439 ± 0.0020 #14 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN Ext. data No #20 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN Number of params 12390715 #20 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN Test F1 score 0.1495 ± 0.0023 #20 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 GIN Validation F1 score 0.1376 ± 0.0016 #20 of 21 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN+virtual node Ext. data No #37 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN+virtual node Number of params 3336306 #37 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN+virtual node Test ROC-AUC 0.7707 ± 0.0149 #37 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN+virtual node Validation ROC-AUC 0.8479 ± 0.0068 #37 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN Ext. data No #42 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN Number of params 1885206 #42 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN Test ROC-AUC 0.7558 ± 0.0140 #42 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molhiv GIN Validation ROC-AUC 0.8232 ± 0.0090 #42 of 43 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN+virtual node Ext. data No #28 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN+virtual node Number of params 3374533 #28 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN+virtual node Test AP 0.2703 ± 0.0023 #28 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN+virtual node Validation AP 0.2798 ± 0.0025 #28 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN Ext. data No #33 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN Number of params 1923433 #33 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN Test AP 0.2266 ± 0.0028 #33 of 36 Archive leaderboard report
Graph Property Prediction ogbg-molpcba GIN Validation AP 0.2305 ± 0.0027 #33 of 36 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN+virtual node Ext. data No #13 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN+virtual node Number of params 3288042 #13 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN+virtual node Test Accuracy 0.7037 ± 0.0107 #13 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN+virtual node Validation Accuracy 0.6678 ± 0.0105 #13 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN Ext. data No #16 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN Number of params 1836942 #16 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN Test Accuracy 0.6892 ± 0.0100 #16 of 18 Archive leaderboard report
Graph Property Prediction ogbg-ppa GIN Validation Accuracy 0.6562 ± 0.0107 #16 of 18 Archive leaderboard report
Graph Regression ESR2 GIN R2 0.668±0.000 #4 of 9 Archive leaderboard report
Graph Regression ESR2 GIN RMSE 0.509±0.668 #4 of 9 Archive leaderboard report
Graph Regression F2 GIN R2 0.887±0.000 #3 of 9 Archive leaderboard report
Graph Regression F2 GIN RMSE 0.342±0.887 #3 of 9 Archive leaderboard report
Graph Regression KIT GIN R2 0.833±0.000 #5 of 9 Archive leaderboard report
Graph Regression KIT GIN RMSE 0.444±0.833 #5 of 9 Archive leaderboard report
Graph Regression Lipophilicity GIN R2 0.819±0.007 #4 of 23 Archive leaderboard report
Graph Regression Lipophilicity GIN RMSE 0.537±0.010 #4 of 23 Archive leaderboard report
Graph Regression PARP1 GIN R2 0.922±0.000 #3 of 9 Archive leaderboard report
Graph Regression PARP1 GIN RMSE 0.349±0.922 #3 of 9 Archive leaderboard report
Graph Regression PCQM4Mv2-LSC GIN Test MAE 0.1218 #18 of 20 Archive leaderboard report
Graph Regression PCQM4Mv2-LSC GIN Validation MAE 0.1195 #18 of 20 Archive leaderboard report
Graph Regression PGR GIN R2 0.696±0.000 #4 of 9 Archive leaderboard report
Graph Regression PGR GIN RMSE 0.532±0.696 #4 of 9 Archive leaderboard report
Graph Regression ZINC-500k GIN MAE 0.526 #35 of 36 Archive leaderboard report
Graph Regression ZINC-full GIN Test MAE 0.068±0.004 #15 of 19 Archive leaderboard report
Molecular Property Prediction ESOL GIN R2 0.938±0.011 #3 of 20 Archive leaderboard report
Molecular Property Prediction ESOL GIN RMSE 0.509±0.044 #3 of 20 Archive leaderboard report
Molecular Property Prediction FreeSolv GIN R2 0.964±0.008 #4 of 22 Archive leaderboard report
Molecular Property Prediction FreeSolv GIN RMSE 0.744±0.083 #4 of 22 Archive leaderboard report
Node Classification PATTERN 100k GIN Accuracy (%) 85.590 #5 of 9 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: GIN

GINGraph Convolutional NetworksGraphSAGE

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