Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees
Abstract
Foundation models are pretrained on large-scale corpora to learn generalizable patterns across domains and tasks -- such as contours, textures, and edges in images, or tokens and sentences in text. In contrast, discovering such generalities in graph-structured data, especially across heterogeneous graph tasks, remains an open challenge. To address this, we propose a novel approach to cross-task generalization in graphs via task-trees, which serve as unified learning instances aligning node-, edge-, and graph-level tasks. We theoretically analyze the stability, transferability, and generalization properties of task-trees, showing that pretraining a graph neural network (GNN) on diverse task-trees with a reconstruction objective induces transferable knowledge. This enables efficient adaptation to downstream tasks with minimal fine-tuning. To validate our framework, we introduce Graph Generality Identifier on Task-Trees (GIT), a graph foundation model that demonstrates strong performance on over 30 graphs across five domains via fine-tuning, in-context learning, and zero-shot generalization. Code and data are available at https://github.com/Zehong-Wang/GIT.
Benchmark Results
Tested on 7 datasets 14 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 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | |
| 164 | GraphMAE | 0.9341
±0.0010 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) |
| 172 | BGRL | 0.9337
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) |
| 390 | MLP | 0.9128
±0.0063 | |
| 504 | LLMs | 0.8566
±0.0006 | This paper |
| 513 | OFA | 0.8446 best reported |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 best reported | best at pub: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) |
| 3 | GAT | 0.9398
±0.0022 best reported | best at pub: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) |
| 8 | SAGE | 0.9351
±0.0006 | |
| 79 | BGRL | 0.9034
±0.0019 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 100 | GraphMAE | 0.9002
±0.0024 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) |
| 208 | GIT - S | 0.8805
±0.0018 | This paper |
| 217 | GIT - G | 0.8781
±0.0010 | This paper |
| 294 | OFA | 0.8578
±0.0013 | This paper |
| 320 | MLP | 0.8463 |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 | |
| 6 | GCN | 0.8691
±0.0005 | prev best: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 9 | GAT | 0.8722
±0.0005 | prev best: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 10 | LLMs | 0.8820
±0.0005 | This paper |
| 30 | GraphMAE | 0.8630
±0.0007 | prev best: Calibrating and Improving Graph Contrastive Learning (TMLR 2021) |
| 32 | OFA | 0.8623
±0.0007 | This paper |
| 265 | All in One | 0.7525 | This paper |
| 269 | AnyGraph | 0.7501 | This paper |
| 278 | GraphPrompt | 0.7480 | This paper |
| 281 | OpenGraph | 0.7464 | This paper |
| 300 | BGRL | 0.7397
±0.0005 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) |
| 351 | MLP | 0.6605
±0.0020 |
MoleculeNet
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | HIMP | 0.8740
±0.0050 | |
| 2 | GINE w/ VN | 0.8720
±0.0030 | |
| 3 | NaiveGINe+ K=3 w/ VN | 0.8700
±0.0040 | |
| 14 | GCN | 0.8400
±0.0040 | |
| 24 | GIN | 0.8290
±0.0069 best reported | |
| 28 | OFA | 0.8250 best reported | best at pub: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) |
| 202 | GraphMAE | 0.7550
±0.0060 best reported | best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) |
| 238 | BGRL | 0.7483
±0.0074 best reported | best at pub: Graph Self-supervised Learning with Accurate Discrepancy Learning (NeurIPS 2022) |
| 321 | GIT - S | 0.6516
±0.0027 | This paper |
| 337 | GIT - G | 0.5853
±0.0036 | This paper |
BACE
Global leaderboard →Default metric is ROC-AUC. The paper reports 5 values on ROC-AUC and 1 value on AUC (graph classification) .
| # | Model | ROC-AUC ↑ default | AUC (graph classification) ↑ | Paper |
|---|---|---|---|---|
| 1 | ProtoMol | 0.9140
±
0.0030 | — | AUC (graph classification)
— |
| 2 | MMSG | 0.9080
±
0.0050 | — | AUC (graph classification)
— |
| 3 | MemGNN | 0.9070
±
0.0000 | — | AUC (graph classification)
— |
| 64 | GCN | 0.8540
±
0.0110 | — | AUC (graph classification)
— |
| 105 | GraphMAE | 0.8310
±0.0090 best reported | — | AUC (graph classification)
— best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) |
| 194 | GIT - G | 0.7928
±
0.0271 | — | AUC (graph classification)
— |
| 220 | OFA | 0.7788
±0.0108 | — | AUC (graph classification)
— prev best: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) Improvement within reported uncertainty; not highlighted. |
| 246 | BGRL | 0.7560
±0.0220 best reported | — | AUC (graph classification)
— best at pub: Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules (NeurIPS 2023) Difference within reported uncertainty; not counted as underperformance. |
| 43 | GIN | —
| 0.7555
±
0.0291 | AUC (graph classification)
0.7555
±
0.0291 |
| 302 | GIT - S | 0.6176
±
0.0092 | — | AUC (graph classification)
— |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | GeomGCL | 0.7630 | |
| 2 | LiGhT DeepGPT | 0.7570
±0.0110 | |
| 3 | CoMPT | 0.7550 | |
| 14 | GCN | 0.7350
±0.0020 | |
| 32 | GIN | 0.7095
±0.0027 best reported | best at pub: Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck (AAAI 2024) Difference within reported uncertainty; not counted as underperformance. |
| 54 | OFA | 0.6839 best reported | best at pub: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 128 | GraphMAE | 0.6410
±0.0030 best reported | best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) best today: A Generalist Cross-Domain Molecular Learning Framework for Structure-Based Drug Discovery (2025) Difference within reported uncertainty; not counted as underperformance. |
| 155 | BGRL | 0.6320
±0.0076 best reported | best at pub: Graph Self-supervised Learning with Accurate Discrepancy Learning (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 163 | GIT - G | 0.6300 | This paper |
| 207 | GIT - S | 0.5830 | This paper |
Knowledge Graphs
WN18RR
Global leaderboard →Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | OFA-llama2-13b | 0.9814
±0.0025 | |
| 2 | OFA-llama2-7b | 0.9808
±0.0016 | |
| 3 | OFA-e5 | 0.9784
±0.0035 | |
| 6 | GIT - S | 0.9515
±0.0007 | This paper |
| 9 | GIT - G | 0.9416
±0.0011 | This paper |
| 11 | GraphMAE | 0.9387
±0.0035 | This paper |
| 13 | OFA | 0.9310
±0.0031 | This paper |
| 18 | GCN | 0.8677
±0.0030 | prev best: One for All: Towards Training One Graph Model for All Classification Tasks (ICLR 2023) |
| 26 | GraphSAGE | 0.8298
±0.0022 |
