Svmuu News: OpenAI researcher Ethan Knight stated on the social media platform X on the 12th that GPT-5.6 Sol Ultra has generated a proof paper and prompts regarding the “Cyclic Double Cover Conjecture,” a representative unsolved problem in graph theory. The model generated the results in approximately one hour without using internet searches, under a configuration with up to 64 parallel sub-agents.
The 3-page paper published by OpenAI first reduces the problem to a triregular graph, then applies the 8-flow theorem and GF(3) labels, and uses linear algebraic methods to construct a structure where each edge is contained in exactly two cycles. This result has not yet been published in an academic journal or peer-reviewed, nor has it been verified by formal verification systems such as Lean or Coq. Thomas Bloom, a mathematician at the University of Manchester in the UK, described the proof as “excellent” but noted that its references were insufficient. (ZDNet Korea Semiconductor).