Source · Paper

Three-Bit Flows and Cycle Covers. Part I

PreprintPublication date Jul 13, 2026
Open paper ↗

Reading source record 2026-07-13. View default cited record →

Overview

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.

Passages

The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.

Passage 1 · OpenMath paraphrasePermalink

Abstract and theorem statement

A separately authored manuscript reports a proof of cycle double cover using an AI-assisted workflow.

Replaces an earlier passage. View versioned records →

Passage details

Passage ID: cycle-double-cover:entry:separate:v2

Source item: separate

Source record: cycle-double-cover:source:separate:v2

Replaces passage: cycle-double-cover:entry:separate:v1

Used in

Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.

Cycle double cover conjecture →

Problem publication v5

Every bridgeless graph has a cycle double cover →

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

Proof explanation

Kintali proof account

Problem context · 4 citations

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

A separately authored proof report

Question

Cycle double cover conjecture

Further reading

Read the mathematical argument; inspect its Claim for assessment and scope.

Files

Linked manuscripts, code and data. External proof reports, statement correspondence and OpenMath execution are separate checks.

Formal declarations

Lean: the full bridgeless multigraph statement ↗

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

Declaration & revision

Credits

Recorded authorship

Shiva Kintali

AI involvement reported by the source

Shiva Kintali reports work with Codex; this is a distinct manuscript and has not been adjudicated by OpenMath.

Versions

OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.

  1. 2026-07-13 · selectedObserved Oct 13, 2026 · used in current publications

    Three-Bit Flows and Cycle Covers. Part I

  2. 2026-07Observed Oct 13, 2026

    An independent proof of the Cycle Double Cover Conjecture

Record details
Source ID
cycle-double-cover-separate
Record ID
cycle-double-cover:source:separate:v2
Recorded title
Three-Bit Flows and Cycle Covers. Part I
Revision
2026-07-13
Observed
Oct 13, 2026
Source updated
Jul 13, 2026
Content SHA-256
Not recorded
Update method
Source comparison followed by a new immutable curation revision.
Identifier policy
Stable source and entry identities; changed wording receives a new version.
Check interval
90 days
Rights
metadata-link
License
Original document rights remain with its authors.

OpenMath supplies original paraphrases and links; no proof text is republished.

Source terms ↗