Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG

Haonan Yuan, Qingyun Sun, Junhua Shi, Mingjun Liu, Jiaqi Yuan, Ziwei Zhang, Xingcheng Fu, Jianxin Li

TL;DR

GFM-Retriever shifts the GraphRAG paradigm from retrieving flat lists of entities to extracting "minimal and sufficient" reasoning subgraphs. By repurposing a pre-trained Graph Foundation Model (GFM) and optimizing it via an Information Bottleneck objective, the framework provides LLMs with precise, path-aware structural context that excels in multi-hop reasoning and generalizes across diverse domains.

What Problem Does This Paper Address?

Retrieval-Augmented Generation (RAG) helps LLMs access external knowledge, but standard "flat" retrieval (returning a list of documents or entities) often fails at complex, multi-hop reasoning. While GraphRAG attempts to solve this by using knowledge graphs, it faces three major hurdles:

  1. Structural Loss: Most systems reduce graph data back into flat lists, forcing the LLM to guess how entities are related.
  2. Domain Fragility: Existing subgraph retrievers rely on domain-specific heuristics. When applied to a new field (a "cold-start" scenario), they struggle to generalize.
  3. The Goldilocks Dilemma: Retrieving too much graph data introduces noise and redundancy; retrieving too little misses critical reasoning paths.

The authors propose a way to find the "Core Set"—the smallest possible subgraph that contains all the evidence needed to answer a query.

Methods

The authors introduce GFM-Retriever, which consists of three main stages:

  • Generalized GFM as Retriever: Instead of building a retriever from scratch, they repurpose a pre-trained Graph Foundation Model. They use a two-phase pre-training strategy: first, standard knowledge graph completion, and second, a "prototype-driven" alignment that ensures the model's internal representations are consistent across different domains (e.g., medical vs. financial).
  • Label-free IB Subgraph Selector: To find the "minimal yet sufficient" subgraph, they use the Information Bottleneck (IB) principle. This is a mathematical framework that forces the model to compress the input (minimality) while preserving the information relevant to the query (sufficiency). Crucially, they developed a "label-free" version that doesn't require expensive ground-truth subgraphs for training.
  • Path-aware In-context Prompter: Once a subgraph is retrieved, the system doesn't just dump triples. It uses a truncated Depth-First Search (DFS) to extract the most relevant relational paths and formats them into structured prompts that guide the LLM's reasoning process.

Datasets

The model was evaluated on a massive suite of benchmarks:

  • General Multi-hop QA: HotpotQA, MuSiQue, and 2WikiMultiHopQA.
  • Cross-domain Generalization: Seven diverse datasets including PubMedQA (Biomedical), TechQA (Customer Support), and MS Marco (General Knowledge).
  • Baselines: Compared against 18 state-of-the-art methods, including GraphRAG, HippoRAG, and multi-step frameworks like IRCoT.

Key Insights and Ideas

  • GFMs are Cross-Domain Generalists: By pre-training on a wide variety of graphs, the GFM learns universal "reasoning patterns" (like transitivity) that hold true whether you are looking at a social network or a biological pathway.
  • Structure as a Scaffold: The paper argues that the path is the unit of reasoning. By providing the LLM with explicit paths (Entity A $\rightarrow$ Relation $\rightarrow$ Entity B), the model doesn't have to hallucinate connections between isolated facts.
  • The Power of the Bottleneck: The Information Bottleneck objective acts as a "noise filter." It successfully identifies the "reasoning backbone" of a graph, excluding semantically related but logically irrelevant neighbors that typically clutter GraphRAG contexts.

Key Results

  • State-of-the-Art Performance: GFM-Retriever achieved the highest average rank across all retrieval and QA metrics. On the 2WikiMultiHopQA dataset, it reached an Avg. Rank of 1.1 for retrieval.
  • Zero-Shot Generalization: In "cold-start" tests on unseen domains like PubMedQA, GFM-Retriever significantly outperformed specialized baselines, showing it can handle new knowledge without domain-specific fine-tuning.
  • Efficiency: Despite the complexity of graph processing, the system maintains sub-second retrieval times. It consistently sits in the "upper-left" of the efficiency-effectiveness curve—high accuracy with low latency.
  • LLM Agnostic: The retrieved subgraphs improved the performance of various base models, from GPT-4o-mini to DeepSeek-V3.

Limitations and Future Work

  • KG Construction Dependency: The system assumes a Knowledge Graph already exists or can be built via OpenIE. If the initial graph construction is noisy or incomplete, the retriever's performance is naturally capped.
  • Path Depth: To maintain efficiency, the authors used a 3-hop limit for path extraction. While sufficient for most current benchmarks, extremely complex queries requiring 5+ hops might still be a challenge.
  • Static Snapshots: The current framework treats the graph as a static snapshot. The authors suggest that future work should explore Dynamic GraphRAG, where the retriever can handle real-time updates and streaming data.

Summary updated

Abstract

Graph-based retrieval-augmented generation (GraphRAG) exploits structured knowledge to support knowledge-intensive reasoning. However, most existing methods treat graphs as intermediate artifacts, and the few subgraph-based retrieval methods depend on heuristic rules coupled with domain-specific distributions. They fail in typical cold-start scenarios where data in target domains is scarce, thus yielding reasoning contexts that are either informationally incomplete or structurally redundant. In this work, we revisit retrieval from a structural perspective, and propose GFM-Retriever that directly responds to user queries with a subgraph, where a pre-trained Graph Foundation Model acts as a cross-domain Retriever for multi-hop path-aware reasoning. Building on this perspective, we repurpose a pre-trained GFM from an entity ranking function into a generalized retriever to support cross-domain retrieval. On top of the retrieved graph, we further derive a label-free subgraph selector optimized by a principled Information Bottleneck objective to identify the query-conditioned subgraph, which contains informationally sufficient and structurally minimal golden evidence in a self-contained "core set". To connect structure with generation, we explicitly extract and reorganize relational paths as in-context prompts, enabling interpretable reasoning. Extensive experiments on multi-hop question answering benchmarks demonstrate that GFM-Retriever achieves state-of-the-art performance in both retrieval quality and answer generation, while maintaining efficiency.
BibTeX
@misc{yuan2026retrieving,
  author = {Haonan Yuan and Qingyun Sun and Junhua Shi and Mingjun Liu and Jiaqi Yuan and Ziwei Zhang and Xingcheng Fu and Jianxin Li},
  title = {{Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG}},
  year = {2026},
  eprint = {2603.07179},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2603.07179},
}
Figure