OpenAI GPT-5.6 Sol Ultra proves 50-year graph theory conjecture in one hour
OpenAI's latest model GPT-5.6 Sol Ultra used 64 sub-agents to independently complete a full proof of the "Cyclic Double Cover Conjecture" in under one hour. This graph theory problem had remained unsolved for over half a century. Although the proof is concise and clever, it has not yet undergone peer review, and the mathematics community is maintaining caution and conducting examination.
Return to original text
A short introduction is retained here; the full text from the source website is not reposted. For specific wording and subsequent updates, please refer to the original article.
Open the original article on ITHome