{"schema_version":"claim-reader-v1","record":{"available_versions":[2,1],"current_version":2,"assessment_summary":"consistent","claim":{"statement":"If C is a cycle double cover of a finite graph G, then the sum of the lengths of the cycles in C, with multiplicity, equals 2|E(G)|.","id":"claim-cycle-double-cover-total-length","slug":"cycle-double-cover-total-length","version":1,"kind":"theorem","title":"A double cover has total length twice the edge count","assumptions":["Assume a cycle double cover is given.","Cycle length counts edges and repeated cycles count repeatedly."],"scope":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","source_entry_ids":["cycle-double-cover:entry:proof:v1"],"formal_declarations":[]},"sha256":"a669f6a8d7cf55361a353ba85e6d7e481ba56898f32321c0d2f78f22008476de","contexts":[{"assessment_history":[{"report_id":"cycle-double-cover:report:cover-accounting:v1","source_id":"cycle-double-cover-proof","source_version_id":"cycle-double-cover:source:proof:v1","source_title":"A proof of the cycle double cover conjecture","source_label":"Edge multiplicity identity for a double cover","state":"resolved","scope":"Counting the total length of any double cover, independently of universal existence.","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","entry_id":"cycle-double-cover:entry:proof:v1"}],"problem_id":"problem-cycle-double-cover","slug":"cycle-double-cover","title":"Cycle double cover conjecture","publication_version":1,"relationship":{"claim":{"id":"claim-cycle-double-cover-total-length","version":1},"relation":"supporting_result","relationship_note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","result":"proved","report_ids":["cycle-double-cover:report:cover-accounting:v1"],"independent_review":"pending","reading":{"placement":"background","note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one."}},"assessments":[{"report_id":"cycle-double-cover:report:cover-accounting:v1","source_id":"cycle-double-cover-proof","source_version_id":"cycle-double-cover:source:proof:v1","source_title":"A proof of the cycle double cover conjecture","source_label":"Edge multiplicity identity for a double cover","state":"resolved","scope":"Counting the total length of any double cover, independently of universal existence.","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","entry_id":"cycle-double-cover:entry:proof:v1"}],"connections":[],"related_claims":[],"progress":[],"tasks":[],"statements":[{"statement":"If C is a cycle double cover of a finite graph G, then the sum of the lengths of the cycles in C, with multiplicity, equals 2|E(G)|.","id":"claim-cycle-double-cover-total-length","slug":"cycle-double-cover-total-length","version":1,"kind":"theorem","title":"A double cover has total length twice the edge count","assumptions":["Assume a cycle double cover is given.","Cycle length counts edges and repeated cycles count repeatedly."],"scope":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","source_entry_ids":["cycle-double-cover:entry:proof:v1"],"formal_declarations":[],"relation":"supporting_result","relationship_note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","result":"proved","report_ids":["cycle-double-cover:report:cover-accounting:v1"],"independent_review":"pending","reading":{"placement":"background","note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one."}}],"entries":[{"id":"cycle-double-cover:entry:proof:v1","source_version_id":"cycle-double-cover:source:proof:v1","item_id":"proof","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","wording":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","wording_kind":"paraphrase","locator":"Main theorem and flow-to-cover construction","supersedes":null}],"sources":[{"work":{"authors":["OpenAI"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"OpenAI reports a GPT-5.6 Sol Ultra multi-agent discovery workflow. This provenance is first-party and is not independent mathematical review.","artifacts":[],"published":{"value":"2026-07-10"}},"id":"cycle-double-cover:source:proof:v1","source_id":"cycle-double-cover-proof","title":"A proof of the cycle double cover conjecture","owner":"OpenAI","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","subject_scope":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","revision":"2026-07-10","content_sha256":"b4797f5053d9067329b3dcfcbf913f8bb40d13467453b1300f6d78d08460fc13","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-07-10","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","attribution":"OpenAI","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}]}],"assessments":[{"report_id":"cycle-double-cover:report:cover-accounting:v1","source_id":"cycle-double-cover-proof","source_version_id":"cycle-double-cover:source:proof:v1","source_title":"A proof of the cycle double cover conjecture","source_label":"Edge multiplicity identity for a double cover","state":"resolved","scope":"Counting the total length of any double cover, independently of universal existence.","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","entry_id":"cycle-double-cover:entry:proof:v1"}],"sources":[{"work":{"authors":["OpenAI"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"OpenAI reports a GPT-5.6 Sol Ultra multi-agent discovery workflow. This provenance is first-party and is not independent mathematical review.","artifacts":[],"published":{"value":"2026-07-10"}},"id":"cycle-double-cover:source:proof:v1","source_id":"cycle-double-cover-proof","title":"A proof of the cycle double cover conjecture","owner":"OpenAI","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","subject_scope":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","revision":"2026-07-10","content_sha256":"b4797f5053d9067329b3dcfcbf913f8bb40d13467453b1300f6d78d08460fc13","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-07-10","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","attribution":"OpenAI","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"cycle-double-cover:entry:proof:v1","source_version_id":"cycle-double-cover:source:proof:v1","item_id":"proof","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","wording":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","wording_kind":"paraphrase","locator":"Main theorem and flow-to-cover construction","supersedes":null}],"formalizations":[],"tasks":[],"assessment_state":"proved","publication":{"version":1,"sha256":"064cf341e226628eea2339189ea9659936c2cc4c453076dc773f1db96969fae0","published_at":"2026-10-13T11:53:12.885580+00:00","reason":"Initial checked pilot publication; source attribution, rights, wording and coverage reviewed by OpenMath staff.","withdrawn":false,"draft":{"representations":[{"schema_version":"visual-representation-v1","id":"cycle-double-cover-setup","version":1,"subject":{"kind":"problem","id":"problem-cycle-double-cover","sha256":"11f23870def900df0cca85eabfcc79b6be02d4e4faab185f85310e2fe49af436"},"purpose":"setup","title":"A triangle covered by two cycle copies","caption":"Take the cycle ABC twice in the cover. Every edge then has multiplicity two. The dashed outline indicates a second copy, not extra graph edges.","description":"A triangle with edges AB, BC and CA is covered by the multiset {ABC, ABC}; each of its three edges is counted twice and total cycle length is six.","assumptions":["Coordinates in the drawing are illustrative unless the caption specifies an exact example."],"limitation":"This example explains the multiset convention. It is not a construction or proof for all bridgeless multigraphs.","author":"OpenMath source curation","authoring_method":"ai_assisted_curation","authored_on":"2026-10-13","independent_review":"pending","source_entry_ids":["cycle-double-cover:entry:lean:v1","cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:separate:v1"],"payload":{"kind":"diagram_schematic","marks":[{"x":240,"y":65,"id":"a","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":100,"y":225,"id":"b","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":380,"y":225,"id":"c","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":240,"y":65,"id":"ab","kind":"segment","end":{"x":100,"y":225},"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":100,"y":225,"id":"bc","kind":"segment","end":{"x":380,"y":225},"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":380,"y":225,"id":"ca","kind":"segment","end":{"x":240,"y":65},"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":225,"y":65,"id":"ab-copy","kind":"segment","end":{"x":85,"y":225},"radius":null,"text":null,"anchor":"middle","dashed":true},{"x":100,"y":240,"id":"bc-copy","kind":"segment","end":{"x":380,"y":240},"radius":null,"text":null,"anchor":"middle","dashed":true},{"x":395,"y":225,"id":"ca-copy","kind":"segment","end":{"x":255,"y":65},"radius":null,"text":null,"anchor":"middle","dashed":true},{"x":240,"y":40,"id":"la","kind":"label","end":null,"radius":null,"text":"A","anchor":"middle","dashed":false},{"x":72,"y":224,"id":"lb","kind":"label","end":null,"radius":null,"text":"B","anchor":"middle","dashed":false},{"x":410,"y":224,"id":"lc","kind":"label","end":null,"radius":null,"text":"C","anchor":"middle","dashed":false},{"x":137,"y":132,"id":"count-ab","kind":"label","end":null,"radius":null,"text":"×2","anchor":"middle","dashed":false},{"x":240,"y":218,"id":"count-bc","kind":"label","end":null,"radius":null,"text":"×2","anchor":"middle","dashed":false},{"x":343,"y":132,"id":"count-ca","kind":"label","end":null,"radius":null,"text":"×2","anchor":"middle","dashed":false},{"x":240,"y":285,"id":"cycle","kind":"label","end":null,"radius":null,"text":"Cycle ABC, taken twice","anchor":"middle","dashed":false}],"features":[{"id":"definition","label":"Read the cover definition","claim":{"id":"claim-cycle-double-cover-existence","version":1},"binding":"scope","mark_ids":["a","b","c","ab","bc","ca","ab-copy","bc-copy","ca-copy","la","lb","lc","count-ab","count-bc","count-ca","cycle"]},{"id":"length","label":"Check the edge-count identity","claim":{"id":"claim-cycle-double-cover-total-length","version":1},"binding":"assertion","mark_ids":["count-ab","count-bc","count-ca","cycle"]}],"legend":"Select a statement below for its scope and evidence. The text view describes the complete drawing."}}],"visuals":[{"representation":{"id":"cycle-double-cover-setup","version":1},"section":"question"}],"claim_relations":[{"claim":{"id":"claim-cycle-double-cover-existence","version":1},"relation":"primary_formulation","relationship_note":"Universal existence. The cited 2026 proof and formal endpoint are reported by their sources; independent mathematical assessment is pending.","result":"proposed","report_ids":["cycle-double-cover:report:proposal:v1","cycle-double-cover:report:formal:v1","cycle-double-cover:report:separate:v1"],"independent_review":"pending"},{"claim":{"id":"claim-cycle-double-cover-total-length","version":1},"relation":"supporting_result","relationship_note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","result":"proved","report_ids":["cycle-double-cover:report:cover-accounting:v1"],"independent_review":"pending","reading":{"placement":"background","note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one."}}],"milestones":[{"id":"cycle-double-cover-question","date":null,"date_basis":"publication","category":"foundation","title":"The classical cycle double cover question","summary":"The question asks for edge multiplicity two, not a vertex cover or a partition into disjoint cycles.","limitation":"The bridgeless and loopless hypotheses are part of the selected formulation.","claims":[],"source_entry_ids":["cycle-double-cover:entry:proof:v1"],"independent_review":"pending"},{"id":"cycle-double-cover-formal","date":{"value":"2026-07-09"},"date_basis":"formalization","category":"formalization","title":"A public full-scope Lean endpoint","summary":"The OpenAI project reports a formalized flow-to-cover construction ending in the universal statement.","limitation":"No local OpenMath proof build or independent correspondence review is recorded.","claims":[{"id":"claim-cycle-double-cover-existence","version":1}],"source_entry_ids":["cycle-double-cover:entry:lean:v1"],"independent_review":"pending"},{"id":"cycle-double-cover-proof","date":{"value":"2026-07-10"},"date_basis":"announcement","category":"proposal","title":"An AI-assisted proof is announced","summary":"OpenAI reports a full proof and provides a manuscript and formal source.","limitation":"First-party completion claims remain under assessment here.","claims":[{"id":"claim-cycle-double-cover-existence","version":1}],"source_entry_ids":["cycle-double-cover:entry:proof:v1"],"independent_review":"pending"},{"id":"cycle-double-cover-separate","date":{"value":"2026-07"},"date_basis":"preprint","category":"proposal","title":"A separately authored proof report","summary":"Shiva Kintali reports a different proof manuscript with Codex assistance.","limitation":"A second proposal does not by itself settle either argument’s correctness.","claims":[{"id":"claim-cycle-double-cover-existence","version":1}],"source_entry_ids":["cycle-double-cover:entry:separate:v1"],"independent_review":"pending"}],"activities":[{"id":"cycle-double-cover-assessment","title":"Compare the statement and proof evidence","kind":"research_direction","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1","cycle-double-cover:entry:separate:v1"],"summary":"The public endpoint and manuscript can be examined alongside Kintali’s separately authored proposal.","limitation":"Independent mathematical review and a locally reproduced formal build remain pending.","related_claim_ids":["claim-cycle-double-cover-existence"]}],"curation":{"checked_on":"2026-10-13","selection":"The canonical statement, selected results and public proof evidence, with historical and contribution context.","search_scope":"Selected primary manuscripts, theorem declarations and project provenance reviewed on 13 October 2026; this is not an exhaustive literature survey.","formal_status":"A pinned Lean source reports a complete unconditional endpoint for the ordinary conjecture. OpenMath has not built it; source-reported completion does not replace independent mathematical review.","ai_status":"OpenAI reports GPT-5.6 Sol Ultra discovery and formal work. Shiva Kintali’s Codex-assisted manuscript is a separate contribution.","independent_review":"pending"},"schema_version":"research-record-v3","claims":[{"statement":"For every finite loopless undirected multigraph G with no bridges, there exists a multiset C of cycles in G such that every edge of G belongs to exactly two members of C, counted with multiplicity.","id":"claim-cycle-double-cover-existence","slug":"cycle-double-cover-existence","version":1,"kind":"conjecture","title":"Every bridgeless graph has a cycle double cover","assumptions":["Finite undirected multigraph.","No loops and no bridges.","Parallel edges and repeated cycles in the cover are allowed."],"scope":"Universal existence. The cited 2026 proof and formal endpoint are reported by their sources; independent mathematical assessment is pending.","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1","cycle-double-cover:entry:separate:v1"],"formal_declarations":["CDCLean.cycleDoubleCover_of_bridgeless"]},{"statement":"If C is a cycle double cover of a finite graph G, then the sum of the lengths of the cycles in C, with multiplicity, equals 2|E(G)|.","id":"claim-cycle-double-cover-total-length","slug":"cycle-double-cover-total-length","version":1,"kind":"theorem","title":"A double cover has total length twice the edge count","assumptions":["Assume a cycle double cover is given.","Cycle length counts edges and repeated cycles count repeatedly."],"scope":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","source_entry_ids":["cycle-double-cover:entry:proof:v1"],"formal_declarations":[]}],"problem":{"resolution_scope":{"resolution":"unresolved","extent":"general_case","summary":"A full proof and an unconditional Lean endpoint are reported in the selected 2026 sources. OpenMath presents them as a proposed resolution pending independent mathematical assessment.","report_ids":["cycle-double-cover:report:proposal:v1"],"progress_claim_ids":[],"remaining":"Assess the new universal proof, its graph definitions and the theorem-to-source correspondence; stronger variants need separate evidence."},"statement_kind":"conjecture","problem_id":"problem-cycle-double-cover","slug":"cycle-double-cover","title":"Cycle double cover conjecture","question":"Does every finite bridgeless loopless multigraph admit a collection of cycles that covers each edge exactly twice?","scope":"Undirected finite multigraphs: parallel edges are allowed, loops are excluded, and a bridge is an edge whose deletion increases the number of connected components. The cover is a multiset of cycles; the same cycle may occur twice. Two parallel edges may form a cycle.","aliases":["CDC conjecture","Cycle double cover problem"],"fields":["Combinatorics"],"msc":["05C38","05C21"],"topics":[],"background":"graduate","scale":"major conjecture","depth":"maintained","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1","cycle-double-cover:entry:separate:v1"],"status_report_ids":["cycle-double-cover:report:proposal:v1"],"editorial":{"collection_id":"openmath-pilot","collection_title":"OpenMath pilot collection","reviewer":"OpenMath source curation","state":"under_assessment","scope":"Source comparison and page curation only; independent mathematical review is pending.","rationale":"A full proof and an unconditional Lean endpoint are reported in the selected 2026 sources. OpenMath presents them as a proposed resolution pending independent mathematical assessment.","decided_on":"2026-10-13","review_due_on":"2027-01-13","report_ids":["cycle-double-cover:report:proposal:v1"],"independent_mathematical_review":"pending"},"literature":[{"title":"A proof of the cycle double cover conjecture","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","note":"Main theorem and flow-to-cover construction"},{"title":"Cycle double cover in Lean","url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","note":"CDCLean/Main.lean; README verification and exact endpoint"},{"title":"An independent proof of the Cycle Double Cover Conjecture","url":"https://arxiv.org/abs/2607.14140v1","note":"Abstract and theorem statement"}],"formalizations":[{"title":"Lean: the full bridgeless multigraph statement","url":"https://github.com/openai/cdc-lean/blob/577e9d9ea326d520f80672ee69b830bf1d513df5/CDCLean/Main.lean","note":"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.","target":{"id":"claim-cycle-double-cover-existence","version":1},"proof_status":"reported_complete","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1","cycle-double-cover:entry:separate:v1"],"declaration":"CDCLean.cycleDoubleCover_of_bridgeless","source_commit":"577e9d9ea326d520f80672ee69b830bf1d513df5","alignment":"staff_linked","checked_on":"2026-10-13"}],"related":[],"tasks":[],"insights":[{"id":"cycle-double-cover-approach","title":"From nowhere-zero flows to cycle covers","summary":"The formal source constructs a flow on a cubic expansion, projects an even cover back to the original graph, and decomposes it into cycles.","review":"pending","kind":"approach","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1"],"claims":[{"id":"claim-cycle-double-cover-existence","version":1}],"limitation":"The exact bridge, loop and multiplicity conventions must match before transferring the conclusion."},{"id":"cycle-double-cover-impact","title":"Multiplicity two gives an exact accounting identity","summary":"Any such cover traverses edges with total cycle length 2|E|, making the relationship to cycle coverings concrete.","review":"pending","kind":"impact","source_entry_ids":["cycle-double-cover:entry:proof:v1"],"claims":[{"id":"claim-cycle-double-cover-total-length","version":1}],"scenario":{"id":"claim-cycle-double-cover-existence","version":1},"limitation":"This counting consequence assumes the cover exists and supplies no universal existence proof."},{"id":"cycle-double-cover-scope","title":"Stronger covering questions need their own statements","summary":"The ordinary statement imposes no fixed small number of even subgraphs or coloring constraints. A reported proof does not automatically resolve stronger covering or coloring conjectures.","review":"pending","kind":"interpretation","source_entry_ids":["cycle-double-cover:entry:proof:v1","cycle-double-cover:entry:lean:v1"],"claims":[{"id":"claim-cycle-double-cover-existence","version":1}],"limitation":"No stronger five-cover or coloring result is assessed by this page."}],"coverage_gaps":["Independent mathematical review and local execution of the cited formal proofs are pending."],"checked_on":"2026-10-13"},"sources":[{"work":{"authors":["OpenAI"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"OpenAI reports a GPT-5.6 Sol Ultra multi-agent discovery workflow. This provenance is first-party and is not independent mathematical review.","artifacts":[],"published":{"value":"2026-07-10"}},"id":"cycle-double-cover:source:proof:v1","source_id":"cycle-double-cover-proof","title":"A proof of the cycle double cover conjecture","owner":"OpenAI","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","subject_scope":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","revision":"2026-07-10","content_sha256":"b4797f5053d9067329b3dcfcbf913f8bb40d13467453b1300f6d78d08460fc13","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-07-10","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","attribution":"OpenAI","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90},{"work":{"authors":["OpenAI","openai/cdc-lean project"],"kind":"research_project","publication":"project","publication_note":"Public formal source; build and independent mathematical review are separate checks.","ai_role":"self_reported","ai_note":"This formal source accompanies the OpenAI AI-assisted proof report; formal checking and human exposition are separate evidence roles.","artifacts":[{"kind":"formal_code","title":"Cycle double cover in Lean — pinned source","url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","version":"577e9d9ea326d520f80672ee69b830bf1d513df5","assessment":"not_executed","note":"Public source inspected for statement and assumptions; this proof project has not been executed by OpenMath."}],"published":{"value":"2026-07-09"}},"id":"cycle-double-cover:source:lean:v1","source_id":"cycle-double-cover-lean","title":"Cycle double cover in Lean","owner":"OpenAI, openai/cdc-lean project","url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","subject_scope":"The source endpoint covers finite loopless bridgeless multigraphs via a formalized eight-flow theorem and a conversion to cycle covers.","revision":"577e9d9ea326d520f80672ee69b830bf1d513df5","content_sha256":"ffe1a481bcfa67c49b25830a67cb338a6c7fdda3eb29e4dcffcd63e795f0c963","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-07-09","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","attribution":"OpenAI, openai/cdc-lean project","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90},{"work":{"authors":["Shiva Kintali"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"Shiva Kintali reports work with Codex; this is a distinct manuscript and has not been adjudicated by OpenMath.","artifacts":[],"published":{"value":"2026-07"}},"id":"cycle-double-cover:source:separate:v1","source_id":"cycle-double-cover-separate","title":"An independent proof of the Cycle Double Cover Conjecture","owner":"Shiva Kintali","url":"https://arxiv.org/abs/2607.14140v1","subject_scope":"A separately authored manuscript reports a proof of cycle double cover using an AI-assisted workflow.","revision":"2026-07","content_sha256":null,"update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/2607.14140v1","attribution":"Shiva Kintali","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"cycle-double-cover:entry:proof:v1","source_version_id":"cycle-double-cover:source:proof:v1","item_id":"proof","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","wording":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","wording_kind":"paraphrase","locator":"Main theorem and flow-to-cover construction","supersedes":null},{"id":"cycle-double-cover:entry:lean:v1","source_version_id":"cycle-double-cover:source:lean:v1","item_id":"lean","url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","wording":"The source endpoint covers finite loopless bridgeless multigraphs via a formalized eight-flow theorem and a conversion to cycle covers.","wording_kind":"paraphrase","locator":"CDCLean/Main.lean; README verification and exact endpoint","supersedes":null},{"id":"cycle-double-cover:entry:separate:v1","source_version_id":"cycle-double-cover:source:separate:v1","item_id":"separate","url":"https://arxiv.org/abs/2607.14140v1","wording":"A separately authored manuscript reports a proof of cycle double cover using an AI-assisted workflow.","wording_kind":"paraphrase","locator":"Abstract and theorem statement","supersedes":null}],"reports":[{"id":"cycle-double-cover:report:proposal:v1","entry_id":"cycle-double-cover:entry:proof:v1","state":"proposed_solution","source_label":"Full cycle double cover proof reported","scope":"Universal finite loopless bridgeless multigraph formulation.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","supersedes":null},{"id":"cycle-double-cover:report:formal:v1","entry_id":"cycle-double-cover:entry:lean:v1","state":"proposed_solution","source_label":"Unconditional Lean endpoint reported complete","scope":"CDCLean.cycleDoubleCover_of_bridgeless, with no additional project axioms reported.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://github.com/openai/cdc-lean/tree/577e9d9ea326d520f80672ee69b830bf1d513df5","supersedes":null},{"id":"cycle-double-cover:report:separate:v1","entry_id":"cycle-double-cover:entry:separate:v1","state":"proposed_solution","source_label":"Separately authored proof manuscript","scope":"The same universal cycle double cover question.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/2607.14140v1","supersedes":null},{"id":"cycle-double-cover:report:cover-accounting:v1","entry_id":"cycle-double-cover:entry:proof:v1","state":"resolved","source_label":"Edge multiplicity identity for a double cover","scope":"Counting the total length of any double cover, independently of universal existence.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","supersedes":null}]},"status":{"state":"proposed","label":"Solution proposed · under assessment","extent":"general_case","summary":"A full proof and an unconditional Lean endpoint are reported in the selected 2026 sources. OpenMath presents them as a proposed resolution pending independent mathematical assessment.","basis":"editorial","attributed_to":"OpenMath pilot collection · OpenMath source curation","as_of":"2026-10-13","progress_label":null,"progress_claim_ids":[],"remaining":"Assess the new universal proof, its graph definitions and the theorem-to-source correspondence; stronger variants need separate evidence.","views":["uncertain"]}},"selected_context":{"assessment_history":[{"report_id":"cycle-double-cover:report:cover-accounting:v1","source_id":"cycle-double-cover-proof","source_version_id":"cycle-double-cover:source:proof:v1","source_title":"A proof of the cycle double cover conjecture","source_label":"Edge multiplicity identity for a double cover","state":"resolved","scope":"Counting the total length of any double cover, independently of universal existence.","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","entry_id":"cycle-double-cover:entry:proof:v1"}],"problem_id":"problem-cycle-double-cover","slug":"cycle-double-cover","title":"Cycle double cover conjecture","publication_version":1,"relationship":{"claim":{"id":"claim-cycle-double-cover-total-length","version":1},"relation":"supporting_result","relationship_note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","result":"proved","report_ids":["cycle-double-cover:report:cover-accounting:v1"],"independent_review":"pending","reading":{"placement":"background","note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one."}},"assessments":[{"report_id":"cycle-double-cover:report:cover-accounting:v1","source_id":"cycle-double-cover-proof","source_version_id":"cycle-double-cover:source:proof:v1","source_title":"A proof of the cycle double cover conjecture","source_label":"Edge multiplicity identity for a double cover","state":"resolved","scope":"Counting the total length of any double cover, independently of universal existence.","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","entry_id":"cycle-double-cover:entry:proof:v1"}],"connections":[],"related_claims":[],"progress":[],"tasks":[],"statements":[{"statement":"If C is a cycle double cover of a finite graph G, then the sum of the lengths of the cycles in C, with multiplicity, equals 2|E(G)|.","id":"claim-cycle-double-cover-total-length","slug":"cycle-double-cover-total-length","version":1,"kind":"theorem","title":"A double cover has total length twice the edge count","assumptions":["Assume a cycle double cover is given.","Cycle length counts edges and repeated cycles count repeatedly."],"scope":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","source_entry_ids":["cycle-double-cover:entry:proof:v1"],"formal_declarations":[],"relation":"supporting_result","relationship_note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one.","result":"proved","report_ids":["cycle-double-cover:report:cover-accounting:v1"],"independent_review":"pending","reading":{"placement":"background","note":"A counting consequence of a cover, not a proof that every bridgeless graph admits one."}}],"entries":[{"id":"cycle-double-cover:entry:proof:v1","source_version_id":"cycle-double-cover:source:proof:v1","item_id":"proof","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","wording":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","wording_kind":"paraphrase","locator":"Main theorem and flow-to-cover construction","supersedes":null}],"sources":[{"work":{"authors":["OpenAI"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"OpenAI reports a GPT-5.6 Sol Ultra multi-agent discovery workflow. This provenance is first-party and is not independent mathematical review.","artifacts":[],"published":{"value":"2026-07-10"}},"id":"cycle-double-cover:source:proof:v1","source_id":"cycle-double-cover-proof","title":"A proof of the cycle double cover conjecture","owner":"OpenAI","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","subject_scope":"A new argument is reported to construct a cycle double cover for every finite loopless bridgeless multigraph.","revision":"2026-07-10","content_sha256":"b4797f5053d9067329b3dcfcbf913f8bb40d13467453b1300f6d78d08460fc13","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-07-10","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","attribution":"OpenAI","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}]}}}