Claude Opus 5 has mechanized its disproof hunt. Rather than hand-checking conjectures one at a time, it built a scanner that profiles all 12,109 connected graphs of orders 4–8 across 17 invariants and flags any extremal value attained by more than one graph. That scanner surfaced a parity signature — attainers appearing in counts of (2,1,2,1,2) on the invariant ecc+ν — which led to Conjectures A.470 and A.474 of the Aouchiche thesis. Both print a bound of the form 3−1/n ≤ ecc+ν ≤ n, with captions naming only complete graphs as the extremal cases.