Browse State-of-the-Art › Node Classification

Node Classification

991 papers with code · 138 benchmarks · 75 datasets archive 2025-07-28

Graphs

Node Classification is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.

Node Classification models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like Cora, Citeseer, and Pubmed, among others, typically using Accuracy and F1.

( Image credit: Fast Graph Representation Learning With PyTorch Geometric )

Description from the archive archive 2025-07-28; Papers-with-Code links inside it are rewritten to this site.

Benchmarks archive 2025-07-28

138 leaderboard tables shown for this task, 138 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 138 until expanded.

Syntology 47 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): Cora (24 judged, 0 placed), Citeseer (22 judged, 1 placed), Pubmed (20 judged, 0 placed), Wisconsin (10 judged, 1 placed), Actor (7 judged, 0 placed), Texas (9 judged, 1 placed), Chameleon (9 judged, 1 placed), Cornell (7 judged, 1 placed), Squirrel (7 judged, 0 placed), Penn94 (1 judged, 0 placed), Coauthor CS (3 judged, 1 placed), PPI (1 judged, 0 placed), Reddit (5 judged, 0 placed), Coauthor Physics (1 judged, 0 placed), Amazon Computers (2 judged, 0 placed), arXiv-year (2 judged, 0 placed), Amazon Photo (1 judged, 0 placed), pokec (1 judged, 0 placed), roman-empire (4 judged, 0 placed), BlogCatalog (1 judged, 0 placed), and 5 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
Cora (73 rows) SSP Optimization of Graph Neural Networks with Natural Gradient Descent code — Compare
Citeseer (71 rows) ACMII-Snowball-2 Is Heterophily A Real Nightmare For Graph Neural Networks To Do... — — Compare
Pubmed (70 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
Wisconsin (63 rows) 5-HiGCN Higher-order Graph Convolutional Network with Flower-Petals... 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
Actor (62 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Texas (62 rows) RDGNN-S Graph Neural Reaction Diffusion Models — — Compare
Chameleon (61 rows) DJ-GNN Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters 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
Cornell (60 rows) RDGNN-I Graph Neural Reaction Diffusion Models — — Compare
Squirrel (59 rows) FaberNet HoloNets: Spectral Convolutions do extend to Directed Graphs 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: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified Compare
CiteSeer with Public Split: fixed 20 nodes per class (40 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Chameleon (60%/20%/20% random splits) (38 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Film (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
PubMed (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
PubMed with Public Split: fixed 20 nodes per class (37 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Squirrel (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Cora with Public Split: fixed 20 nodes per class (36 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Cornell (60%/20%/20% random splits) (36 rows) ACMII-GCN Revisiting Heterophily For Graph Neural 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: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified Compare
Texas (60%/20%/20% random splits) (36 rows) ACM-GCN++ Revisiting Heterophily For Graph Neural 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: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified Compare
Wisconsin (60%/20%/20% random splits) (35 rows) ACM-GCN++ Revisiting Heterophily For Graph Neural 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: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified Compare
CiteSeer (60%/20%/20% random splits) (33 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Cora (60%/20%/20% random splits) (33 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Penn94 (32 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
Citeseer (48%/32%/20% fixed splits) (26 rows) Geom-GCN Geom-GCN: Geometric Graph Convolutional Networks code Syntology community repositories only · 7 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; 4 where Syntology's instrument failed) · 0 unverified Compare
Cora (48%/32%/20% fixed splits) (26 rows) NLGAT Non-Local Graph Neural Networks code Syntology official (archive's flag): 3 ran · 3 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; 3 where Syntology's instrument failed) · 0 unverified Compare
genius (26 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
PubMed (48%/32%/20% fixed splits) (26 rows) GCNII Simple and Deep Graph Convolutional Networks code Syntology official (archive's flag): 2 ran · 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result Compare
Coauthor CS (24 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
PPI (24 rows) g2-MLP A Proposal of Multi-Layer Perceptron with Graph Gating Unit for... code — Compare
PascalVOC-SP (21 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
COCO-SP (19 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
Reddit (16 rows) BNS-GCN BNS-GCN: Efficient Full-Graph Training of Graph Convolutional... code — Compare
Cora (0.5%) (15 rows) CPF-ind_APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 1 unverified Compare
Cora (1%) (15 rows) CPF-ind-APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 1 unverified Compare
Cora (3%) (15 rows) CPF-tra-GCNII Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 1 unverified Compare
AMZ Photo (14 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
CiteSeer (0.5%) (14 rows) MT-GCN Mutual Teaching for Graph Convolutional Networks code — Compare
CiteSeer (1%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
Coauthor Physics (14 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
PubMed (0.03%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
PubMed (0.05%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
PubMed (0.1%) (14 rows) Truncated Krylov Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks code Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified Compare
Amazon Computers (12 rows) GAT Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology official (archive's flag): 5 ran · 5 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; 2 where Syntology's instrument failed) · 4 unverified Compare
arXiv-year (12 rows) MRS-Dir-GNN Preventing Representational Rank Collapse in MPNNs by Splitting... code — Compare
CLUSTER (12 rows) GRIT Graph Inductive Biases in Transformers without Message Passing code Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified Compare
Amazon Photo (11 rows) GraphSAGE Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology official (archive's flag): 5 ran · 5 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; 2 where Syntology's instrument failed) · 4 unverified Compare
PATTERN (11 rows) 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
Cora: fixed 20 node per class (9 rows) DSGCN Bridging the Gap Between Spectral and Spatial Domains in Graph... code — Compare
Cora Full-supervised (9 rows) GCNII Simple and Deep Graph Convolutional Networks code Syntology official (archive's flag): 2 ran · 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result Compare
PATTERN 100k (9 rows) EGT Global Self-Attention as a Replacement for Graph Convolution code Syntology official (archive's flag): 3 ran · 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 Compare
Yelp-Fraud (9 rows) LEX-GNN LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection code — Compare
AM (8 rows) BoP From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis code — Compare
Facebook (8 rows) GNNMoE(GCN-like P) Mixture of Experts Meets Decoupled Message Passing: Towards... code — Compare
Flickr (8 rows) GCN+GAugM (Zhao et al., 2021) Data Augmentation for Graph Neural Networks 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
AIFB (7 rows) R-GCN Modeling Relational Data with Graph Convolutional Networks code Syntology official (archive's flag): 5 ran · 18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified Compare
AMZ Comp (7 rows) HH-GCN Half-Hop: A graph upsampling approach for slowing down message passing code Syntology official: harvested, nothing ran · 0 ran · 1 unverified Compare
BGS (7 rows) SCENE SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph... code — Compare
Brazil Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology official (archive's flag): 3 ran · 19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified Compare
Citeseer Full-supervised (7 rows) IncepGCN+DropEdge DropEdge: Towards Deep Graph Convolutional Networks on Node Classification code Syntology community repositories only · 4 ran (of which 0 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 Compare
Europe Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology official (archive's flag): 3 ran · 19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified Compare
pokec (7 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
Pubmed Full-supervised (7 rows) GraphSAGE+DropEdge DropEdge: Towards Deep Graph Convolutional Networks on Node Classification code Syntology community repositories only · 4 ran (of which 0 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 Compare
roman-empire (7 rows) Polynormer Polynormer: Polynomial-Expressive Graph Transformer in Linear Time code Syntology official (archive's flag): 5 ran · 5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified Compare
USA Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology official (archive's flag): 3 ran · 19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified Compare
Amazon-Fraud (6 rows) LEX-GNN LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection code — Compare
BlogCatalog (6 rows) ISNE Unsupervised Graph Representation Learning with Inductive Shallow... code — Compare
DBLP (6 rows) GRACE Deep Graph Contrastive Representation Learning code Syntology official: no sample here; runs from other or unrecorded repositories · 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
MUTAG (6 rows) BoP From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis code — Compare
Wiki-CS (6 rows) CGT Mitigating Degree Biases in Message Passing Mechanism by Utilizing... code — Compare
Wiki-Vote (6 rows) DEMO-Net(weight) DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph... code — Compare
Wikipedia (6 rows) GraphGAN GraphGAN: Graph Representation Learning with Generative Adversarial Nets code — Compare
AMZ Computers (5 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
Eximtradedata (5 rows) Struc2vec struc2vec: Learning Node Representations from Structural Identity code Syntology community repositories only · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified Compare
Cora Full (5 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Log Angeles (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks 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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
London (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks 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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
Paris (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks 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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
Placenta (5 rows) GraphSAGE A New Graph Node Classification Benchmark: Learning Structure from... code Syntology official (archive's flag): 2 ran · 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 Compare
Shanghai (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks 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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified Compare
amazon-ratings (4 rows) GAT Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology official (archive's flag): 5 ran · 5 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; 2 where Syntology's instrument failed) · 4 unverified Compare
AVA (4 rows) ASDNet [ASDNet_ICCV2021] Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection code — Compare
Chameleon (48%/32%/20% fixed splits) (4 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
Cora Full with Public Split (4 rows) CoLinkDist Distilling Self-Knowledge From Contrastive Links to Classify Graph... code Syntology official: harvested, nothing ran · 0 ran · 1 unverified Compare
MAG-scholar-C (4 rows) FastGCN GRAND+: Scalable Graph Random Neural Networks code — Compare
MAG240M-LSC (4 rows) R-GraphSAGE (NS) OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs code — Compare
minesweeper (4 rows) GCN Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology official (archive's flag): 5 ran · 5 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; 2 where Syntology's instrument failed) · 4 unverified Compare
MuMiN-large (4 rows) HeteroGraphSAGE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
MuMiN-medium (4 rows) HeteroGraphSAGE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
MuMiN-small (4 rows) LaBSE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
NELL (4 rows) DFNet-ATT DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters code Syntology official: harvested, nothing ran · 0 ran · 2 unverified Compare
Squirrel (48%/32%/20% fixed splits) (4 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
tolokers (4 rows) Polynormer Polynormer: Polynomial-Expressive Graph Transformer in Linear Time code Syntology official (archive's flag): 5 ran · 5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified Compare
Cornell (48%/32%/20% fixed splits) (3 rows) GREAD-AC GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
MS ACADEMIC (3 rows) APPNP Predict then Propagate: Graph Neural Networks meet Personalized PageRank code Syntology official (archive's flag): 11 ran · 11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified Compare
questions (3 rows) NID Node Identifiers: Compact, Discrete Representations for Efficient... code Syntology official (archive's flag): 10 ran · 10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified Compare
AMPLUS (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
Chameleon(60%/20%/20% random splits) (2 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Citeseer: fixed 20 node per class (2 rows) SDSS-GAT Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Coauthor Phy (2 rows) GCN-LPA Unifying Graph Convolutional Neural Networks and Label Propagation code Syntology 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified Compare
Cora: fixed 10 node per class (2 rows) CPF-tra-GCNII Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 1 unverified Compare
Cora: fixed 5 node per class (2 rows) CPF-tra-APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 1 unverified Compare
Crocodile (2 rows) LW-GCN Label-Wise Graph Convolutional Network for Heterophilic Graphs code — Compare
Deezer Romania (2 rows) PairE Graph Representation Learning Beyond Node and Homophily code — Compare
DMG777K (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
DMGFULL (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
MDGENRE (2 rows) R-GCN R-GCN: The R Could Stand for Random code — Compare
Squirrel(60%/20%/20% random splits) (2 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Telegram (Directed Graph label rate 60%) (2 rows) ScaleNet Scale Invariance of Graph Neural Networks code — Compare
Texas (48%/32%/20% fixed splits) (2 rows) GREAD-F GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
twitch-gamers (2 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
Wiki (2 rows) DANMF Deep Autoencoder-like Nonnegative Matrix Factorization for... code — Compare
wiki (2 rows) A2DUG A Simple and Scalable Graph Neural Network for Large Directed Graphs code Syntology official (archive's flag): 10 ran · 10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified Compare
Wisconsin (48%/32%/20% fixed splits) (2 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
YouTube (2 rows) LINE GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding code Syntology 4 ran (of which 0 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) · 3 unverified Compare
20NEWS (1 row) GraRep GraRep: Learning Graph Representations with Global Structural Information code — Compare
Amazon2M (1 row) Cluster-GCN Cluster-GCN: An Efficient Algorithm for Training Deep and Large... code — Compare
AMZ Computers: fixed 20 node per class (1 row) SDSS-GCN Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
BGP (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
Bitcoin-Alpha (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
Bitcoin-OTC (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
CellTypeGraph Benchmark (1 row) plantcelltype-EdgeDeeperGCN CellTypeGraph: A New Geometric Computer Vision Benchmark code — Compare
CiteSeer: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Citeseer random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
CiteSeer with Public Split: fixed 5 nodes per class (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
Cora: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Cora: fixed 20 nodes per class (1 row) SDSS-GCN Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Cora random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
DBLP: 20 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
DBLP: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Deezer Croatia (1 row) GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Deezer Hungary (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Electronics (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
Film(48%/32%/20% fixed splits) (1 row) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology official (archive's flag): 6 ran · 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified Compare
NBA (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
ogbn-products (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
ogbn-products: 20 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
PubMed: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Pubmed: fixed 20 node per class (1 row) SDSS-APPNP Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Pubmed random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning 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

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

Subtasks archive 2025-07-28

5 subtasks in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 1,860 · with a code link: 991 · where Syntology ran a sample: 305 (251 with a run with no instrument failure, 54 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (305 of 1,860 tagged: 251 with a run with no instrument failure, 54 where every run was a failure of Syntology's instrument)

Page 1 of 19: papers 1 to 100 of 1,860, 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 77 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