arXiv (All)
open access
Operator Packages, Proposer Strength, and Construction-Family Plateaus in Office-Scale Verified Search
Verified search, in which a language model proposes programs, a hard evaluator scores them, and selection keeps the best, has recently moved mathematical records; controlled ablations of the proposer-side components remain rare. We instrument a minimal FunSearch-style loop at office scale (a 30B loc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- How effective are traditional test criteria at detecting bugs in large language models generated code?#987077
- FlexMoE: One-for-All Nested Intra-Expert Pruning for MoE Language Models#319698
- Code2Math: Can Your Code Agent Evolve Math Problems Through Exploration?#1128563
- Automatic Generation of a Mechanical Properties Question-Answering Data Set for Language Model Benchmarking: A Comparative Study of BERT, XLNet, and LLaMA Models.#14941
- ASA: Backbone-Training-Free Representation Engineering for Tool-Calling Agents#785110
Record · ID 1077564
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive