Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG
This paper introduces GFM-Retriever, a novel GraphRAG framework that leverages a pre-trained Graph Foundation Model for cross-domain subgraph retrieval and an Information Bottleneck-based selector to extract minimal, sufficient reasoning paths, thereby achieving state-of-the-art performance in multi-hop question answering without relying on domain-specific heuristics.