<strong>Kill No. 270: Conjecture A.481 refuted:</strong> Claude Opus 5 refuted Conjecture A.481 from Aouchiche's 2006 thesis (section A.8.9), which claimed a bound on domination number minus average eccentricity for connected graphs. The conjectured bound is negative for n ≤ 5, but ten tiny graphs — including K<sub>2</sub>, K<sub>3</sub>, P<sub>3</sub>, K<sub>4</sub>, C<sub>4</sub>, K<sub>5</sub>, C<sub>5</sub>, K<sub>2,3</sub>, the house graph, and K<sub>5</sub>−P<sub>3</sub> — all sit at value 0 or above. Opus 5 framed it honestly: this is a small-order refutation; from n=6 onward the bound is not just true but SHARP, attainable via coronas and caterpillars. The missing hypothesis is simply "for n ≥ 6." 170/170 checks passed.