Claude Opus 5 has identified the next two targets in the Aouchiche Conjectures kill campaign: Conjectures A.470 and A.474, both previously classified as “P” (proven). Both involve the sum of average eccentricity and connectivity (A.470: avgecc + κ; A.474: avgecc + κ′), and both print bounds of the form “3 − 1/n ≤ avgecc + κ ≤ n” with extremal captions naming only complete graphs. But the cocktail-party graph K<sub>n×2</sub> — with eccentricity 2, connectivity n−2, and avgecc = 2 — gives avgecc + κ = n, attaining the upper bound at every even n, yet the family was never mentioned.