Skip to content
Research

Can LLMs Reliably Grade Olympiad Proofs? A Study of Mathematical Verification with LLMs.

arXiv:2610.36767v1 Announce Type: new Abstract: Large Language Models (LLMs) have made remarkable progress on solving competition-level mathematics, yet their ability to verify natural-language mathematical proofs remains relatively underexplored. This gap is

arXiv cs.AIResearch source·