This work evaluates SymBuild in three construction domains: computer-aided design (CAD) assembly, Mini-Programs, and exact-fill packing, and test additional framework instantiations in all four domains, demonstrating that SymBuild is an effective, analyzable method for anytime verified construction.
Abstract
Many sequential construction tasks have exact terminal symmetries even though execution is directed and depends on history. Process evidence supplies order; terminal correspondence transports it between equivalent outcomes; the realized state updates relevance. These roles define a carrier framework: transport what the outcome preserves; refine what history changes. SymBuild combines transported process and state residual ranks by ordinal rank meet; its top-$k$ prefix exactly equals their top-$k$ union, yielding a tight worst-case verifier query bound under prefix information. We evaluate SymBuild in three construction domains: computer-aided design (CAD) assembly, Mini-Programs, and exact-fill packing, and test additional framework instantiations in all four domains. SymBuild improves the area under the anytime verified success curve by up to 6.77, 21.75, and 8.68 points over Static in the three construction domains. Refresh gains recur beyond SymBuild under alternative aggregation, planning, and learned scoring methods; on Geometric Reasoning Network (GRN) target removal, direct Combined refresh has the lowest mean verifier query score at all three scales and reduces learned state evaluations by factors of 6.48-12.20 relative to refreshed population-based search. Together, these results support the carrier framework and demonstrate that SymBuild is an effective, analyzable method for anytime verified construction.
ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...
This work introduces Verifier-Certified Rule Transport (VCRT), which replays adjacent operation pairs with native verifiers to preserve genuine prerequisites and constrains post-swap consistency, source retention, and policy drift.
Bang Xie, Hao Liu, Zhi-Yuan Peng et al.· 0 citations
Across eleven rule families under fifteen pre-specified predictions (thirteen confirmed), unexplained-pair rates span 0% to 99.9999% and track provable structure: six theorems give sufficient conditions for transitivity and its failure.
The Adaptive Consistency Graph (ACG) is introduced, which incrementally organizes execution evidence and its provenance in a persistent graph, then constructs a temporary requirement-centered view for each decision under a bounded context budget.
SemVerBench is introduced, the first benchmark of LLM version-constraint resolution semantics across three ecosystems (npm, PEP 440, Cargo), and six frontier models are evaluated: Opus significantly outperforms all other models, and Sonnet outperforms the OpenAI models (McNemar).
Qi-Bai Chen, Ze-Ming Liu· 1 citation
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduSep 29, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.