Search papers, labs, and topics across Lattice.
Affiliation:
2
0
3
Achieving 100% success in certifying equational implications without relying on language models showcases a breakthrough in automated theorem proving efficiency.
LLMs exhibit a surprising mechanism-level routing ceiling, with accuracy jumping by over 10% when provided with specific cues, revealing critical misrouting issues in proof-mechanism classification.
