G-reasoner: Unified Graph Reasoning

• G-reasoner is a unified framework that integrates graph abstractions and large language models to enhance structured reasoning over heterogeneous data.
• It employs QuadGraph, a standardized four-layer schema that unifies attributes, entities, documents, and communities from diverse knowledge sources.
• The framework leverages a 34M-parameter Graph Foundation Model alongside LLM integration to achieve efficient, multi-hop evidence retrieval and reasoning.

G-reasoner is a unified framework for reasoning over graph-structured knowledge that integrates graph and language foundation models. In the formulation introduced in "G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge" (Luo et al., 29 Sep 2025), its core components are QuadGraph, a standardized four-layer abstraction that unifies heterogeneous knowledge sources into a common graph representation, and a 34M-parameter Graph Foundation Model (GFM) that jointly captures graph topology and textual semantics and is integrated with LLMs to enhance reasoning in downstream applications. The framework is positioned against both conventional retrieval-augmented generation, which struggles with fragmented information and weak modeling of knowledge structure, and prior graph-enhanced RAG methods that often depend on ad-hoc graph designs, heuristic search, or costly agent pipelines (Luo et al., 29 Sep 2025).

1. Definition and scope

G-reasoner is designed for settings in which knowledge is naturally graph-structured but downstream reasoning is ultimately performed by a LLM. Its motivating claim is that LLMs excel at complex reasoning but remain limited by static and incomplete parametric knowledge, while existing RAG systems struggle with knowledge-intensive tasks because relevant information is fragmented and knowledge structure is weakly modeled (Luo et al., 29 Sep 2025).

Within this framework, graphs are treated not merely as auxiliary retrieval indices but as the primary substrate for organizing knowledge. The framework defines a complete reasoning stack: heterogeneous sources are converted into a common graph abstraction; a graph foundation model performs query-conditioned graph reasoning; and an LLM receives the graph-selected evidence in prompt form and produces the final answer (Luo et al., 29 Sep 2025). This suggests a division of labor in which graph computation handles structural propagation and node selection, while the LLM handles natural-language synthesis and final multi-step explanation.

A plausible implication is that G-reasoner should be understood less as a single model and more as a system architecture. The term names the entire graph-to-reasoning pipeline rather than only the GFM or only the prompting layer.

2. QuadGraph as the unifying abstraction

The central representational device is QuadGraph, defined as a standardized four-layer abstraction. In the notation given for the framework, a QuadGraph is written as

$$\mathcal{G} = (\mathcal{V}, \mathcal{E}, \mathcal{R}, \mathcal{T}, \mathcal{S}),$$

with

$$\mathcal{T} = \{\text{attribute}, \text{entity}, \text{document}, \text{community}\}.$$

These four node types form the attribute layer, knowledge graph layer, document layer, and community layer, respectively (Luo et al., 29 Sep 2025).

The attribute layer represents properties; the entity layer represents structured factual units and their relations; the document layer hosts passages or documents that carry the textual evidence ultimately consumed by LLMs; and the community layer captures higher-level groupings such as clusters or summaries (Luo et al., 29 Sep 2025). Cross-layer relations connect these levels, so that, for example, entities can link to documents that mention them and communities can subsume entities or documents. This standardized schema is presented as the mechanism that allows many pre-existing graph constructions to be treated uniformly.

A concrete claim of the framework is that knowledge graphs, document graphs, and hierarchical or community graphs can all be mapped into QuadGraph (Luo et al., 29 Sep 2025). This suggests that the abstraction is meant to remove the need for per-task graph schema design. Rather than tailoring the reasoning model to a single graph formalism, G-reasoner tailors the graph formalism to a common downstream model interface.

3. Graph Foundation Model

Built on top of QuadGraph is the Graph Foundation Model, described as a 34M-parameter model that jointly captures graph topology and textual semantics (Luo et al., 29 Sep 2025). The GFM is query-dependent: it receives a natural-language query together with node text embeddings and relation embeddings, initializes node states with query-conditioned information, and applies message passing over the full graph (Luo et al., 29 Sep 2025).

The layer-wise update is given as

$$\mathbf{h}_v^\ell = \mathrm{Update}\Big( \mathbf{h}_v^{\ell-1},\; \mathrm{Agg}\big( \{ \mathrm{Msg}( \mathbf{h}_v^{\ell-1}, \mathbf{r}_r^\ell, \mathbf{h}_{v'}^{\ell-1} ) \mid (v, r, v') \in \mathcal{E} \} \big) \Big),$$

with relation embeddings updated by

$\mathbf{r}_r^\ell = g^\ell(\mathbf{e}_r).$

After message passing, the node relevance score is predicted by

$$p(v) = \mathrm{Predictor}_{t_v}\big(\mathbf{h}_v^L, \mathbf{e}_v, \mathbf{e}_q\big).$$

The model therefore produces query-conditioned scores over arbitrary node types rather than over documents alone (Luo et al., 29 Sep 2025).

Training combines sparse supervised labels with a distillation term derived from a frozen text encoder. The teacher relevance is defined by

$$p_\phi(v \mid q, \mathcal{G}) = \sigma(\mathbf{e}_q^\top \mathbf{e}_v),$$

and the final objective is

$$\mathcal{L}(\theta) = \sum_{v \in \mathcal{V}_q^+} \log p_\theta(v \mid q, \mathcal{G}) \;-\; \lambda\, \mathrm{KL}\big(p_\phi(\cdot \mid q, \mathcal{G}) \,\|\, p_\theta(\cdot \mid q, \mathcal{G})\big).$$

In the reported configuration, the model uses 6 GNN layers, hidden dimension $d = 1024$, DistMult as the message function, and Qwen3-Embedding-0.6B as the frozen text encoder (Luo et al., 29 Sep 2025).

A plausible implication is that the GFM is intended to interpolate between structure-only retrieval and text-only retrieval. The ablations reported for removing text, removing distillation, and removing the GFM altogether indicate that the framework relies on both semantic and topological signals rather than treating either as sufficient in isolation (Luo et al., 29 Sep 2025).

4. LLM integration and reasoning pipeline

The GFM is not the final answer generator. Instead, it serves as a structured retrieval and graph-reasoning front end for an LLM. Given a query, the GFM scores all nodes, selects top-$k$ nodes per type, and then the associated texts are injected into an LLM prompt (Luo et al., 29 Sep 2025). The final answer is produced by

$$a = \mathrm{LLM}\big(\mathrm{Prompt}(q, \mathcal{V}^k_q)\big).$$

The prompt template described for the framework organizes evidence under sections such as Document, Entity, and Question, followed by Thought: to elicit explicit reasoning before answer generation (Luo et al., 29 Sep 2025). This makes the LLM stage structurally similar to RAG, but the retrieved context is no longer just a ranked list of passages: it is a typed, graph-selected evidence bundle.

The operational sequence is therefore: graph ingestion and conversion to QuadGraph; query encoding; GFM message passing and node scoring; top-$$\mathcal{T} = \{\text{attribute}, \text{entity}, \text{document}, \text{community}\}.$$0 node selection by type; prompt construction; and final LLM reasoning (Luo et al., 29 Sep 2025). This is a markedly different design from agentic GraphRAG pipelines that repeatedly call tools or heuristics over a graph. G-reasoner is presented instead as a single learned graph stage plus a single LLM reasoning stage.

A plausible implication is that G-reasoner relocates much of the burden of multi-hop evidence discovery from the LLM to the GFM. The LLM still reasons over language, but it reasons on an evidence set already shaped by graph propagation.

5. Empirical performance and efficiency

The framework is evaluated on six benchmarks: HotpotQA, MuSiQue, 2WikiMultiHopQA, and three variants of G-bench covering novel, medical, and CS domains (Luo et al., 29 Sep 2025). The main reported QA results show G-reasoner at 61.4 / 76.0 on HotpotQA, 38.5 / 52.5 on MuSiQue, and 74.9 / 82.1 on 2Wiki, where each pair is EM / F1 (Luo et al., 29 Sep 2025). On G-bench, the reported accuracies are 58.9 on Novel, 73.3 on Medical, and 73.9 on CS (Luo et al., 29 Sep 2025).

Retrieval performance is also reported. On HotpotQA, G-reasoner achieves Recall@2 / Recall@5 of 85.9 / 97.7; on MuSiQue, 54.8 / 74.9; and on 2Wiki, 81.2 / 98.2 (Luo et al., 29 Sep 2025). On G-bench, the framework reports 87.7 evidence recall on Novel and 93.8 on Medical (Luo et al., 29 Sep 2025). These retrieval gains are paired with end-task QA gains, supporting the interpretation that the graph model improves the evidence set rather than only the final prompting.

Efficiency is one of the framework’s most emphasized practical claims. On G-bench CS, the reported inference time is 0.2s per query for G-reasoner, compared with 2.4s for HippoRAG, 14.0s for LightRAG, 44.9s for GraphRAG (MS), 70.5s for ToG, and 89.4s for KGP (Luo et al., 29 Sep 2025). The reported accuracy in the same comparison is 73.9 for G-reasoner, which is higher than those baselines (Luo et al., 29 Sep 2025).

The ablation study further reports that removing the GFM causes retrieval performance to collapse, while removing text or distillation yields smaller but still clear drops (Luo et al., 29 Sep 2025). This supports the internal claim that QuadGraph alone is not sufficient; the learned graph reasoning model is the decisive component.

6. Scalability, generalization, and relation to adjacent work

A major engineering aspect of the framework is its scalability strategy. Mixed-precision training with bfloat16 reduces memory from 80 GB to 66 GB per A100 and increases throughput from 1.29 to 2.72 samples/s (Luo et al., 29 Sep 2025). Distributed full-graph message passing partitions the graph with METIS and spreads partitions across GPUs, with per-device memory scaling as

$$\mathcal{T} = \{\text{attribute}, \text{entity}, \text{document}, \text{community}\}.$$1

This is used to support full-graph training rather than sampled subgraph training (Luo et al., 29 Sep 2025).

Cross-graph generalization is another central claim. The same trained GFM is evaluated on graphs produced by HippoRAG, LightRAG, and Youtu-GraphRAG, and is reported to outperform the retrieval method native to each graph constructor on the corresponding graph (Luo et al., 29 Sep 2025). This is the empirical justification for presenting QuadGraph as a unifying graph interface rather than only a convenient notation.

In the broader literature, the label “G-reasoner” is not unique. It also appears in "General-Reasoner: Advancing LLM Reasoning Across All Domains" (Ma et al., 20 May 2025), which concerns multi-domain Zero RL for LLM reasoning rather than graph-structured knowledge; in "Graph Reasoning Networks" (Zopf et al., 2024), where a differentiable MAX-SAT solver is combined with graph encoders; and in "Graph Agent: Explicit Reasoning Agent for Graphs" (Wang et al., 2023), where an LLM-based inductive-deductive reasoning agent operates on graph-to-text encodings. Those systems are methodologically adjacent in that they all try to make reasoning explicit or structured, but they do not share the QuadGraph + GFM architecture of G-reasoner (Luo et al., 29 Sep 2025).

The limitations acknowledged for the framework include dependence on graph quality, a static-graph setting, lack of explicit multimodal support, and the absence of a feedback loop in which the LLM can refine the graph itself (Luo et al., 29 Sep 2025). Future directions identified in the framework include larger GFMs, tighter graph–LLM coupling, dynamic and temporal graphs, and multimodal QuadGraphs (Luo et al., 29 Sep 2025). This suggests that the current formulation is best viewed as a foundation-model baseline for unified graph reasoning rather than a finished endpoint for GraphRAG research.