The paper introduces Multi-Agent Agentic Graph Learning (MAAGL), a framework that partitions a graph into communities and assigns a dedicated agent to each community for specialized reasoning. MAAGL addresses two key challenges in existing agentic graph learning: it preserves permutation invariance by summarizing structural evidence with a dynamic structural signature, and it controls context size by filtering semantic evidence to the top‑k relevant nodes. Experiments on four benchmark datasets demonstrate that MAAGL outperforms state‑of‑the‑art agentic graph learning methods.
arXiv:2609.39777v1 Announce Type: new Abstract: LLM-based multi-agent systems coordinate specialized reasoning through aggregation, interaction, and adaptive control, yet their potential for graph le...
GraphCert introduces a method to bootstrap graph reasoning agents by generating graph‑grounded question‑answer pairs and certifying the supporting evidence. The approach uses a Bootstrapped Graph Quizzer to produce QA pairs, then executes and semantically curates the evidence into certified rubrics that guide reward‑based training of a Graph Solver. Experiments on five GRBENCH domains show GraphCert outperforms larger LLM agents and demonstrates robust policy transfer across heterogeneous graphs.
arXiv:2606. 16328v1 Announce Type: new Abstract: Large Language Models (LLMs) demonstrate remarkable potential in dynamic graph reasoning, but suffer from a scaling bottleneck: current models can only handle graphs with tens of nodes, constrained by exponential reasoning overhead and finite context windows.
arXiv:2608.29263v1 Announce Type: new Abstract: Large Language Models (LLMs) often suffer from hallucination and struggle with complex reasoning tasks requiring multi-hop domain knowledge. While inte...
arXiv:2608. 00542v1 Announce Type: new Abstract: Graphs model relational data throughout science and industry, from citation networks to product co-purchase graphs.
arXiv:2609.05774v1 Announce Type: new Abstract: Recent multi-agent LLM systems increasingly rely on graph-structured communication to coordinate specialized agents. We revisit multi-agent orchestrati...
GRAIN is a single-agent reinforcement learning framework that improves large language models’ robustness to real‑world shifts in node identifiers and task formulations by treating reasoning as a semantic parsing and tool‑execution pipeline. It introduces a Structure Invariance Reward that validates intermediate graphs against ground‑truth topologies, encouraging the model to learn genuine text‑to‑structure mappings instead of overfitting to surface patterns. On the new GRIT benchmark, GRAIN surpasses multi‑agent baselines by 16.45% in accuracy, reduces latency by about 24%, and halves the out‑of‑distribution gap of fine‑tuned models while remaining robust on large‑scale graphs beyond the training distribution.
The paper introduces HypoAgent, an agentic framework for refining abductive hypotheses over knowledge graphs. It treats user-provided conditions as steering operators, using a small generator for initial proposals, root-cause analysis to identify problematic branches, and a refiner agent that revises hypotheses based on diagnosis and prior proposals. Experiments on BioKG, PharmKG8k, and DBpedia50 show HypoAgent surpasses one-shot generation in both single-turn and multi-turn scenarios, including unconditional settings.
arXiv:2609.13808v1 Announce Type: new Abstract: Structured knowledge fact checking aims to determine the truthfulness of natural language claims by reasoning over structured evidence. Recent program-...
arXiv:2411. 00028v3 Announce Type: replace-cross Abstract: Socioeconomic prediction aims to leverage various urban data to predict the socioeconomic indicators of regions such as population and commercial activity level, which plays an important role in understanding urban regions and supporting decision-making.
The paper examines when multi‑agent collaboration is truly beneficial as large language models grow more capable. It finds that multi‑agent systems yield systematic advantages mainly for long‑horizon tasks with sparse dependencies, while single‑agent approaches excel in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight, graph‑based collaboration framework that balances context efficiency and performance, demonstrating that adding more agents or deeper recursion does not always improve outcomes.
arXiv:2508. 00429v5 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-based learning by propagating information among neighbor nodes via predefined aggregation mechanisms.