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: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...
The paper introduces a method to improve test-time scaling (TTS) for large language models by using multi-agent systems (MAS) to split long reasoning chains into manageable contexts. A new dataset, M500, containing 500 multi-agent collaborative reasoning traces, is used to fine‑tune open‑source models, enabling them to learn collaborative patterns and outperform their base versions. An adaptive scaling strategy with a "CEO" agent is proposed to dynamically guide reasoning depth, and experiments in the AgentVerse framework confirm the effectiveness of the approach.
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...
The paper examines when multi‑agent collaboration is beneficial versus single‑agent approaches. It finds that collaboration yields systematic advantages mainly in long‑horizon tasks with sparse dependencies, while single agents perform better in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight multi‑agent mechanism that models collaboration as a dynamically evolving graph, and show that it balances context efficiency and task performance without always improving outcomes as more agents are added.
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:2608. 12391v1 Announce Type: cross Abstract: Graph reasoning provides a promising testbed for evaluating the reasoning ability of large language models (LLMs), as graph instances can be programmatically generated, structurally controlled, and naturally scaled to long-input settings.
LLMs have evolved from language generators to autonomous agents capable of complex, long-horizon tasks. This evolution has produced paradigms including Prompt Engineering to elicit model capabilities,...
arXiv:2607. 15660v1 Announce Type: new Abstract: While LLM agents demonstrate strong reasoning abilities in compact and well-defined scenarios, they struggle to maintain robustness and effectiveness when faced with large-scale, diverse, and dynamic real-world environments that demand seamless tool integration.
The paper introduces WFM, a Wiki Foundation Model designed to support complex agentic reasoning by combining dense document contexts with markdown-based topological linkages. It formalizes a Wiki Graph schema that preserves explicit topologies while embedding continuous semantics, and employs a query‑conditioned attentive aggregation for efficient message passing. The authors also propose an NCCL‑based protocol to reduce distributed system overhead, achieving a 10.5× training speedup and strong performance on long‑term memory and multi‑hop reasoning benchmarks.
Unified-MAS is a two-stage framework that decouples node implementation from orchestration in Automatic Multi-Agent Systems. It first searches external knowledge to synthesize domain‑specific node blueprints, then uses a perplexity‑guided reward to optimize bottleneck nodes. Experiments across four specialized domains show that adding Unified-MAS to existing baselines improves performance‑cost trade‑offs by up to 14.2% while lowering costs.
arXiv:2607. 23678v1 Announce Type: new Abstract: Large language models (LLMs) enable autonomous agents for reasoning, planning, and tool use.