qtBench：29道组合开放难题，OpenAI给出多个拟解
AI Discovery in Combinatorics: From Problems to Solutions and Back to Bigger Problems
数学家把29道组合开放题做成qtBench，OpenAI研究员对几道给出拟解，脚手架还能防作弊。
研究团队在 arXiv 发布 qtBench，收录代数组合领域 29 道开放问题，要求给出能解释多项式系数或恒等式的组合算法。qtBench 配套脚手架，供智能体操作组合对象、验证候选解并防范作弊。团队与 OpenAI 合作，OpenAI 研究员对其中若干问题给出拟解决方案。qtBench 论文还讨论三个元问题：AI 大规模参与数学发现是否合乎伦理、成果如何发布、证明如何组织消化。
AI Discovery in Combinatorics: From Problems to Solutions and Back to Bigger Problems
We introduce $qt$Bench, a benchmark of 29 open problems in algebraic combinatorics. These problems ask for a simple combinatorial algorithm that explains given polynomial coefficients or identities. To help AI agents search for such algorithms, we provide a scaffold for playing with combinatorial objects, countering cheating attempts, and testing candidate solutions. To explore how far frontier AI systems can go on these problems, we collaborated with OpenAI, whose researchers obtained proposed solutions to several of them. This highlights bigger meta-problems: is AI discovery at scale ethical? How should these results be released? How should proof digestion be organized? We discuss these questions and give our views.