{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2RL7IVWXQGNZKSOB5N2VQ24GDS","short_pith_number":"pith:2RL7IVWX","canonical_record":{"source":{"id":"1510.02075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-07T19:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"a0f7b1e29e05f44795546f29ebbad3e3d5cc25270171b91f43c60f0b08e85b0a","abstract_canon_sha256":"210ac18055771ab214766f00b03c641c5d1374c66d7d9154529dea566b34a50e"},"schema_version":"1.0"},"canonical_sha256":"d457f456d7819b9549c1eb75586b861cafdce750965dc4ef0f5b66252ce35a73","source":{"kind":"arxiv","id":"1510.02075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02075","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02075v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02075","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"2RL7IVWXQGNZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RL7IVWXQGNZKSOB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RL7IVWX","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2RL7IVWXQGNZKSOB5N2VQ24GDS","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-07T19:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"a0f7b1e29e05f44795546f29ebbad3e3d5cc25270171b91f43c60f0b08e85b0a","abstract_canon_sha256":"210ac18055771ab214766f00b03c641c5d1374c66d7d9154529dea566b34a50e"},"schema_version":"1.0"},"canonical_sha256":"d457f456d7819b9549c1eb75586b861cafdce750965dc4ef0f5b66252ce35a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.434240Z","signature_b64":"vgbQ64rUnZVwZOoCRVwCcxHN0btYCxndQ0OWjEfCmEmNy8drf+xsUoab7su3Yvi/DPet7xTP0VQi+EA+eAW7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d457f456d7819b9549c1eb75586b861cafdce750965dc4ef0f5b66252ce35a73","last_reissued_at":"2026-05-18T01:30:42.433594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.433594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02075","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27V/NbekGjNCPZMIwIYqnKBaJqnZn5LoqZL+hJ0IFQ9s1elFF0nzs8PdRiSd9ywCYYSUZSpPwcJ3wvsr4oqnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:03:42.418613Z"},"content_sha256":"ef770333388c4a3f785ca3b5602acdd4276bdecc4ddfd9cd4bcababee5ca2568","schema_version":"1.0","event_id":"sha256:ef770333388c4a3f785ca3b5602acdd4276bdecc4ddfd9cd4bcababee5ca2568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2RL7IVWXQGNZKSOB5N2VQ24GDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A proof of the Cycle Double Cover Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mary Radcliffe","submitted_at":"2015-10-07T19:45:44Z","abstract_excerpt":"Given a bridgeless graph $G$, the Cycle Double Cover Conjecture posits that there is a list of cycles of $G$, such that every edge appears in exactly two cycles on the list. This conjecture was originally posed independently in 1973 by Szekeres and 1979 by Seymour. In 1985, Jaeger demonstrated that it is sufficient to prove in the case that $G$ is a cubic graph. We here present a proof that every bridgeless cubic graph has a cycle double cover by analyzing certain kinds of cycles in the line graph of $G$. Further, in the case that $G$ is cubic, we prove the stronger conjecture that given a bri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02075","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ojw94oESFeFSp04SQOVUX0srvmKC+VbWl7RZ78XU/UQMBq6HRiXhzv1Ieblc2VY6jXUlttcZzb8BJapiIqwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:03:42.418964Z"},"content_sha256":"964d86c3b4a49ea14b0ec83d1a66c745382a7c3d7bd83dc3a49028e84fb21444","schema_version":"1.0","event_id":"sha256:964d86c3b4a49ea14b0ec83d1a66c745382a7c3d7bd83dc3a49028e84fb21444"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/bundle.json","state_url":"https://pith.science/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T12:03:42Z","links":{"resolver":"https://pith.science/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS","bundle":"https://pith.science/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/bundle.json","state":"https://pith.science/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RL7IVWXQGNZKSOB5N2VQ24GDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2RL7IVWXQGNZKSOB5N2VQ24GDS","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":"210ac18055771ab214766f00b03c641c5d1374c66d7d9154529dea566b34a50e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-07T19:45:44Z","title_canon_sha256":"a0f7b1e29e05f44795546f29ebbad3e3d5cc25270171b91f43c60f0b08e85b0a"},"schema_version":"1.0","source":{"id":"1510.02075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02075","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02075v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02075","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"2RL7IVWXQGNZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RL7IVWXQGNZKSOB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RL7IVWX","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:964d86c3b4a49ea14b0ec83d1a66c745382a7c3d7bd83dc3a49028e84fb21444","target":"graph","created_at":"2026-05-18T01:30:42Z","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":"Given a bridgeless graph $G$, the Cycle Double Cover Conjecture posits that there is a list of cycles of $G$, such that every edge appears in exactly two cycles on the list. This conjecture was originally posed independently in 1973 by Szekeres and 1979 by Seymour. In 1985, Jaeger demonstrated that it is sufficient to prove in the case that $G$ is a cubic graph. We here present a proof that every bridgeless cubic graph has a cycle double cover by analyzing certain kinds of cycles in the line graph of $G$. Further, in the case that $G$ is cubic, we prove the stronger conjecture that given a bri","authors_text":"Mary Radcliffe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-07T19:45:44Z","title":"A proof of the Cycle Double Cover Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02075","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:ef770333388c4a3f785ca3b5602acdd4276bdecc4ddfd9cd4bcababee5ca2568","target":"record","created_at":"2026-05-18T01:30:42Z","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":"210ac18055771ab214766f00b03c641c5d1374c66d7d9154529dea566b34a50e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-07T19:45:44Z","title_canon_sha256":"a0f7b1e29e05f44795546f29ebbad3e3d5cc25270171b91f43c60f0b08e85b0a"},"schema_version":"1.0","source":{"id":"1510.02075","kind":"arxiv","version":2}},"canonical_sha256":"d457f456d7819b9549c1eb75586b861cafdce750965dc4ef0f5b66252ce35a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d457f456d7819b9549c1eb75586b861cafdce750965dc4ef0f5b66252ce35a73","first_computed_at":"2026-05-18T01:30:42.433594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:42.433594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vgbQ64rUnZVwZOoCRVwCcxHN0btYCxndQ0OWjEfCmEmNy8drf+xsUoab7su3Yvi/DPet7xTP0VQi+EA+eAW7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:42.434240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef770333388c4a3f785ca3b5602acdd4276bdecc4ddfd9cd4bcababee5ca2568","sha256:964d86c3b4a49ea14b0ec83d1a66c745382a7c3d7bd83dc3a49028e84fb21444"],"state_sha256":"515c6a174f5a948d62c2c191162d96fa917a5704f9c24803d92051ec1e05a054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5vMjW4gRSg4U3SCWk4VXmlQh7jYOiQWipQtIqyVFyfF9e6xBkllUeCioBL55spRWHL05CxFCn5khLfqDayyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:03:42.420943Z","bundle_sha256":"e1424eb34b55aeec2f6581a56ec55bf5555ca6a4076abecd52aac9e23fce2197"}}