{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JJ46T4S7ADUKBI66TD5PM7VDPU","short_pith_number":"pith:JJ46T4S7","canonical_record":{"source":{"id":"1811.08719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"ae5f48e5402378aed8d76d5f0e1b3aa41b2c80afa7f228620b9ce84aaa56109d","abstract_canon_sha256":"b01223461fc108f9ff2da927941224e60cf8de408a1595ccff7d4bd587771847"},"schema_version":"1.0"},"canonical_sha256":"4a79e9f25f00e8a0a3de98faf67ea37d1fb606216a479078d828d58cbddb3689","source":{"kind":"arxiv","id":"1811.08719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08719","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08719v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08719","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"JJ46T4S7ADUK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJ46T4S7ADUKBI66","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJ46T4S7","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JJ46T4S7ADUKBI66TD5PM7VDPU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"ae5f48e5402378aed8d76d5f0e1b3aa41b2c80afa7f228620b9ce84aaa56109d","abstract_canon_sha256":"b01223461fc108f9ff2da927941224e60cf8de408a1595ccff7d4bd587771847"},"schema_version":"1.0"},"canonical_sha256":"4a79e9f25f00e8a0a3de98faf67ea37d1fb606216a479078d828d58cbddb3689","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:11.797450Z","signature_b64":"T5dYf4UsPhdE62WaC8as9mjPdWRsvxGfmQ9B/EF9j5NuID4RE+fVEIRfi5XxGZTbz+qF3CV1Ch4beIxYRKP7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a79e9f25f00e8a0a3de98faf67ea37d1fb606216a479078d828d58cbddb3689","last_reissued_at":"2026-05-18T00:00:11.796788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:11.796788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08719","source_version":1,"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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ioRR3UwuegFqpdngZy/kqxKorIgLQ4qYJGdU/jkGKkE2wFdWrEKhrRsI3d+8adlVWNqFkRVdbyG3m7QmvKfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:08:41.000579Z"},"content_sha256":"887689ba2ffc4cedaa2bad20a3b08d888a555bfe8f0d8f20e2c18a96320bea05","schema_version":"1.0","event_id":"sha256:887689ba2ffc4cedaa2bad20a3b08d888a555bfe8f0d8f20e2c18a96320bea05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JJ46T4S7ADUKBI66TD5PM7VDPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Proof for the Cycle Double Cover Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Alipour, A. Tayebi","submitted_at":"2018-11-20T13:17:56Z","abstract_excerpt":"Given a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we prove the Goddyn's conjecture as a stronger version of the cycle double cover conjecture which states that every cycle in G is a member of some cycle double cover of G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08719","kind":"arxiv","version":1},"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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEnfia5UwcrRXpYdP0U13WinKNCALmXi2awXiLogI40pKw4a2Hs/bmT/LEKWtQbGmqdfN0Ucv3oVhwZeYSE2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:08:41.001393Z"},"content_sha256":"9f66eb50bd6e092cfd0f76fd94e867233b3d51355878b686047b5f7cd41f1662","schema_version":"1.0","event_id":"sha256:9f66eb50bd6e092cfd0f76fd94e867233b3d51355878b686047b5f7cd41f1662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/bundle.json","state_url":"https://pith.science/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/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-05-31T11:08:41Z","links":{"resolver":"https://pith.science/pith/JJ46T4S7ADUKBI66TD5PM7VDPU","bundle":"https://pith.science/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/bundle.json","state":"https://pith.science/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ46T4S7ADUKBI66TD5PM7VDPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JJ46T4S7ADUKBI66TD5PM7VDPU","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":"b01223461fc108f9ff2da927941224e60cf8de408a1595ccff7d4bd587771847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:17:56Z","title_canon_sha256":"ae5f48e5402378aed8d76d5f0e1b3aa41b2c80afa7f228620b9ce84aaa56109d"},"schema_version":"1.0","source":{"id":"1811.08719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08719","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08719v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08719","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"JJ46T4S7ADUK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJ46T4S7ADUKBI66","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJ46T4S7","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:9f66eb50bd6e092cfd0f76fd94e867233b3d51355878b686047b5f7cd41f1662","target":"graph","created_at":"2026-05-18T00:00:11Z","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 well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we prove the Goddyn's conjecture as a stronger version of the cycle double cover conjecture which states that every cycle in G is a member of some cycle double cover of G.","authors_text":"A. Alipour, A. Tayebi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:17:56Z","title":"A Simple Proof for the Cycle Double Cover Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08719","kind":"arxiv","version":1},"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:887689ba2ffc4cedaa2bad20a3b08d888a555bfe8f0d8f20e2c18a96320bea05","target":"record","created_at":"2026-05-18T00:00:11Z","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":"b01223461fc108f9ff2da927941224e60cf8de408a1595ccff7d4bd587771847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:17:56Z","title_canon_sha256":"ae5f48e5402378aed8d76d5f0e1b3aa41b2c80afa7f228620b9ce84aaa56109d"},"schema_version":"1.0","source":{"id":"1811.08719","kind":"arxiv","version":1}},"canonical_sha256":"4a79e9f25f00e8a0a3de98faf67ea37d1fb606216a479078d828d58cbddb3689","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a79e9f25f00e8a0a3de98faf67ea37d1fb606216a479078d828d58cbddb3689","first_computed_at":"2026-05-18T00:00:11.796788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:11.796788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5dYf4UsPhdE62WaC8as9mjPdWRsvxGfmQ9B/EF9j5NuID4RE+fVEIRfi5XxGZTbz+qF3CV1Ch4beIxYRKP7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:11.797450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:887689ba2ffc4cedaa2bad20a3b08d888a555bfe8f0d8f20e2c18a96320bea05","sha256:9f66eb50bd6e092cfd0f76fd94e867233b3d51355878b686047b5f7cd41f1662"],"state_sha256":"e369461a1b59e702afe1c2a5aab04009bf486714c8d6a10c6e4dc3e719772d13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1L+COphbVNM9/K9bntx0Pcd4HtR+5oJNcjM4e36q+E+q2HzpsoimBGroftdZOlGeKuZo3rXCG+VW18IANL6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:08:41.005448Z","bundle_sha256":"0035f37c6b1cf0f7848e828e00c69a706f3beb71481ef185707728d60f66248f"}}