arXiv — cs.AI preprintsInternational9 October 2026
LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.11862v1 Announce Type: new Abstract: Mathematicians value proofs for more than correctness: among correct proofs, simplicity, purity and the computational cost of finding them vary widely. Yet LLM-powered theorem provers largely search for any correct proof, and improve its quality only after it is found. We propose LEVER, a proof search algorithm that makes the objective over correct proofs programmable and optimizes it during search. LEVER scores partial proofs over an AND/OR proof graph, combining realized objective values with predictions for open subgoals, so the objective guid
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- An Explainable Header-Centric Framework for Large-Scale Semantic Table Interpretation and Data Quality Assessment9 October 2026
- Synthesis Through Simulation: Generating Coherent Enterprise Data via Scalable Agent-System Interaction9 October 2026
- Agent-Controlled Forgetting for Tool-Using Agents: Reversible Context Curation in Practice9 October 2026
- Verification and Self-Improvement in Agentic AI: Foundations and Limits9 October 2026
- The Harness as the Only Mutable Surface: Compliance-Bounded Self-Evolution of LLM Agents in Credit Pipelines, with a Measured Admission Gate9 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.