AI Agent Narrows Search for Conway's Elusive 99‑Graph, Sets New Non‑Existence Bound
An autonomous AI research agent tackled Conway's 99‑graph problem, proving no circulant or other abelian order‑99 graph satisfies more than 68 % of the constraints and reducing existence to a 12‑regular graph on 84 vertices. It delivered a verified partial‑credit bound of 69.43 %, the strongest frontier to date.