# Direct Optimization of Generators for Search in Automated Theorem Proving

Source: https://arxiv.org/abs/2609.25575
Published: 2026-09-22
Status: unreviewed source report

## Source excerpt (up to 25 words)

> Fine-tuned Large Language Models (LLMs) significantly advance Automated Theorem Proving (ATP), but are often deployed as guiding policies within tree search rather than for single-attempt

## Review question

Inspect the formal statement, imported axioms, admitted lemmas, checker version and correspondence with the informal theorem. A successful compiler exit alone does not prove that the intended question was formalized.

No independent proof check or claim of peer review.