Classic
Amazon-Photo
Structure
1Graphs
7,650Nodes
119,081Edges
8Classes
745Node Feature Dim
0.8365Homophily
Coverage
800Results
1Variants
139Papers
- Graph Navier–Stokes Networks Graph Navier–Stokes Networks
- Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification
- From Model to Data (M2D): Shifting Complexity from GNNs to Graphs for Transparent Graph Learning From Model to Data (M2D): Shifting Complexity from GNNs to Graphs for Transparent Graph Learning
- Adaptive Negative Scheduling for Graph Contrastive Learning Adaptive Negative Scheduling for Graph Contrastive Learning
- ICLR 2026: Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors ICLR 2026
- Geometric Evolution Graph Convolutional Networks: Enhancing Graph Representation Learning via Ricci Flow Geometric Evolution Graph Convolutional Networks: Enhancing Graph Representation Learning via Ricci Flow
- GIST: Gauge-Invariant Spectral Transformers for Scalable Graph Neural Operators GIST: Gauge-Invariant Spectral Transformers for Scalable Graph Neural Operators
- WWW 2026: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention WWW 2026
- TMLR 2026: EdgeMask-DG*: Learning Domain-Invariant Graph Structures via Adversarial Edge Masking EdgeMask-DG*: Learning Domain-Invariant Graph Structures via Adversarial Edge Masking TMLR 2026
- SPGCL: Simple yet Powerful Graph Contrastive Learning via SVD-Guided Structural Perturbation SPGCL: Simple yet Powerful Graph Contrastive Learning via SVD-Guided Structural Perturbation
- Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion
- CORE: Contrastive Masked Feature Reconstruction on Graphs CORE: Contrastive Masked Feature Reconstruction on Graphs
- ICML 2025: View Space: Learning Representation across Arbitrary Graphs View Space: Learning Representation across Arbitrary Graphs ICML 2025
- LoG 2025: Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization? Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization? LoG 2025
- Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering
- WWW 2025: GraphTARIF: Linear Graph Transformer with Augmented Rank and Improved Focus GraphTARIF: Linear Graph Transformer with Augmented Rank and Improved Focus WWW 2025
- Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
- Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning
- KDD 2025: Discrepancy-Aware Graph Mask Auto-Encoder Discrepancy-Aware Graph Mask Auto-Encoder KDD 2025
- NeurIPS 2025: Semi-supervised Graph Anomaly Detection via Robust Homophily Learning Semi-supervised Graph Anomaly Detection via Robust Homophily Learning NeurIPS 2025
- Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach
- Model-Driven Graph Contrastive Learning Model-Driven Graph Contrastive Learning
- ICML 2025: Learn Beneficial Noise as Graph Augmentation Learn Beneficial Noise as Graph Augmentation ICML 2025
- Adaptive Tokenization: On the Hop-Overpriority Problem in Tokenized Graph Learning Models Adaptive Tokenization: On the Hop-Overpriority Problem in Tokenized Graph Learning Models
- IJCAI 2025: Negative Metric Learning for Graphs Negative Metric Learning for Graphs IJCAI 2025
- IJCAI 2025: Rethinking Graph Contrastive Learning through Relative Similarity Preservation Rethinking Graph Contrastive Learning through Relative Similarity Preservation IJCAI 2025
- TMLR 2025: Piecewise Constant Spectral Graph Neural Network Piecewise Constant Spectral Graph Neural Network TMLR 2025
- TMLR 2025: Heterophily-informed Message Passing Heterophily-informed Message Passing TMLR 2025
- WWW 2025: Graph Wave Networks Graph Wave Networks WWW 2025
- WWW 2025: Str-GCL: Structural Commonsense Driven Graph Contrastive Learning Str-GCL: Structural Commonsense Driven Graph Contrastive Learning WWW 2025
- WWW 2025: Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition WWW 2025
- LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models
- KDD 2025: GCoT: Chain-of-Thought Prompt Learning for Graphs GCoT: Chain-of-Thought Prompt Learning for Graphs KDD 2025
- GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design
- PyG-SSL: A Graph Self-Supervised Learning Toolkit PyG-SSL: A Graph Self-Supervised Learning Toolkit
- Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining
- ICML 2024: Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees ICML 2024
- ICLR 2024: Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective ICLR 2024
- Revisiting the Necessity of Graph Learning and Common Graph Benchmarks Revisiting the Necessity of Graph Learning and Common Graph Benchmarks
- NeurIPS 2024: Graph Neural Networks Need Cluster-Normalize-Activate Modules Graph Neural Networks Need Cluster-Normalize-Activate Modules NeurIPS 2024
- ICML 2024: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers ICML 2024
- NeurIPS 2024: Even Sparser Graph Transformers Even Sparser Graph Transformers NeurIPS 2024
- NeurIPS 2024: Distributed-Order Fractional Graph Operating Network Distributed-Order Fractional Graph Operating Network NeurIPS 2024
- LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space
- KDD 2024: Revisiting Graph Autoencoders as Implicit Contrastive Learners Revisiting Graph Autoencoders as Implicit Contrastive Learners KDD 2024
- ICML 2024: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms ICML 2024
- Multiplex Graph Contrastive Learning with Soft Negatives Multiplex Graph Contrastive Learning with Soft Negatives
- Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning
- Invariant Graph Learning Meets Information Bottleneck for Out-of-Distribution Generalization Invariant Graph Learning Meets Information Bottleneck for Out-of-Distribution Generalization
- NeurIPS 2024: Non-convolutional Graph Neural Networks Non-convolutional Graph Neural Networks NeurIPS 2024
- Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation
- Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift
- KDD 2024: Pre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs Pre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs KDD 2024
- Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks
- TMLR 2024: GraphFM: A generalist graph transformer that learns transferable representations across diverse domains GraphFM: A generalist graph transformer that learns transferable representations across diverse domains TMLR 2024
- HyperAggregation: Aggregating over Graph Edges with Hypernetworks HyperAggregation: Aggregating over Graph Edges with Hypernetworks
- NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification
- From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learning From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learning
- UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding
- NeurIPS 2024: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights NeurIPS 2024
- ICML 2024: A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition ICML 2024
- ICLR 2024: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND ICLR 2024
- Graph Neural Aggregation-diffusion with Metastability Graph Neural Aggregation-diffusion with Metastability
- NeurIPS 2024: Unsupervised Graph Neural Architecture Search with Disentangled Self-supervision Unsupervised Graph Neural Architecture Search with Disentangled Self-supervision NeurIPS 2024
- ICLR 2024: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks ICLR 2024
- ICLR 2024: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time Polynormer: Polynomial-Expressive Graph Transformer in Linear Time ICLR 2024
- Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework. Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework.
- Smoothed Graph Contrastive Learning via Seamless Proximity Integration Smoothed Graph Contrastive Learning via Seamless Proximity Integration
- Training MLPs on Graphs without Supervision Training MLPs on Graphs without Supervision
- ICML 2024: Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective ICML 2024
- Rethinking and Simplifying Bootstrapped Graph Latents Rethinking and Simplifying Bootstrapped Graph Latents
- NeurIPS 2023: Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning NeurIPS 2023
- NeurIPS 2023: Simple and Asymmetric Graph Contrastive Learning without Augmentations Simple and Asymmetric Graph Contrastive Learning without Augmentations NeurIPS 2023
- KDD 2023: Marginal Nodes Matter: Towards Structure Fairness in Graphs Marginal Nodes Matter: Towards Structure Fairness in Graphs KDD 2023
- Spectral-Aware Augmentation for Enhanced Graph Representation Learning Spectral-Aware Augmentation for Enhanced Graph Representation Learning
- WWW 2023: A Quasi-Wasserstein Loss for Learning Graph Neural Networks A Quasi-Wasserstein Loss for Learning Graph Neural Networks WWW 2023
- SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning
- ICML 2023: Perfect Alignment May be Poisonous to Graph Contrastive Learning Perfect Alignment May be Poisonous to Graph Contrastive Learning ICML 2023
- NeurIPS 2023: GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation NeurIPS 2023
- FedGTA: Topology-aware Averaging for Federated Graph Learning FedGTA: Topology-aware Averaging for Federated Graph Learning
- Frameless Graph Knowledge Distillation Frameless Graph Knowledge Distillation
- ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning
- Structure-Aware DropEdge Towards Deep Graph Convolutional Networks Structure-Aware DropEdge Towards Deep Graph Convolutional Networks
- KDD 2023: HomoGCL: Rethinking Homophily in Graph Contrastive Learning HomoGCL: Rethinking Homophily in Graph Contrastive Learning KDD 2023
- ICML 2023: Randomized Schur Complement Views for Graph Contrastive Learning Randomized Schur Complement Views for Graph Contrastive Learning ICML 2023
- Clarify Confused Nodes via Separated Learning Clarify Confused Nodes via Separated Learning
- ICML 2023: Towards Deep Attention in Graph Neural Networks: Problems and Remedies Towards Deep Attention in Graph Neural Networks: Problems and Remedies ICML 2023
- Oversmoothing: A Nightmare for Graph Contrastive Learning? Oversmoothing: A Nightmare for Graph Contrastive Learning?
- GIMM: InfoMin-Max for Automated Graph Contrastive Learning GIMM: InfoMin-Max for Automated Graph Contrastive Learning
- AAAI 2023: Union Subgraph Neural Networks Union Subgraph Neural Networks AAAI 2023
- ICML 2023: Feature Expansion for Graph Neural Networks Feature Expansion for Graph Neural Networks ICML 2023
- IJCAI 2023: Hierarchical Transformer for Scalable Graph Learning Hierarchical Transformer for Scalable Graph Learning IJCAI 2023
- ICML 2023: Leveraging Label Non-Uniformity for Node Classification in Graph Neural Networks Leveraging Label Non-Uniformity for Node Classification in Graph Neural Networks ICML 2023
- LON-GNN: Spectral GNNs with Learnable Orthonormal Basis LON-GNN: Spectral GNNs with Learnable Orthonormal Basis
- Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks
- WWW 2023: SeeGera: Self-supervised Semi-implicit Graph Variational Auto-encoders with Masking SeeGera: Self-supervised Semi-implicit Graph Variational Auto-encoders with Masking WWW 2023
- HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption
- AAAI 2022: MA-GCL: Model Augmentation Tricks for Graph Contrastive Learning MA-GCL: Model Augmentation Tricks for Graph Contrastive Learning AAAI 2022
- Localized Graph Contrastive Learning Localized Graph Contrastive Learning
- Node-oriented Spectral Filtering for Graph Neural Networks Node-oriented Spectral Filtering for Graph Neural Networks
- ICML 2022: TIDE: Time Derivative Diffusion for Deep Learning on Graphs TIDE: Time Derivative Diffusion for Deep Learning on Graphs ICML 2022
- AAAI 2022: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating AAAI 2022
- Unifying Graph Contrastive Learning with Flexible Contextual Scopes Unifying Graph Contrastive Learning with Flexible Contextual Scopes
- ICLR 2022: Spectral Augmentation for Self-Supervised Learning on Graphs Spectral Augmentation for Self-Supervised Learning on Graphs ICLR 2022
- Graph Soft-Contrastive Learning via Neighborhood Ranking Graph Soft-Contrastive Learning via Neighborhood Ranking
- Relational Self-Supervised Learning on Graphs Relational Self-Supervised Learning on Graphs
- AAAI 2022: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning AAAI 2022
- NeurIPS 2022: NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search NeurIPS 2022
- ICLR 2022: ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks ICLR 2022
- KDD 2022: Graph Attention Multi-Layer Perceptron Graph Attention Multi-Layer Perceptron KDD 2022
- Towards Understanding Graph Neural Networks: An Algorithm Unrolling Perspective Towards Understanding Graph Neural Networks: An Algorithm Unrolling Perspective
- ICML 2022: Alternately Optimized Graph Neural Networks Alternately Optimized Graph Neural Networks ICML 2022
- Mixed Graph Contrastive Network for Semi-Supervised Node Classification Mixed Graph Contrastive Network for Semi-Supervised Node Classification
- NeurIPS 2022: Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination NeurIPS 2022
- ICML 2022: Omni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning Omni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning ICML 2022
- WWW 2022: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm WWW 2022
- Graph Masked Autoencoders with Transformers Graph Masked Autoencoders with Transformers
- AAAI 2022: Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learning Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learning AAAI 2022
- Graph Representation Learning via Aggregation Enhancement Graph Representation Learning via Aggregation Enhancement
- Learning Graph Augmentations to Learn Graph Representations Learning Graph Augmentations to Learn Graph Representations
- AAAI 2021: Augmentation-Free Self-Supervised Learning on Graphs Augmentation-Free Self-Supervised Learning on Graphs AAAI 2021
- Barlow Graph Auto-Encoder for Unsupervised Network Embedding Barlow Graph Auto-Encoder for Unsupervised Network Embedding
- WWW 2021: Graph Communal Contrastive Learning Graph Communal Contrastive Learning WWW 2021
- NeurIPS 2021: Multi-view Contrastive Graph Clustering Multi-view Contrastive Graph Clustering NeurIPS 2021
- NeurIPS 2021: Beltrami Flow and Neural Diffusion on Graphs Beltrami Flow and Neural Diffusion on Graphs NeurIPS 2021
- Bag of Tricks for Training Deeper Graph Neural Networks: A Comprehensive Benchmark Study Bag of Tricks for Training Deeper Graph Neural Networks: A Comprehensive Benchmark Study
- KDD 2021: ROD: Reception-aware Online Distillation for Sparse Graphs ROD: Reception-aware Online Distillation for Sparse Graphs KDD 2021
- ICML 2021: Elastic Graph Neural Networks Elastic Graph Neural Networks ICML 2021
- IJCAI 2021: Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning IJCAI 2021
- TMLR 2021: Calibrating and Improving Graph Contrastive Learning Calibrating and Improving Graph Contrastive Learning TMLR 2021
- NCGNN: Node-Level Capsule Graph Neural Network for Semisupervised Classification NCGNN: Node-Level Capsule Graph Neural Network for Semisupervised Classification
- WWW 2020: Graph Contrastive Learning with Adaptive Augmentation Graph Contrastive Learning with Adaptive Augmentation WWW 2020
- A Unified View on Graph Neural Networks as Graph Signal Denoising A Unified View on Graph Neural Networks as Graph Signal Denoising
- Learning on Attribute-Missing Graphs Learning on Attribute-Missing Graphs
- Learned Low Precision Graph Neural Networks Learned Low Precision Graph Neural Networks
- Graph Convolutional Networks for Graphs Containing Missing Features Graph Convolutional Networks for Graphs Containing Missing Features
- Directed Graph Convolutional Network Directed Graph Convolutional Network
- Spectral Graph Attention Network with Fast Eigen-approximation Spectral Graph Attention Network with Fast Eigen-approximation
- AAAI 2019: Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View AAAI 2019
Node classification on one co-purchase graph, predicting each product’s category from review-derived features and product links. Evaluated by Accuracy.
Dataset details
Task
Amazon co-purchase graph (Photo) node classification. The primary catalog metric is Accuracy.
Data
Amazon co-purchase graph (Photo) node classification.
Features
The representation follows the cited PyG loader or benchmark release. Node and edge fields are dataset-specific; preprocessing, graph direction, and any feature normalization must be kept fixed when reproducing a result.
Splits and evaluation
The catalog records these protocols or variants: Standard split. Evaluation uses Accuracy (higher is better). Exact masks or folds must come from the cited release.
Quirks and pitfalls
The same short dataset name is used for incompatible processed artifacts and split protocols. Report the loader/version, directedness, feature preprocessing, and exact masks; transductive results should not be described as inductive.
Sources
SOTA Progression
new SOTA
matches SOTA at that time
other proposed result
other baseline result
Leaderboard
| # | Model | Accuracy ↑ | ACC | AUROC | Accuracy (micro F1 per L1108) | Macro-F1 | Micro-F1 | Normalized AUAC (percentage) | ROC-AUC | Recall | Paper |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | GraphTARIF | 0.9703 | — | — | — | — | — | — | — | — | |
| 2 | GAT | 0.9669
±
0.0014 | — | — | — | — | — | — | — | — | |
| 3 | GAT+T | 0.9660
±
0.0007 | — | — | — | — | — | — | — | — | |
| 4 | Polynormer | 0.9657
±
0.0023 | — | — | — | — | — | — | — | — | |
| 5 | SAGE+T | 0.9651
±
0.0023 | — | — | — | — | — | — | — | — | |
| 6 | Polynormer-r | 0.9646
±
0.0026 | — | — | — | — | — | — | — | — | |
| 7 | SAGE | 0.9643
±
0.0027 | — | — | — | — | — | — | — | — | |
| 8 | GCN | 0.9632
±
0.0008 | — | — | — | — | — | — | — | — | |
| 9 | GCN+TS | 0.9621
±
0.0011 | — | — | — | — | — | — | — | — | |
| 10 | NTFormer | 0.9617
±
0.0029 | — | — | — | — | — | — | — | — | |
| 11 | NAGphormer | 0.9614
±
0.0016 | — | — | — | — | — | — | — | — | |
| 12 | Polynormer | 0.9611
±
0.0023 | — | — | — | — | — | — | — | — | |
| 13 | Polynormer-v1 | 0.9611
±
0.0023 | — | — | — | — | — | — | — | — | |
| 14 | Polynormer-v2 | 0.9609
±
0.0030 | — | — | — | — | — | — | — | — | |
| 15 | NAGphormer-LGTL | 0.9601
±
0.0015 | — | — | — | — | — | — | — | — | |
| 16 | CNA (TransformerConv) | 0.9596
±
0.0029 | — | — | — | — | — | — | — | — | |
| 17 | VecFormer | 0.9584
±
0.0041 | — | — | — | — | — | — | — | — | |
| 18 | VCR-Graphormer-LGTL | 0.9582
±
0.0017 | — | — | — | — | — | — | — | — | |
| 19 | Specformer | 0.9580
±
0.0026 | — | — | — | — | — | — | — | — | |
| 20 | GRAND | 0.9579
±
0.0059 | — | — | — | — | — | — | — | — | |
| 21 | APPNP | 0.9573
±
0.0012 | — | — | — | — | — | — | — | — | |
| 22 | CGT | 0.9573
±
0.0084 | — | — | — | — | — | — | — | — | |
| 23 | LaplaceGNN | 0.9570
±
0.0015 | — | — | — | — | — | — | — | — | |
| 24 | SignGT | 0.9568
±
0.0036 | — | — | — | — | — | — | — | — | |
| 25 | PieCoN | 0.9565
±
0.0034 | — | — | — | — | — | — | — | — | |
| 26 | GIST | 0.9561
±
0.0023 | — | — | — | — | — | — | — | — | |
| 27 | GWN-fa | 0.9561
±
0.0053 | — | — | — | — | — | — | — | — | |
| 28 | GIRL | 0.9560
±
0.0010 | — | — | — | — | — | — | — | — | |
| 29 | SGFormer | 0.9558
±
0.0036 | — | — | — | — | — | — | — | — | |
| 30 | VCR-Graphormer | 0.9553
±
0.0023 | — | — | — | — | — | — | — | — | |
| 31 | GrokFormer | 0.9552
±
0.0052 | — | — | — | — | — | — | — | — | |
| 32 | OGFormer | 0.9550
±
0.0000 | — | — | — | — | — | — | — | — | |
| 33 | NAGphormer | 0.9549
±
0.0011 | — | — | — | — | — | — | — | — | |
| 34 | GPRGNN | 0.9549
±
0.0014 | — | — | — | — | — | — | — | — | |
| 35 | H2GCN | 0.9548
±
0.0043 | — | — | — | — | — | — | — | — | |
| 36 | Polynormer | 0.9544
±
0.0024 | — | — | — | — | — | — | — | — | |
| 37 | JacobiConv | 0.9543
±
0.0023 | — | — | — | — | — | — | — | — | |
| 38 | GNSN | 0.9543
±
0.0126 | — | — | — | — | — | — | — | — | |
| 39 | SGT | 0.9537
±
0.0044 | — | — | — | — | — | — | — | — | |
| 40 | Exphormer | 0.9535
±
0.0022 | — | — | — | — | — | — | — | — | |
| 41 | GAT+GPL | 0.9535
±
0.0014 | — | — | — | — | — | — | — | — | |
| 42 | HiGCN | 0.9533
±
0.0037 | — | — | — | — | — | — | — | — | |
| 43 | ADC | 0.9533
±
0.0027 | — | — | — | — | — | — | — | — | |
| 44 | SPEXPHORMER | 0.9533
±
0.0049 | — | — | — | — | — | — | — | — | |
| 45 | GWN-sym | 0.9531
±
0.0065 | — | — | — | — | — | — | — | — | |
| 46 | Specformer | 0.9529
±
0.0030 | — | — | — | — | — | — | — | — | |
| 47 | Exphormer (LapPE) | 0.9527
±
0.0042 | — | — | — | — | — | — | — | — | |
| 48 | NodeFormer | 0.9527
±
0.0022 | — | — | — | — | — | — | — | — | |
| 49 | FusedGAT+GPL | 0.9527
±
0.0030 | — | — | — | — | — | — | — | — | |
| 50 | EXPHORMER + GCN | 0.9527
±
0.0042 | — | — | — | — | — | — | — | — |
SOTA performance
set a new SOTA at the time
matched the SOTA at the time