GPT-5.6 Pro
Benefit
+0.48
Harm
0.00
Net Good
0.48
Verified benefit
0.00
History
Cumulative score
- Benefit
- Harm
- Net
Domains
Release
Status released. First dated 30 Jul 2026.
Event timeline
Liu, Luo, and Xie post a complete proof of the Tu–Deng conjecture
On 30 July 2026 Renzhang Liu, Hengyi Luo, and Tianyuan Xie posted a complete proof of the Tu–Deng combinatorial conjecture on Hamming weights modulo 2^k−1 (arXiv:2608.05187). A compiled dataset records ChatGPT 5.6 Pro assistance; the arXiv abstract does not name a model or split of labor.
Rybin, using GPT-5.6 Pro, counters the Dinitz–Garg–Goemans unsplittable-flow cost conjecture
On 22 July 2026 Dmitry Rybin announced an explicit 7-vertex graph in which a feasible fractional unsplittable-flow costs 58 while every congestion-legal unsplittable flow costs at least 60, disproving Goemans’ cost-preserving rounding conjecture. He attributes the construction to GPT-5.6 Pro. An Isabelle Archive of Formal Proofs entry later checks the finite instance.