arXiv AI By Honghao Lin, David P. Woodruff, Yuan Deng, Jieming Mao, Song Zuo, Vahab Mirrokni

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Read the original on arXiv AI →

Stellar Colosseum is a model‑agnostic harness designed to improve long‑horizon research in mathematics and theoretical computer science by allocating inference across multiple agents. It explores alternative strategies before constructing proofs, uses a readiness gate to decide when a route is mature enough to decompose, represents proof plans as interdependent subproblems, and routes verifier findings back to the relevant part of the argument. The workflow generates candidates in parallel, attacks them with targeted falsification, and combines candidates and critiques into a single research artifact through overlapping random‑sample tree aggregation, and has been integrated into Google Antigravity's Teamwork framework as the Long Proof pattern. Demonstrations show that, when paired with Gemini 3.1 Pro, Stellar Colosseum achieves 71.0% accuracy on the TCS‑Bench theorem‑proving benchmark and solves 218 of 222 Codeforces problems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 1

Cogentic: Multi-Agent Orchestration for Automated Proof Discovery

Cogentic is a multi‑agent system designed to automate proof discovery for open research problems. It uses an iterative prove‑verify loop where an orchestrator assigns independent provers to different proof directions, verifies their outputs with specialized components, and records confirmed intermediate results in a persistent ledger for future rounds. Built on Gemini, Cogentic has produced novel results on five open problems in online learning, auction theory, and mechanism design, each verified by domain experts and detailed in companion papers.

By Yang Cai, Vineet Gupta, Yanchen Jiang, Christopher Liaw, Aranyak Mehta, Grigoris Velegkas, Di Wang
arXiv AI
Oct 9

LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs

LEVER is a new proof‑search algorithm that lets users program the objective over correct proofs and optimizes it during search. It scores partial proofs on an AND/OR graph, combining achieved objective values with predictions for open subgoals, so the objective guides search before a proof is complete. On the PutnamBench in Lean 4, LEVER reduces computational cost by 34 % and raises the solve rate from 80 % to 96 %, while also improving topical impurity and approaching refactoring for proof length.

By Nihal Jain, Shuangjie Yao, Begum Cicekdag, Zhuo Zhang, Suman Jana
Hugging Face Trending Papers
Jul 13

AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification

Large language models (LLMs) have achieved remarkable performance on high-school and olympiad-style mathematics, yet their capabilities on advanced mathematics remain poorly understood. Existing benchmarks, however, fall short in both scope and evaluation granularity: they provide limited disciplinary coverage and often rely on final-answer correctness or coarse judgments, leaving the validity of the reasoning process inadequately assessed.