What is recorded here?
Separated lemma/proof generation from a learned control plane estimating future attempt success and cost from failed trajectories, choosing whether to retry or restart the decomposition.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Inherits lemma decomposition, proof feedback and cost-quality routing. Evaluated on an85problem PutnamBench subset; average savings do not imply uniform savings, optimal stopping or a fully solved benchmark. Router training and inference costs remain relevant.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Kári Rögnvaldsson; Chenhao Sun; Jasper Dekoninck; Martin Vechev
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Cost-aware action routing for agentic Lean proof search
Separated lemma/proof generation from a learned control plane estimating future attempt success and cost from failed trajectories, choosing whether to retry or restart the decomposition.
Scientific scope
Inherits lemma decomposition, proof feedback and cost-quality routing. Evaluated on an85problem PutnamBench subset; average savings do not imply uniform savings, optimal stopping or a fully solved benchmark. Router training and inference costs remain relevant.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Kári Rögnvaldsson; Chenhao Sun; Jasper Dekoninck; Martin Vechev
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.