Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification
Abstract
In the transductive setting, where the full graph is observed but node labels are only partially available, progress in semi-supervised node classification has largely focused on architectural innovation. In this paper, we revisit an orthogonal axis: the training objective. We start from a simple observation: transductive models produce predictions for every node during training, including nodes without labels. These unlabeled-node predictions may contain useful training signal, but standard supervised objectives discard them because no ground-truth labels are available. Inspired by the decomposition of cross-entropy into a label-dependent alignment term and a label-independent entropy term, we propose prediction confidence as a natural way to extract this signal in the absence of labels. This motivates Transductive Sharpening (TS): a loss-level modification that minimizes prediction entropy on unlabeled nodes while counterbalancing this effect on labeled nodes. We evaluate Transductive Sharpening across a wide range of node-classification benchmarks and observe consistent performance improvements without requiring any changes to the backbone architecture. Code is available at.
Benchmark Results
Tested on 11 datasets 60 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 best reported | best at pub: Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment (TMLR 2025) |
| 44 | GAT | 0.8897
±0.0014 best reported | |
| 68 | NodeFormer | 0.8848
±0.0033 best reported | best at pub: Efficient Tuning and Inference for Large Language Models on Textual Graphs (IJCAI 2024) |
| 141 | GraphSAGE | 0.8708
±0.0085 | |
| 175 | OGFormer | 0.8640
±0.0030 | This paper |
| 186 | NormProp | 0.8607 best reported | best at pub: Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering (2025) Difference within reported uncertainty; not counted as underperformance. |
| 196 | GCN+TS | 0.8574
±0.0054 | prev best: TSC: A Simple Two-Sided Constraint against Over-Smoothing (KDD 2024) Improvement within reported uncertainty; not highlighted. |
| 214 | SAGE+T | 0.8528
±0.0111 | This paper |
| 233 | SGFormer | 0.8482
±0.0085 | prev best: Latent-Hysteresis Graph ODEs: Modeling Coupled Topology-Feature Evolution via Continuous Phase Transitions (2026) Improvement within reported uncertainty; not highlighted. |
| 244 | GAT+T | 0.8462
±0.0089 | This paper |
| 277 | ELU-GCN | 0.8429
±0.0039 | This paper |
| 291 | Exphormer | 0.8410
±0.0080 best reported | best at pub: Diffusion on Graph: Augmentation of Graph Structure for Node Classification (TMLR 2025) Difference within reported uncertainty; not counted as underperformance. |
| 314 | GraphGPS | 0.8387
±0.0096 | prev best: Latent-Hysteresis Graph ODEs: Modeling Coupled Topology-Feature Evolution via Continuous Phase Transitions (2026) Improvement within reported uncertainty; not highlighted. |
| 381 | Polynormer | 0.8343
±0.0089 | prev best: Latent-Hysteresis Graph ODEs: Modeling Coupled Topology-Feature Evolution via Continuous Phase Transitions (2026) Improvement within reported uncertainty; not highlighted. |
| 401 | GOAT | 0.8326
±0.0124 | This paper |
| 516 | NAGphormer | 0.8213
±0.0118 best reported | best at pub: Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction (NeurIPS 2025) Difference within reported uncertainty; not counted as underperformance. |
| 724 | MLP | 0.7768 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 866 | MLP+TS | 0.6448
±0.0283 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 7 | NodeFormer | 0.9490
±0.0019 best reported | |
| 18 | GCN | 0.9296
±0.0015 best reported | |
| 20 | GAT | 0.9233
±0.0018 best reported | |
| 53 | Polynormer | 0.9044
±0.0021 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) |
| 56 | SGFormer | 0.9037
±0.0020 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) |
| 91 | NAGphormer | 0.8939
±0.0013 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 99 | GOAT | 0.8915
±0.0039 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) |
| 105 | Exphormer | 0.8906
±0.0024 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) |
| 116 | SAGE | 0.8881
±0.0015 best reported | best at pub: Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment (TMLR 2025) |
| 125 | GraphSAGE | 0.8864
±0.0030 | |
| 172 | GraphGPS | 0.8772
±0.0030 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) |
| 210 | MLP | 0.8690
±0.0074 best reported | best at pub: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) |
| 343 | NormProp | 0.8153
±0.0001 best reported | best at pub: Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering (2025) Difference within reported uncertainty; not counted as underperformance. |
| 348 | OGFormer | 0.8150
±0.0050 | This paper |
| 392 | GCN+TS | 0.8074
±0.0030 | prev best: TSC: A Simple Two-Sided Constraint against Over-Smoothing (KDD 2024) Improvement within reported uncertainty; not highlighted. |
| 403 | ELU-GCN | 0.8051
±0.0021 | This paper |
| 482 | SAGE+T | 0.7972
±0.0069 | This paper |
| 611 | GAT+T | 0.7884
±0.0067 | This paper |
| 822 | MLP+TS | 0.7230
±0.0189 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | This paper |
| 2 | GAT | 0.9669
±0.0014 | |
| 3 | GAT+T | 0.9660
±0.0007 | This paper |
| 4 | Polynormer | 0.9657
±0.0023 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 5 | SAGE+T | 0.9651
±0.0023 | This paper |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 | |
| 9 | GCN+TS | 0.9621
±0.0011 | This paper |
| 11 | NAGphormer | 0.9614
±0.0016 | Improvement within reported uncertainty; not highlighted. |
| 23 | Exphormer | 0.9569
±0.0039 | prev best: Even Sparser Graph Transformers (NeurIPS 2024) Improvement within reported uncertainty; not highlighted. |
| 29 | SGFormer | 0.9558
±0.0036 | |
| 32 | OGFormer | 0.9550 | This paper |
| 44 | NodeFormer | 0.9527
±0.0022 best reported | best at pub: SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning (2023) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 56 | GraphSAGE | 0.9508
±0.0026 | |
| 57 | GraphGPS | 0.9506
±0.0013 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) best today: Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization? (LoG 2025) Difference within reported uncertainty; not counted as underperformance. |
| 86 | GOAT | 0.9433
±0.0021 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 390 | MLP | 0.9128
±0.0063 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 492 | MLP+TS | 0.8765
±0.0022 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | This paper |
| 2 | GCN | 0.9412
±0.0008 | prev best: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) Improvement within reported uncertainty; not highlighted. |
| 3 | GAT | 0.9398
±0.0022 | prev best: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) Improvement within reported uncertainty; not highlighted. |
| 4 | GCN+TS | 0.9398
±0.0026 | This paper |
| 5 | GAT+T | 0.9386
±0.0013 | This paper |
| 6 | Polynormer | 0.9378
±0.0010 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 8 | SAGE | 0.9351
±0.0006 | prev best: Automatic Graph Topology-Aware Transformer (2024) |
| 9 | SAGE+T | 0.9343
±0.0011 | This paper |
| 12 | OGFormer | 0.9290
±0.0030 | This paper |
| 18 | SGFormer | 0.9242
±0.0066 | |
| 20 | GOAT | 0.9229
±0.0037 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 33 | Exphormer | 0.9180
±0.0035 | prev best: Revisiting the Necessity of Graph Learning and Common Graph Benchmarks (2024) Improvement within reported uncertainty; not highlighted. |
| 34 | GraphGPS | 0.9179
±0.0063 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 38 | NAGphormer | 0.9169
±0.0030 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 46 | GraphSAGE | 0.9120
±0.0029 | |
| 48 | NodeFormer | 0.9112
±0.0043 best reported | |
| 320 | MLP | 0.8463 best reported | |
| 387 | MLP+TS | 0.8287
±0.0056 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GrokFormer | 0.9831
±0.0018 | |
| 2 | PolyFormer | 0.9808
±0.0027 | |
| 3 | SGFormer | 0.9796
±0.0081 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 5 | NAGphormer | 0.9785
±0.0026 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 6 | GAT | 0.9782
±0.0028 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 9 | GCN | 0.9774
±0.0035 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 13 | GraphGPS | 0.9760
±0.0005 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 16 | GCN+TS | 0.9744
±0.0014 | This paper |
| 17 | SAGE | 0.9739
±0.0018 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) Difference within reported uncertainty; not counted as underperformance. |
| 18 | GraphTARIF | 0.9739
±0.0007 | This paper |
| 23 | GAT+T | 0.9726
±0.0003 | This paper |
| 25 | SAGE+T | 0.9723 | This paper |
| 26 | Polynormer | 0.9722
±0.0006 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 27 | Exphormer | 0.9720
±0.0010 best reported | best at pub: Revisiting the Necessity of Graph Learning and Common Graph Benchmarks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 34 | NodeFormer | 0.9680
±0.0063 best reported | best at pub: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) Difference within reported uncertainty; not counted as underperformance. |
| 43 | GraphSAGE | 0.9649
±0.0006 | |
| 44 | GOAT | 0.9647
±0.0016 | prev best: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention (WWW 2026) Improvement within reported uncertainty; not highlighted. |
| 57 | MLP+TS | 0.9598
±0.0008 | This paper |
| 58 | MLP | 0.9597
±0.0007 | prev best: Clarify Confused Nodes via Separated Learning (2023) Improvement within reported uncertainty; not highlighted. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 5 | SAGE+T | 0.8823 best reported | |
| 9 | SAGE | 0.8771 best reported | |
| 31 | GAT | 0.8533 best reported | |
| 48 | NAGphormer | 0.8341
±0.0034 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 54 | GIN | 0.8303
±0.0021 | |
| 57 | SGFormer | 0.8271
±0.0056 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 74 | NodeFormer | 0.8103
±0.0094 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 77 | GraphTARIF | 0.8093
±0.0057 | This paper |
| 88 | GCN+TS | 0.8031
±0.0044 | This paper |
| 90 | Polynormer | 0.8026
±0.0092 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 117 | Exphormer | 0.7938
±0.0062 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 120 | GraphGPS | 0.7926
±0.0057 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 176 | GOAT | 0.7796
±0.0063 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 237 | MLP | 0.7469
±0.0085 best reported | best at pub: View Space: Learning Representation across Arbitrary Graphs (ICML 2025) |
| 249 | MLP+TS | 0.7248
±0.0083 | This paper |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 best reported | best at pub: The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs (KDD 2024) |
| 25 | FSGNN | 0.7827
±0.0128 best reported | best at pub: Efficient Learning on Large Graphs using a Densifying Regularity Lemma (2025) best today: Directed Homophily-Aware Graph Neural Network (2025) |
| 45 | GloGNN | 0.7133
±0.0242 best reported | best at pub: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 52 | GCN | 0.7033 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 72 | GPRGNN | 0.6748
±0.0040 best reported | best at pub: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 108 | SAGE | 0.6340
±0.0300 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) |
| 115 | GraphSAGE | 0.6215
±0.0042 | |
| 133 | H2GCN | 0.6030
±0.0231 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 138 | Polynormer | 0.6000
±0.0180 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) |
| 159 | GraphGPS | 0.5620
±0.0380 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) |
| 169 | MLP | 0.5429 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 188 | SGFormer | 0.5140
±0.0170 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) |
| 212 | GCN+ReP | 0.4757
±0.0390 | This paper |
| 213 | CoED | 0.4727
±0.0362 | This paper |
| 215 | M3Dphormer | 0.4709
±0.0405 | This paper |
| 225 | GCN+TS | 0.4527
±0.0474 | This paper |
| 228 | GAT+T | 0.4452
±0.0369 | This paper |
| 230 | MLP+TS | 0.4386
±0.0523 | This paper |
| 237 | SAGE+T | 0.4332
±0.0467 | This paper |
| 267 | NodeFormer | 0.3638
±0.0385 | prev best: Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs (2025) Improvement within reported uncertainty; not highlighted. |
| 270 | CPGNN | 0.3300
±0.0315 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | IBG-NN | 0.7763
±0.0179 | |
| 2 | Dir-GNN+CNA | 0.7747
±0.0128 | |
| 3 | DHGNN | 0.7684
±0.0161 | |
| 11 | FSGNN | 0.7416 best reported | best at pub: Simplifying approach to Node Classification in Graph Neural Networks (2021) |
| 19 | GloGNN | 0.7121
±0.0184 best reported | best at pub: Directed Homophily-Aware Graph Neural Network (2025) |
| 39 | H2GCN | 0.6190
±0.0140 best reported | best at pub: Efficient Learning on Large Graphs using a Densifying Regularity Lemma (2025) |
| 46 | GCN | 0.6067 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 61 | GraphGPS | 0.5690
±0.0300 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) |
| 67 | GAT | 0.5630
±0.0220 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 76 | GPRGNN | 0.5435
±0.0087 best reported | best at pub: Directed Homophily-Aware Graph Neural Network (2025) |
| 110 | GCN+ReP | 0.4589
±0.0145 | This paper |
| 113 | GraphTARIF | 0.4558
±0.0191 | This paper |
| 114 | CoED | 0.4550
±0.0162 | This paper |
| 120 | SAGE | 0.4460
±0.0130 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) Difference within reported uncertainty; not counted as underperformance. |
| 121 | GCN+TS | 0.4457
±0.0204 | This paper |
| 123 | M3Dphormer | 0.4434
±0.0194 | This paper |
| 128 | GraphSAGE | 0.4378
±0.0190 | |
| 138 | SGFormer | 0.4265
±0.0241 | prev best: SCNode: Spatial and Contextual Coordinates for Graph Representation Learning (TMLR 2024) |
| 146 | Polynormer | 0.4197
±0.0214 | prev best: Scale-aware Message Passing For Graph Node Classification (2024) |
| 151 | SAGE+T | 0.4132
±0.0235 | This paper |
| 162 | GAT+T | 0.4036
±0.0166 | This paper |
| 171 | MLP+TS | 0.3939
±0.0091 | This paper |
| 172 | MLP | 0.3930
±0.0079 | prev best: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 175 | NodeFormer | 0.3889
±0.0267 | prev best: SCNode: Spatial and Contextual Coordinates for Graph Representation Learning (TMLR 2024) Improvement within reported uncertainty; not highlighted. |
| 241 | CPGNN | 0.3004
±0.0203 | This paper |
Heterophily Benchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Dir-Poly | 0.9451
±0.0022 | This paper |
| 2 | D-CDE | 0.9387
±0.0041 | |
| 3 | LargeScaleNet | 0.9358
±0.0024 | |
| 5 | GraphTARIF | 0.9323
±0.0038 | This paper |
| 7 | Polynormer | 0.9266
±0.0060 | Improvement within reported uncertainty; not highlighted. |
| 11 | CoED | 0.9217
±0.0029 | This paper |
| 15 | BuNN | 0.9175
±0.0039 | This paper |
| 16 | GCN+TS | 0.9166
±0.0020 | This paper |
| 23 | SAGE+T | 0.9127
±0.0036 | This paper |
| 26 | GraphSAGE | 0.9106
±0.0027 | |
| 27 | GAT+T | 0.9093
±0.0020 | This paper |
| 61 | GCN+ReP | 0.8643
±0.0074 | This paper |
| 64 | SAGE | 0.8574
±0.0067 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) best today: TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows (2025) |
| 77 | GCN | 0.8272
±0.0082 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) |
| 78 | GraphGPS | 0.8272
±0.0068 | This paper |
| 83 | GAT | 0.8145
±0.0009 best reported | best at pub: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 90 | SGFormer | 0.8001
±0.0044 | |
| 92 | FSGNN | 0.7992
±0.0056 | This paper |
| 109 | NodeFormer | 0.7483
±0.0081 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 129 | H2GCN | 0.6809
±0.0029 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| 133 | GPRGNN | 0.6704
±0.0092 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 135 | MLP | 0.6665
±0.0047 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 138 | MLP+TS | 0.6612
±0.0029 | This paper |
| 152 | CPGNN | 0.6396
±0.0062 | This paper |
| 154 | GloGNN | 0.6385
±0.0049 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | UniGAP | 0.6375
±0.0110 | |
| 2 | H2GCN + HalfHop | 0.5961
±0.0100 | |
| 3 | GraphSAGE + HalfHop | 0.5897
±0.0150 | |
| 7 | H2GCN | 0.5681
±0.0090 best reported | |
| 8 | SAGE+T | 0.5672
±0.0035 | This paper |
| 9 | GraphTARIF | 0.5586
±0.0042 | This paper |
| 11 | GAT+T | 0.5573
±0.0031 | This paper |
| 12 | SAGE | 0.5569
±0.0023 | prev best: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 14 | GAT | 0.5559
±0.0027 | prev best: Relieving the Over-Aggregating Effect in Graph Transformers (NeurIPS 2025) |
| 15 | GraphSAGE | 0.5540
±0.0020 | |
| 18 | Polynormer | 0.5496
±0.0022 | prev best: Relieving the Over-Aggregating Effect in Graph Transformers (NeurIPS 2025) Improvement within reported uncertainty; not highlighted. |
| 23 | SGFormer | 0.5414
±0.0062 | prev best: Relieving the Over-Aggregating Effect in Graph Transformers (NeurIPS 2025) |
| 24 | GCN | 0.5411
±0.0034 | prev best: UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks (2024) Improvement within reported uncertainty; not highlighted. |
| 26 | GCN+TS | 0.5406
±0.0058 | This paper |
| 28 | BuNN | 0.5374
±0.0051 | This paper |
| 40 | GraphGPS | 0.5327
±0.0066 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 49 | GCN+ReP | 0.5275
±0.0062 | This paper |
| 50 | FSGNN | 0.5274
±0.0083 | This paper |
| 81 | Dir-Poly | 0.5073
±0.0056 | This paper |
| 84 | MLP | 0.5058 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 101 | MLP+TS | 0.4950
±0.0027 | This paper |
| 149 | GPRGNN | 0.4488
±0.0034 | This paper |
| 154 | CPGNN | 0.4436
±0.0035 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| 160 | NodeFormer | 0.4386
±0.0035 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) best today: Relieving the Over-Aggregating Effect in Graph Transformers (NeurIPS 2025) Difference within reported uncertainty; not counted as underperformance. |
| 196 | GloGNN | 0.3728
±0.0066 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
Minesweeper
Global leaderboard →Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9903
±0.0019 | This paper |
| 2 | BuNN | 0.9899
±0.0016 | This paper |
| 3 | M3Dphormer | 0.9827
±0.0020 | This paper |
| 5 | GAT | 0.9786
±0.0037 | prev best: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing (2025) |
| 6 | GAT+T | 0.9786
±0.0037 | This paper |
| 7 | GCN+TS | 0.9780
±0.0020 | This paper |
| 8 | Polynormer | 0.9749
±0.0048 | prev best: Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning (2026) Improvement within reported uncertainty; not highlighted. |
| 9 | GCN | 0.9744
±0.0017 | prev best: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing (2025) |
| 10 | SAGE+T | 0.9733
±0.0094 | This paper |
| 11 | SAGE | 0.9709
±0.0100 | This paper |
| 12 | GCN+ReP | 0.9605
±0.0019 | This paper |
| 16 | Dir-Poly | 0.9374
±0.0070 | This paper |
| 17 | GraphGPS | 0.9229
±0.0061 best reported | best at pub: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing (2025) |
| 20 | SGFormer | 0.9142
±0.0041 | This paper |
| 24 | FSGNN | 0.9008
±0.0070 | This paper |
| 25 | H2GCN | 0.8971
±0.0031 | This paper |
| 27 | NodeFormer | 0.8771
±0.0069 | prev best: Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning (2026) Improvement within reported uncertainty; not highlighted. |
| 31 | GPRGNN | 0.8624
±0.0061 | This paper |
| 43 | MLP | 0.8000 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) best today: Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors (ICLR 2026) |
| 57 | CPGNN | 0.5203
±0.0546 | This paper |
| 58 | GloGNN | 0.5108
±0.0123 | This paper |
| 59 | MLP+TS | 0.5097
±0.0156 | This paper |
