{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PPK62V4VHGT23HVDGRBHVMXTHE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"843bf62ec1229ae88c6c8fa08883a23d10e94ab15732f3bf436e533d181241c2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-02T21:47:55Z","title_canon_sha256":"b683ee2d5c06310e4d7d58a76265cd481ab26632e4cffb256411ef2f3a0c6367"},"schema_version":"1.0","source":{"id":"1202.0569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0569","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0569v2","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0569","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"PPK62V4VHGT2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PPK62V4VHGT23HVD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PPK62V4V","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:aff4a5908bbf168663432e1a1c15a9156a3b1b3d2c6a52695f879ed08afa1ea3","target":"graph","created_at":"2026-05-18T04:02:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and Seymour (1979). In this paper, we settle the conjecture in the affirmative. In particular, we give an algorithm, which inductively constructs a cycle double cover in polynomial time.","authors_text":"Alexander Souza","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-02T21:47:55Z","title":"A Constructive Proof of the Cycle Double Cover Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0569","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:721cddaf74f28f29386023a7cb85ef7740df52a29706989314f31b1559f9f6d8","target":"record","created_at":"2026-05-18T04:02:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"843bf62ec1229ae88c6c8fa08883a23d10e94ab15732f3bf436e533d181241c2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-02T21:47:55Z","title_canon_sha256":"b683ee2d5c06310e4d7d58a76265cd481ab26632e4cffb256411ef2f3a0c6367"},"schema_version":"1.0","source":{"id":"1202.0569","kind":"arxiv","version":2}},"canonical_sha256":"7bd5ed579539a7ad9ea334427ab2f3392135742ca712a19c54e15f5f4d5d2abb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bd5ed579539a7ad9ea334427ab2f3392135742ca712a19c54e15f5f4d5d2abb","first_computed_at":"2026-05-18T04:02:53.918027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:53.918027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bqREutjrnENlB5+m4iDrzaONCMRqBU/uiHz6gjtZHWXjGaSYA9aUE2hCuhUI9/exF2yzTYKQ2wUfBw6mzvhhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:53.918926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:721cddaf74f28f29386023a7cb85ef7740df52a29706989314f31b1559f9f6d8","sha256:aff4a5908bbf168663432e1a1c15a9156a3b1b3d2c6a52695f879ed08afa1ea3"],"state_sha256":"ddda5672d865a425c47eb8acc2c1bed587d36df9955c42920e7dd56febbb2358"}