What happened
These are three documented math outcomes from the same GPT-5 collaboration paper, bundled because they share a date, model, and source. For Erdős 848, GPT-5 proposed a density estimate / odd-number constraint that Sawhney and Sellke refined into a complete proof; humans remained the authors. For tree subgraph counts, GPT-5 produced short self-contained proofs of a known inequality and a conjectured one, which the authors adopted after checking. For a growing-network model, GPT-5 identified the limiting leaf fraction as the observable that makes a hidden attachment parameter identifiable; the authors completed the proof. A fourth case in the same paper, clique-avoiding codes, is excluded: OpenAI later found the bound already in the literature. This is human-led collaboration, not autonomous discovery, and not GPT-5.6 Sol.