Source authenticated

Cycle Double Cover Conjecture

Conjectures that every bridgeless graph has a collection of cycles covering each edge exactly twice.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Jul 10, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Cycle Double Cover Conjecture · Cycle Double Cover

Confidence: Not scored

Registry verification: lean checked · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Sol Ultra
model · ai model contributor · OpenAI

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: Cycle Double Cover Conjecture

specialist registry · passed

Announced by OpenAI researcher Ethan Knight on 10 July 2026, timed to the GPT-5.6 Sol Ultra release. Not peer-reviewed; the Cycle Double Cover Conjecture has a history of claimed proofs later found to have gaps, so mathematicians are treating it cautiously pending independent review. Lean released here: https://github.com/openai/cdc-lean

Source ↗

Cycle Double Cover Conjecture

witness · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.

Source ↗

Independent Codex-assisted proof claim the same week (Kintali), unreviewed, arXiv:2607.14140

independent reproduction · pending

independent link supplied by the VibeMathed registry.

Source ↗

Lean-checked proof

lean artifact · pending

lean-proof link supplied by the VibeMathed registry.