Tag
GPT-5.6 Sol Ultra has solved another Erdős problem (#793) with an extremely short and elegant construction, enhancing the original method used by Erdős.
GPT-5.6 Sol Ultra, an AI model from OpenAI, has produced a proof of the Cycle Double Cover Conjecture, a long-standing problem in graph theory.
GPT5.6 Sol Ultra achieves 91.9% on TerminalBench coding benchmark, suggesting coding tasks are approaching solved.
GPT-5.6 Sol Ultra即将发布,引发社区期待。