arXiv cs.LG
· Papers
Theoria: Rewrite-Acceptability Verification over Informal Reasoning States
arXiv:2607.01223v1 Announce Type: cross Abstract: When should an AI system's answer be trusted? Formal proof assistants offer certainty but cannot reach most of the problem distribution; scalar LLM judges offer coverage but produce opaque scores that cannot be audited after the fact and are subject to the same coherenc