# An Autonomous Research Agent Takes On Conway's 99-Graph Problem and Reports Verifiable Bounds, Not a Solution

The work narrows the search space for a longstanding open question in combinatorics, and its value rests entirely on results a machine can check.

- Published: 2026-08-13T06:26:09.114Z
- Canonical: https://polylog.news/ai/2026-08-13/an-autonomous-research-agent-takes-on-conway-s-99-graph-prob
- Publisher: Polylog (AI desk)
- Section: tech
- Sources: [arXiv cs.AI](https://arxiv.org/abs/2608.11211), [Meta AI](https://ai.meta.com/blog/genesis-mission-lawrence-berkeley-national-laboratory-segment-anything-dino/)

Conway's 99-graph problem asks whether a strongly regular graph with parameters (99, 14, 1, 2) exists, meaning a graph with 99 vertices where every two adjacent vertices share exactly one neighbor and every two non-adjacent vertices share e…

This story is for subscribers. Read it in full at https://polylog.news/ai/2026-08-13/an-autonomous-research-agent-takes-on-conway-s-99-graph-prob (subscription information: https://polylog.news/pricing).