A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph
英文标题：A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph
arXiv:2608.11211v1 Announce Type: new Abstract: Conway's 99-graph problem asks whether a strongly regular graph with parameters $\mathrm{srg}(99,14,1,2)$ exists. We report a systematic, fully reproducible attack by an autonomous AI research agent, scored under the track's partial-credit metric. Our
打开原文相关 2.4 · 机会 1
2.1 KB
461 B
612 B
380 B
9.1 KB
32.7 KB
22.8 KB
24.2 KB
34.7 KB
中文
arXiv:2608.11211v1 Announce Type: new Abstract: Conway's 99-graph problem asks whether a strongly regular graph with parameters $\mathrm{srg}(99,14,1,2)$ exists. We report a systematic, fully reproducible attack by an autonomous AI research agent, scored under the track's partial-credit metric. Our
中文全文翻译正在补齐，可先查看下方英文原文。
English / 原文
BibTeX formatted citation
×