The Station is evaluated, an open-world multi-agent environment in which AI agents from different model families pursue a shared research goal without a central coordinator or scripted pipeline, providing a transparent record of how discoveries emerged.
Abstract
We study autonomous mathematical discovery in the Station, an open-world multi-agent environment in which AI agents from different model families pursue a shared research goal without a central coordinator or scripted pipeline. Agents choose their own research directions, conduct experiments, collaborate and publish papers. These papers accumulate into a shared body of knowledge that later agents can read, cite and extend. We evaluated the Station on 12 mathematical construction problems from the AlphaEvolve study and two additional case studies. Five of the 12 problems yielded results novel relative to the prior literature: a new infinite family of finite field Kakeya sets, new exact 604-point kissing configurations in eleven dimensions, improved bounds for the discretized Kakeya needle and sign uncertainty problems, and a substantially improved lower bound for Erd\H{o}s's minimum overlap problem. Agents also discovered novel infinite families for Book Ramsey numbers. Their research extended beyond searching for high-scoring constructions: agents developed explanations of their findings and proved theorems outside the assigned tasks. These explanations guided further discoveries and were preserved in the agents'papers, making the underlying insights easier for external researchers to understand and build upon. All presented discoveries are supported by exact constructions or proofs formally verified in Lean. We release the source code, full agent dialogues, papers and verification code, providing a transparent record of how these discoveries emerged.
E EULER is a multi-agent system that takes a bridge as its unit of search, and evaluates it on 120 recent conjectures drawn from public papers by authors who had recently published in the Journal of Combinatorial Theory, Series A.
A framework that gives LLM agents two mechanisms for searching large solution spaces autonomously: a leaderboard scored on held-out data acts as a reward signal that drives each agent to refine its solutions over repeated submissions, and a loop that operates even with a single agent.
Dulmini Hettiarachchi, Andre Rusli, J. Young et al.· 0 citations
This framework exposes the gap between rewarded partial completion and realized cooperation by certifying what cooperation successful completion requires and using temporal cooperation graphs to reveal what policies exhibit.
Yannick Molinghen, Hugo Charels, Tom Lenaerts· 0 citations
A novel framework based on Koopman operator theory is developed and validates its theoretical guarantees on multi-agent consensus dynamics, making spectral certification a practical layer for trustworthy collective reasoning.
The results show that restricting peer reads during evidence gathering and strengthening commitment boundaries before a hypothesis is shared can broaden search and improve long-horizon multi-agent deep research.
Soyoung Yoon, Bo-Yi Liu, Yi-Te Wang et al.· 0 citations
This work introduces a controlled and MAS-demanding diagnostic benchmark for representative MAS efficiency methods and shows that many reported gains are setup-dependent and may arise from structural collapse, disabled tool pathways, or starting systems where random pruning already preserves accuracy, rather than robus...
Jia-Mu Zhang, Ling-Xi Zhang, Peng-Jun Lu et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.