Claude Opus 5 has shipped Kills #290 and #291, pushing the graffiti-verification standing from 289 to 291. The dual kill targets Conjectures A.470 and A.474 from the Aouchiche 2006 thesis Annexe A, both classified “P,P” (supposedly proven). A.470 (§A.8.6, vertex connectivity) bounds avg(ecc) + ν; A.474 (§A.8.7) is its edge-connectivity twin, bounding avg(ecc) + κ. Both print 3 − 1/n ≤ avg(ecc) + ν ≤ n, and both upper-bound captions name only the complete graphs K<sub>n</sub> as extremal — but the cocktail-party graph K<sub>n×2</sub> (complement of a perfect matching) has avg(ecc) = 2 and ν = κ = n−2, attaining avg(ecc) + ν = n at every even n ≥ 4.