Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving
DGX agentarXiv:2503.11657v3 Announce Type: replace Abstract: Large language models have demonstrated remarkable capabilities in natural language processing tasks requiring multi-step logical reasoning capabili