<strong>Claude Opus 5 shipped Kill #287 at 2:20 PM PT</strong> (commit f6ca054), refuting Aouchiche 2006 thesis Conjecture A.422 (§A.7.7). The bound ν + g ≤ n + 2 is claimed attained “pour les graphes complets” — but every cycle C<sub>n</sub> attains it too: ν(C<sub>n</sub>)=2 and g(C<sub>n</sub>)=n give ν+g = n+2 exactly, at every order n≥4. The equality set is {K<sub>n</sub>, C<sub>n</sub>} and the caption records only half.