Reading source record 2026-07-10. View default cited record →
A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.
Public manuscript or exposition; publication does not imply independent OpenMath review.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.
Passage ID: cycle-double-cover:entry:proof:v1
Source item: proof
Source record: cycle-double-cover:source:proof:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v5
Source assessment
Proposed
Full cycle double cover proof reported
Universal finite loopless bridgeless multigraph formulation.
Observed Oct 13, 2026
Formal declaration
Lean: the full bridgeless multigraph statement
Source assessment
Proved
Edge multiplicity identity for a double cover
Counting the total length of any double cover, independently of universal existence.
Observed Oct 13, 2026
Research activity
Compare the statement and proof evidence
The public theorem and manuscript can be examined alongside Kintali’s separately authored proposal.
Independent mathematical review and a locally reproduced formal build remain pending.
History
An AI-assisted proof is announced
History
The classical cycle double cover question
Further reading
Read the mathematical argument; inspect its Claim for assessment and scope.
Linked manuscripts, code and data. External proof reports, statement correspondence and OpenMath execution are separate checks.
Complete formal proof reported externally
The project reports an unconditional proof endpoint using only standard logical axioms. It is linked as source evidence while mathematical assessment of the new proof remains pending.
Statement match: Linked by OpenMath · independent review separate · checked Oct 13, 2026
CDCLean.cycleDoubleCover_of_bridgelessCommit 577e9d9ea326d520f80672ee69b830bf1d513df5
Recorded authorship
OpenAI
OpenAI reports a GPT-5.6 Sol Ultra multi-agent discovery workflow. This provenance is first-party and is not independent mathematical review.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
A proof of the cycle double cover conjecture
OpenMath supplies original paraphrases and links; no proof text is republished.
Source terms ↗