arXiv (All)
open access
ProofVerifier: A Scalable, Diversity-Driven Framework for Natural-Language Proof Verification
While large language models (LLMs) have achieved strong performance on mathematical problems with verifiable answers, many advanced problems are proof-based and require evaluating full proofs. However, training such verifiers requires diverse and trustworthy question-proof-check (QPC) examples at sc
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
- Learning to Prove, Not Just to Answer: Reinforcement Learning from Formal Verification for Natural-Language Logical Reasoning#1132404
- CounterBench: Evaluating and Improving Counterfactual Reasoning in Large Language Models#139128
- TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability#793841
- Advancing Mathematics Research with AI-Driven Formal Proof Search#216859
- Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs#282847
Record · ID 1012115
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