mlsanityData to 7 Oct 2026

Attacking Graph Foundation Models Through Their Shared Representation

arXiv 2607.18567 ↗First posted 20 Jul 2026cs.AI cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A graph foundation model generalizes across graph domains by mapping every input into one shared representation before any task reasoning. We call this map the alignment layer, the component that separates a graph foundation model from a graph neural network, and we show it is a distinct attack surface that prior work has not studied. We attack it at inference time, with no access to training, on six public models spanning spectral tokenizers, text embedding spaces, and a discrete codebook. A directed representation-space perturbation collapses every model, but at a budget comparable to the representation norm a plain graph network also needs, with one exception: OpenGraph, whose spectral tokenizer collapses at a fifth of that budget, an alignment-specific fragility a plain network does not share and which a same-representation control traces to the tokenizer rather than the decoder. A realizable input-space attack that edits edges, features, or text removes at least half the correct predictions on three of the six models at peak. How much of this fragility an input-access attacker realizes tracks how directly the decoder reads the representation, and not the clean accuracy a task leaves; we measure this carrier gain structurally from the decoder's local Lipschitz sensitivity, and report clean-accuracy headroom as a within-model ordering heuristic that does not survive on realizable attacks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 39 references that are in the map. First posted on arXiv 20 Jul 2026.

Builds on

25 of 39 references.

References · 25

  1. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  2. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  3. 2019Similarity of Neural Network Representations Revisitedcited by 1,695
  4. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  5. 2016Universal adversarial perturbationscited by 774
  6. 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
  7. 2024The Platonic Representation Hypothesiscited by 362
  8. 2018Adversarial Attack on Graph Structured Datacited by 300
  9. 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 280
  10. 2023LEACE: Perfect linear concept erasure in closed formcited by 254
  11. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 239
  12. 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
13 more
  1. 2020The Lipschitz Constant of Self-Attentioncited by 171
  2. 2024Position: Graph Foundation Models are Already Herecited by 84
  3. 2024ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphscited by 83
  4. 2024OpenGraph: Towards Open Graph Foundation Modelscited by 75
  5. 2015Adversarial Manipulation of Deep Representationscited by 56
  6. 2020Efficient Robustness Certificates for Discrete Data: Sparsity-Aware Randomized Smoothing for Graphs, Images and Morecited by 56
  7. 2020Transferable Perturbations of Deep Feature Distributionscited by 51
  8. 2024AnyGraph: Graph Foundation Model in the Wildcited by 51
  9. 2024Fully-inductive Node Classification on Arbitrary Graphscited by 36
  10. 2023Adversarial Illusions in Multi-Modal Embeddingscited by 28
  11. 2025TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attackscited by 5
  12. 2025Towards Effective, Stealthy, and Persistent Backdoor Attacks Targeting Graph Foundation Modelscited by 3
  13. 2026Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoningcited by 3

Built on by

Not cited yet.