Skip to content

Albilich: Steerable Proof-State Orchestration for LLM-Based Mathematical Research with CAS Integration

Jul 2026 · arXiv.org · Vol abs/2607.27705 · 3 citations · 13 references
Computer Science

TL;DR

Albilich, an open-source agentic harness for autoresearch in mathematics that combines long-horizon reasoning, computer algebra systems (CAS), literature retrieval, and persistent SQLite-based context management, is presented.

Abstract

Large language models can contribute useful ideas to mathematical research, yet long-horizon proof attempts remain difficult to coordinate, evaluate, and reproduce. We present Albilich, an open-source agentic harness for autoresearch in mathematics that combines long-horizon reasoning, computer algebra systems (CAS), literature retrieval, and persistent SQLite-based context management. We evaluate Albilich on the RealMath benchmark (Zhang et al. 2025) and on open problems in group theory from the Kourovka Notebook (Khukhro and Mazurov 2026). It solved 10/10 problems on RealMath with CAS and 9/10 with no CAS. On the Kourovka problems, Albilich produced a counterexample to Problem 21.142 and a proof of a strengthening of Problem20.2. Anablation on Problem 17.91 demonstrates 32.0% token reduction when CAS is enabled. An ablation on Problem 21.142 demonstrates higher verifier-rejection rate and failure to synthesize proof routes in the absence of the advisor agent. These results support Albilich as a human-steerable, CAS-boosted environment for scalable AI-assisted mathematical research.

View source

Similar papers

Preprint Aug 2026

CAPRI: Contract-Aware Proof Repair for Isabelle

CAPRI is presented, a contract-aware repair workflow in which Isabelle checks the proof and an independent checker enforces a machine-readable edit contract, in which Isabelle checks the proof and an independent checker enforces a machine-readable edit contract.

Jim Woodcock, Gabriel Leite, Augusto Sampaio et al. · 1 citation
#artificial intelligence Preprint Sep 2026

TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Science

TCSAlgBench provides a refreshable testbed for measuring progress in model reasoning and studying how agent workflows support research-level proof discovery, and evaluates ten model configurations from four families under direct inference and prover-verifier discussion, and compares four agent workflows under matched m...

Chu-Tong Yang, Xi-Yuan Zhang, Yu Huang et al. · 0 citations
#natural language process... Preprint Sep 2026

CORE: Conflict-Oriented Reasoning Elimination for Verifiable Language-Model Search

Test-time reasoning systems often respond to failure by restarting or revising the latest step, even when an earlier decision caused the error. We introduce CORE, a search controller that requests a certified conflict core from a verifier, backjumps to the latest decision in that core, and caches the conflict to avoid...

Si-Yu Song, Rui-Peng Xu, Jia Lin et al. · 0 citations
Open access Sep 2026

Modelling Shared-Space Coordination in mCRL2: a Bach-to-mCRL2 Translation Framework

Although significant research has focused on the theory and implementation of data-based coordination languages, the critical aspect of their automated verification using model-checking techniques remains underexplored, which is essential for ensuring reliability and correctness in distributed systems. Existing tools,...

Corentin Reuther, Jean-Marie Jacquet · 0 citations
Open access Aug 2026

QuickChecking Convergence of Rewriting Systems (Functional Pearl)

A QuickCheck testing method based on generating and shrinking random execution traces based on checking if the first and last terms of a generated trace share the same deterministic normal form that efficiently finds counterexamples and enables fast, robust shrinking.

Koen Claessen · 0 citations
#artificial intelligence Preprint Sep 2026

SOVER: Formal Certification of Optimization Reformulations via LLM-Assisted SMT Verification

SOVER, an LLM-assisted SMT framework that separates semantic mapping from formal certification, is introduced, and Z3 checks domain cross-feasibility and global objective-order preservation for mixed-integer linear formulations, while dReal provides tolerance-aware feasibility/range and $\epsilon$-argmin checks for con...

Swapnil Bhattacharyya, Mayank Baranwal · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.