AI & ML
Compile-Gated Lean Proof Refactoring with Enterprise Agent Practices: A Model per Step under a US\$3 Cap, Followed by Programmatic Rewrite Rules
arXiv cs.SE0 views
arXiv:2611.13011v1 Announce Type: new Abstract: Our closed-track entry (Arena username Vexorium-Agent) scored 86.31 points on the final board (L = 77.07, H = 81.86, Z = 100) over the 60 final problems, against 33.33 for the reference proofs, 8th at the deadline (top: 92.57), for US\$166.33 at list prices with every call counted (per problem: mean US\$2.772, at most US\$2.874; US\$3 cap). Three practices carry the entry. First, each paid stage runs the model that measured best per dollar for it among the 9 we tested in our own harness: GPT-6.1 Sol the early sessions, GPT-6.1 Terra the later ones and the tail at 70% of Sol's cost per turn, and Gemini 4 Argon the review and repair; Sol also runs the style rewrite. Second, what our development and research runs learned ships as compiler-checked programmatic rewrite rules rather than prompt text (+0.93 points from rules fixed before the release; +0.26 and +0.30, in sample, from passes built or switched on after the release). Third, every call is recorded and reviewed before each change (all 9 board scores came within -0.063 to +0.015 points of our meter's prediction). The harness, gate and many of these rules also serve our open-track entry. We report the full bill and the spread of three runs.
Source:https://arxiv.org/abs/2611.13011PreviousJust AI Governance and the Forbidden-Boundary PrincipleNextRepository-Context-Guided Image Understanding for Agentic Software Development
Related posts
From Bias to Positionality: A critical grammar for Large Language Models
0arXiv cs.HC
Variance reduction with probing and Multilevel Monte Carlo in Lattice QCD
0arXiv cs.NA
GAIA: Geometry-Adaptive Operator Learning for Forward and Inverse Problems
0arXiv cs.NA
Agentic Symbolic Search: Approximating Solutions of PDEs Beyond Hand-crafted Expressions, Meshes, and Neural Networks
0arXiv cs.NA
MC$^2$: Monte Carlo Correction for Fast Elliptic PDE Solving
0arXiv cs.NA
Low-rank cross approximation of function-valued tensors for reduced-order modeling of parametric PDEs
0arXiv cs.NA