arXiv:2606. 03303v1 Announce Type: new Abstract: Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean.
By Po-Nien Kung, Linfeng Song, Dawsen Hwang, Jinsung Yoon, Chun-Liang Li, Simone Severini, Mirek Ol\v{s}\'ak, Edward Lockhart, Quoc V Le, Burak Gokturk, Thang Luong, Tomas Pfister, Nanyun Peng
arXiv:2605. 22763v2 Announce Type: replace Abstract: Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research.
By George Tsoukalas, Anton Kovsharov, Sergey Shirobokov, Anja Surina, Moritz Firsching, Gergely B\'erczi, Francisco J. R. Ruiz, Arun Suggala, Adam Zsolt Wagner, Eric Wieser, Lei Yu, Aja Huang, Mikl\'os Z. Horv\'ath, Andrew Ferraiuolo, Henryk Michalewski, Edward Lockhart, Codrut Grosu, Thomas Hubert, Matej Balog, Pushmeet Kohli, Swarat Chaudhuri
arXiv:2606. 31134v1 Announce Type: new Abstract: While Large Language Models (LLMs) have demonstrated exceptional capabilities in mathematical reasoning, they frequently produce subtle errors that evade human detection.
By Arshia Soltani Moakhar, Iman Gholami, Max Springer, Mahdi JafariRaviz, MohammadTaghi Hajiaghayi
arXiv:2606. 08728v1 Announce Type: new Abstract: Mathematical reasoning has long served as a stringent test of machine intelligence; over the past decade, it has moved from a niche problem within NLP to one of the most consequential AI frontiers.
By Syed Rifat Raiyan, Mohsinul Kabir, Hasan Mahmud, Md Kamrul Hasan
arXiv:2607. 04631v1 Announce Type: new Abstract: The cost of producing code is rapidly diminishing with increasingly capable AI agents, while quality assurance of generated programs has not kept pace.
By Gabriel Poesia, Simon Henniger, Tzu-Han Hsu, Yilun Du, Nada Amin
The paper introduces the Abstraction Agent, a zero‑shot pipeline that employs a large language model to automatically generate continuous strategic features from a natural‑language game description, score private states, and cluster them into abstraction buckets without any game‑specific evaluators or training data. The pipeline consists of four phases—feature discovery with calibration anchors, batched private‑state scoring, correlation‑based feature selection, and k‑means clustering—and achieves significant reductions in lifted‑strategy exploitability in heads‑up no‑limit Texas hold’em and outperforms scalar rank baselines in ROVER Trials. The method also transfers to other games such as four‑card Pot‑Limit Omaha, HUNL preflop and flop, and Riichi Mahjong, demonstrating that it can uncover strategic concepts that align with recognized game theory insights.
By Boning Li, Longbo Huang