# SCOPE: Certified Theorem Proving with a Language Model as the Policy Planner

Source: https://arxiv.org/abs/2610.08319
Published: 2026-10-06
Status: unreviewed source report

## Source excerpt (up to 25 words)

> In proof assistants such as Lean, a generated proof must pass machine compilation checks, so evaluation needs no human scoring. Direct generation fails on multi-step

## 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.