Danus, an orchestration system for research-level mathematical reasoning centered on a shared fact graph as a global memory-management mechanism, is proposed, suggesting that fact-graph-based orchestration provides an effective route toward scaling mathematical reasoning agents for long-horizon research problems.
Abstract
Recent LLM-based mathematical reasoning agents have begun to tackle research-level problems and, in several cases, have contributed to the resolution of open problems. However, scaling and orchestrating such agents effectively remains challenging, due to the difficulty of coordinating parallel proof search while keeping intermediate claims organized and reliable. In this paper, we propose Danus, an orchestration system for research-level mathematical reasoning centered on a shared fact graph as a global memory-management mechanism. Danus consists of a main agent that performs planning and coordination, multiple worker agents that carry out proof search in parallel, and a stateless verifier that checks proposed mathematical claims before they are admitted into the fact graph. Each verified fact is stored together with its proof and logical dependencies, allowing the system to build long arguments incrementally while keeping the shared proof state organized. The main agent periodically summarizes the evolving proof state, redirects workers across promising directions, and supports interaction with human mathematicians through progress reports. We evaluate Danus through six research-level case studies in algebraic geometry, singularity theory, and combinatorics, illustrating how the fact-graph memory mechanism enables Danus to construct long, detailed mathematical proofs. Our results suggest that fact-graph-based orchestration provides an effective route toward scaling mathematical reasoning agents for long-horizon research problems. Danus is open source at https://github.com/frenzymath/Danus.
This work synthesizes a task-conditioned temporal workflow graph that jointly specifies agent connectivity and edge-level communication semantics, and introduces ReActNet, a training-free framework that compiles a query and a set of role-specialized agents into a sequence of directed communication graphs.
Apodex 1.1 reaches the leading performance band despite using a substantially smaller model than many frontier systems, and the 35B-parameter Apodex 1.1 Mini further retains strong working capability in a locally deployable form.
The results suggest that scientific-agent capability depends not only on the base model but on whether an architecture can be formed to match the task's cognitive structure, as well as establishing results on regret, planning invalidation, amortization, subtree interfaces, serializability, and verification.
GRA is presented, a Graph Reasoning Agent that explores hybrid knowledge graphs, whose nodes are either textual concepts or relational tables, with seven generic tools, discovering everything domain-specific at run time.
M. Dragić, Ruben Ifrah, Alexandre Rio· 0 citations
AgentRadio is presented, an asynchronous message-passing layer that equips coding-agent harnesses with three primitives: threads, messages, and waiting for mentions that shows the gain growing with task difficulty, consistent with mid-course correction as the underlying mechanism.
Xinxing Ren, Qianbo Zang, Ziyan Wang et al.· arXiv.org· 0 citations
Graph Engineering is introduced, an emerging paradigm for next-generation agent systems that provides a unified foundation for organizing complex objectives, orchestrating heterogeneous agents, modeling system dynamics, and enabling scalable agent evolution.
Yuyuan Feng, Zhi-Shang Xiang, Chao Yang et al.· 4 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.