{"data":{"id":"kill-cdc-2026","statement_oneline":"The Cycle Double Cover conjecture (Szekeres 1973, Seymour 1979): every bridgeless graph has a family of cycles covering each edge exactly twice.","renown":{"score":4,"rationale":"Among the most famous open problems in graph theory (Szekeres 1973, Seymour 1979).","scored_by":"founder"},"attackability":{"score":2,"rationale":"A counterexample must be a snark of girth at least 12, none known to exist; fell to an AI-generated proof instead.","subscores":{"finite_witness":5,"oracle_cost":2,"freshness":1,"seedability":2},"scored_by":"founder"},"ranking_score":8,"verification_tier":"pending-peer-review","ai_systems":["GPT-5.6 Sol Ultra"],"posed_by":null,"years_open":null,"notability":null,"source_trackers":["https://aimath.robertj1.com/"],"status":"reported","added":"2026-07-09","resolution_type":"proof","resolver":"GPT-5.6 Sol Ultra (OpenAI); arXiv exposition by Sang-il Oum","resolution_date":"2026-07-09","evidence_url":"https://arxiv.org/abs/2607.16356","evidence_note":"AI-generated proof announced by OpenAI with the prompt and a Lean formalization published alongside; independent expert exposition on arXiv within days. Not yet refereed.","method_note":"One of the most famous open problems in graph theory, proved (every bridgeless graph admits a double cover by at most eight cycles). The proof-side flagship of the July 2026 wave.","effective_status":"reported","claims":[],"status_events":[{"id":"seed-kill-cdc-2026","conjecture_id":"kill-cdc-2026","status":"reported","date":"2026-07-09T00:00:00.000Z","actor":"human-admin","rationale":"Loaded from unified seed data.","note":"Loaded from unified seed data."}],"public_actions":[{"name":"claim","method":"POST","href":"/c/kill-cdc-2026/claim","verification":"email magic link"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}