Browse State-of-the-Art › Graph Classification

Graph Classification

483 papers with code · 73 benchmarks · 54 datasets archive 2025-07-28

Graphs

Graph Classification is a task that involves classifying a graph-structured data into different classes or categories. Graphs are a powerful way to represent relationships and interactions between different entities, and graph classification can be applied to a wide range of applications, such as social network analysis, bioinformatics, and recommendation systems. In graph classification, the input is a graph, and the goal is to learn a classifier that can accurately predict the class of the graph.

( Image credit: Hierarchical Graph Pooling with Structure Learning )

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

73 leaderboard tables shown for this task, 73 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 73 until expanded.

Syntology 27 newer papers were judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 3 placed): PROTEINS (13 judged, 0 placed), MUTAG (10 judged, 0 placed), NCI1 (9 judged, 3 placed), ENZYMES (6 judged, 0 placed), D&D (4 judged, 0 placed), IMDb-B (9 judged, 0 placed), Peptides-func (5 judged, 0 placed), COLLAB (4 judged, 0 placed), NCI109 (4 judged, 1 placed), PTC (1 judged, 0 placed), IMDb-M (5 judged, 0 placed), REDDIT-B (2 judged, 0 placed), REDDIT-BINARY (2 judged, 0 placed), IMDB-BINARY (8 judged, 0 placed), Mutagenicity (1 judged, 0 placed), BBBP (1 judged, 0 placed), Tox21 (1 judged, 0 placed), AIDS (1 judged, 0 placed), BACE (1 judged, 0 placed), clintox (1 judged, 0 placed), and 11 more leaderboards in the JSON twin. Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
PROTEINS (103 rows) HGP-SL Hierarchical Graph Pooling with Structure Learning code — Compare
MUTAG (74 rows) Evolution of Graph Classifiers Evolution of Graph Classifiers code — Compare
NCI1 (69 rows) TFGW ADJ (L=2) Template based Graph Neural Network with Optimal Transport Distances code — Compare
ENZYMES (54 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
D&D (53 rows) U2GNN (Unsupervised) Universal Graph Transformer Self-Attention Networks code Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
IMDb-B (51 rows) U2GNN (Unsupervised) Universal Graph Transformer Self-Attention Networks code Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
Peptides-func (44 rows) ESA + RWSE (Edge set attention, Random Walk Structural Encoding, + validation set) An end-to-end attention-based approach for learning on graphs code — Compare
COLLAB (39 rows) U2GNN (Unsupervised) Universal Graph Transformer Self-Attention Networks code Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
NCI109 (38 rows) WKPI-kcenters Learning metrics for persistence-based summaries and applications... code — Compare
PTC (37 rows) U2GNN (Unsupervised) Universal Graph Transformer Self-Attention Networks code Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
IMDb-M (36 rows) U2GNN (Unsupervised) Universal Graph Transformer Self-Attention Networks code Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
CIFAR10 100k (20 rows) NeuralWalker Learning Long Range Dependencies on Graphs via Random Walks code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified Compare
MNIST (13 rows) ESA (Edge set attention, no positional encodings, tuned) An end-to-end attention-based approach for learning on graphs code — Compare
REDDIT-B (12 rows) CRaWl Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning... code — Compare
REDDIT-BINARY (9 rows) R-GIN + PANDA PANDA: Expanded Width-Aware Message Passing Beyond Rewiring code Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified Compare
IMDB-BINARY (8 rows) Local Topological Profile (LTP) Strengthening structural baselines for graph classification using... code — Compare
RE-M5K (8 rows) GIN-0 How Powerful are Graph Neural Networks? code Syntology official (archive's flag): 2 ran · 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 Compare
UPFD-GOS (8 rows) UPFD-SAGE User Preference-aware Fake News Detection code Syntology official (archive's flag): 1 ran · 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 Compare
UPFD-POL (8 rows) HGFND Nothing Stands Alone: Relational Fake News Detection with... code — Compare
BP-fMRI-97 (7 rows) IsoNN IsoNN: Isomorphic Neural Network for Graph Representation Learning... code — Compare
HIV-fMRI-77 (7 rows) IsoNN IsoNN: Isomorphic Neural Network for Graph Representation Learning... code — Compare
FRANKENSTEIN (6 rows) GWL_WL Graph Invariant Kernels — — Compare
HIV-DTI-77 (6 rows) IsoNN IsoNN: Isomorphic Neural Network for Graph Representation Learning... code — Compare
RE-M12K (6 rows) GFN-light Are Powerful Graph Neural Nets Necessary? A Dissection on Graph... code — Compare
HIV dataset (5 rows) CIN++ CIN++: Enhancing Topological Message Passing code — Compare
Mutagenicity (5 rows) TREE-G TREE-G: Decision Trees Contesting Graph Neural Networks code Syntology official (archive's flag): 9 ran · 9 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; 0 where Syntology's instrument failed) · 1 unverified Compare
NEURON-Average (5 rows) WKPI-kcenters Learning metrics for persistence-based summaries and applications... code — Compare
NEURON-BINARY (5 rows) WKPI-kmeans Learning metrics for persistence-based summaries and applications... code — Compare
NEURON-MULTI (5 rows) WKPI-kcenters Learning metrics for persistence-based summaries and applications... code — Compare
MalNet-Tiny (4 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
BBBP (3 rows) G-Tuning Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified Compare
COX2 (3 rows) GIN-0 How Powerful are Graph Neural Networks? code Syntology official (archive's flag): 2 ran · 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 Compare
HIV (3 rows) GTOT-Tuning Fine-Tuning Graph Neural Networks via Graph Topology induced... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
REDDIT-MULTI-12K (3 rows) GNN (DiffPool) Hierarchical Graph Representation Learning with Differentiable Pooling code Syntology 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) · 10 unverified Compare
Synthetic Dynamic Networks (3 rows) Time-cohort Dynamic Features + Static Features Learning the mechanisms of network growth code — Compare
Tox21 (3 rows) GMT Accurate Learning of Graph Representations with Graph Multiset Pooling code Syntology official (archive's flag): 4 ran · 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result Compare
ToxCast (3 rows) GMT Accurate Learning of Graph Representations with Graph Multiset Pooling code Syntology official (archive's flag): 4 ran · 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result Compare
AIDS (2 rows) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
BACE (2 rows) G-Tuning Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified Compare
clintox (2 rows) G-Tuning Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified Compare
IPC-grounded (2 rows) GG-NN Gated Graph Sequence Neural Networks code Syntology 9 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; 0 where Syntology's instrument failed) · 3 unverified Compare
IPC-lifted (2 rows) CNN IPC: A Benchmark Data Set for Learning with Graph-Structured Data code — Compare
MUV (2 rows) GTOT-Tuning Fine-Tuning Graph Neural Networks via Graph Topology induced... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
SIDER (2 rows) GTOT-Tuning Fine-Tuning Graph Neural Networks via Graph Topology induced... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
20NEWS (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare
5pt. Bench-Easy (1 row) NDP Hierarchical Representation Learning in Graph Neural Networks with... code Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
ADNI (1 row) NeuroPath NeuroPath: A Neural Pathway Transformer for Joining the Dots of... code Syntology official (archive's flag): 2 ran · 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified Compare
Bench-hard (1 row) NDP Hierarchical Representation Learning in Graph Neural Networks with... code Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
BZR (1 row) GDL-g (ADJ) Online Graph Dictionary Learning code — Compare
Cancer (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare
CIFAR-10 (1 row) CKGCN CKGConv: General Graph Convolution with Continuous Kernels code Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified Compare
Citeseer (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare
COIL-RAG (1 row) SPI-GCN SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network — — Compare
Cora (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare
CSL (1 row) CIN Weisfeiler and Lehman Go Cellular: CW Networks code — Compare
Digits (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare
HCP Aging (1 row) NeuroPath NeuroPath: A Neural Pathway Transformer for Joining the Dots of... code Syntology official (archive's flag): 2 ran · 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified Compare
HIV-fMRI-77 (1 row) IsoNN IsoNN: Isomorphic Neural Network for Graph Representation Learning... code — Compare
HYDRIDES (1 row) SPI-GCN SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network — — Compare
IMDB-MULTI (1 row) Local Topological Profile (LTP) Strengthening structural baselines for graph classification using... code — Compare
MSRC-21 (per-class) (1 row) G-Tuning Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified Compare
NC1 (1 row) EigenGCN-3 Graph Convolutional Networks with EigenPooling code — Compare
NCI-123 (1 row) GAM Graph Classification using Structural Attention code — Compare
NCI-83 (1 row) GAM Graph Classification using Structural Attention code — Compare
NCI33 (1 row) GAM Graph Classification using Structural Attention code — Compare
OASIS (1 row) NeuroPath NeuroPath: A Neural Pathway Transformer for Joining the Dots of... code Syntology official (archive's flag): 2 ran · 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified Compare
Pubmed (1 row) Fea2Fea-s3 Fea2Fea: Exploring Structural Feature Correlations via Graph... code — Compare
REDDIT-12K (1 row) G-Tuning Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns code Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified Compare
REDDIT-MULTI-5k (1 row) GraphSAGE A Fair Comparison of Graph Neural Networks for Graph Classification code — Compare
SYNTHIE (1 row) SPI-GCN SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network — — Compare
UK Biobank Brain MRI (1 row) NeuroPath NeuroPath: A Neural Pathway Transformer for Joining the Dots of... code Syntology official (archive's flag): 2 ran · 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified Compare
Web (1 row) UGraphEmb-F Unsupervised Inductive Graph-Level Representation Learning via... code — Compare
Wine (1 row) sKNN-LDS Mutual Information Maximization in Graph Neural Networks code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

54 datasets whose archive record lists this task, ordered by the archive's paper count. 30 shown of 54 until expanded.

Subtasks archive 2025-07-28

3 subtasks in the archive's task tree.

Parent tasks archive 2025-07-28

Papers archive 2025-07-28

archive papers tagged: 927 · with a code link: 483 · where Syntology ran a sample: 174 (149 with a run with no instrument failure, 25 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (174 of 927 tagged: 149 with a run with no instrument failure, 25 where every run was a failure of Syntology's instrument)

Page 1 of 10: papers 1 to 100 of 927, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

Syntology lines on 61 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

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