Graph foundation model · topology first

Learn structure once.
Transfer it anywhere.

A reusable graph model that turns each node's structural role into a common language—then carries that knowledge from citation and commerce networks into unseen biological systems.

Pretrained without proteins, biological interactions, or functional annotations.
degree · 12
core · 4
community · 5
GFMshared representation
unseen biological graph
03Align across graphsshared representation
9heterogeneous graphs
used for pretraining
24held-out graphs
18 biological · 6 other
37downstream
evaluation tasks
95.5%SagePPI ROC–AUC
+21.8 points
Animated explainer

A shared language for graphs that share no vocabulary.

How it works

Describe the role. Learn the neighborhood. Align the two.

Every graph may use different features and labels. Topology supplies the stable interface.

degree · 12
core · 4
community · 5
GFMstructural prompts
unseen biological graph
01 / 04

Describe structural role

Convert topology—degree, centrality, ego networks, communities and diffusion—into a natural-language node profile.

The transfer test

Pretrained outside biology.
Evaluated inside it.

The backbone learns across citation, co-authorship, hyperlink, and product co-purchase networks. It is then adapted without labels to protein interaction graphs it has never seen.

Pretraining
CoraCiteSeerDBLPogbn-arxivCoauthorCSCoauthorPhysicsAmazonComputersAmazonPhotoWikiCS
Unseen protein networksNo biological graphs in pretraining
Four primary biological benchmarks

Different graphs. Different features. The same pretrained backbone.

Supplementary Figs. S13–S23

Fourteen more graphs. Thirty-three additional task-results.

What the embeddings reveal

Prediction improved—and biological organization emerged.

The strongest story is not only benchmark performance. Topology-based pretraining recovered functional and spatial organization that was never supplied to the model.

r = +0.263

Multifunctional proteins occupy denser neighborhoods.

In SagePPI, protein label count positively tracks local GFM embedding density. The strongest supervised baseline shows the opposite trend.

Three spatial modules

Cell geography emerges from interactions alone.

StringGO embeddings separate mitochondrial, nuclear/cytoplasmic, and membrane compartments without localization annotations.

75.4shallow76.7medium80.5deep
Fine-grained function

The advantage grows for more specific GO terms.

Performance rises with hierarchy depth, consistent with structural prompts preserving long-range and community-level signals.

83.4%zero-shotvs82.1%fine-tuned
Entirely unseen classes

Less adaptation can generalize better.

On Fold-PPI's disjoint test classes, frozen topology-based embeddings avoid the class-specific bias introduced by supervised fine-tuning.

Read the paper

Language-Encoded Structural Topology Enables Generalizable Foundation Models for Graph-Structured Data

Sakib Mostafa · James Zou · Ash A. Alizadeh · Maximilian Diehn · Lei Xing · Md Tauhidul Islam

The Graph Foundation Model converts feature-agnostic topology into language-encoded structural prompts, aligns them with message-passing embeddings across heterogeneous graphs, and reuses the pretrained backbone on unseen networks. The submitted study evaluates 18 held-out biological graphs and 6 non-biological graphs across 37 downstream tasks.

Research use

Exploratory graph analysis, not clinical decision-making.

The models and interactive workspace are intended for research. Uploaded data should be de-identified and users remain responsible for validating outputs in their own experimental context.

Authors

The team behind the work.

02

James Zou

Biomedical Data Science, Stanford University

05

Lei Xing

Department of Radiation Oncology, Stanford University