SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2412.16441 · ICML · 2025

Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees

Chuxu Zhang, Nitesh Chawla, Yanfang Ye, Zheyuan Zhang, Zehong Wang, Tianyi Ma

arXiv · PDF · Open in the Atlas

Code that ran

None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2412.16441.json · badge: /api/ran/2412.16441.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
Zehong-Wang/GIT community
Papers with Code archive
0 ran · 3 no recorded run
FunctionStatusWhere it lives
Encoder Not yet run
unverified (harvested, no recorded run)
Zehong-Wang/GIT/model/encoder.py
code served (permissive licence) · get_code("2ea6c33dd48a5109")
How it ran

no invocation recorded.

MySAGEConv Not yet run
unverified (harvested, no recorded run)
Zehong-Wang/GIT/model/encoder.py
code served (permissive licence) · get_code("e6d60d89717522dc")
How it ran

no invocation recorded.

NonParamPooling Not yet run
unverified (harvested, no recorded run)
Zehong-Wang/GIT/model/encoder.py
code served (permissive licence) · get_code("e5b42c98645ce14b")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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 tasktrees, 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 finetuning, in-context learning, and zero-shot generalization. Code and data are available at https: //github.com/Zehong-Wang/GIT.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2412.16441")
get_code_for_paper("2412.16441")
have("2412.16441")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2412.16441.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2412.16441.svg)](https://syntology.ai/paper/2412.16441)

Connect an agent — have() is free.