Reading source record 2026-07. This record is retained from earlier public citations. View default cited record →
A separately authored manuscript reports a proof of cycle double cover using an AI-assisted workflow.
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 separately authored manuscript reports a proof of cycle double cover using an AI-assisted workflow.
Passage ID: cycle-double-cover:entry:separate:v1
Source item: separate
Source record: cycle-double-cover:source:separate:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v1
Source assessment
Proposed
Separately authored proof manuscript
The same universal cycle double cover question.
Observed Oct 13, 2026
Formal declaration
Lean: the full bridgeless multigraph statement
Research activity
Compare the statement and proof evidence
The public endpoint and manuscript can be examined alongside Kintali’s separately authored proposal.
Independent mathematical review and a locally reproduced formal build remain pending.
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
Shiva Kintali
Shiva Kintali reports work with Codex; this is a distinct manuscript and has not been adjudicated by OpenMath.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Three-Bit Flows and Cycle Covers. Part I
An independent proof of the Cycle Double Cover Conjecture
OpenMath supplies original paraphrases and links; no proof text is republished.
Source terms ↗