{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C3KPWME3537TS4GM5T6YAYU2P2","short_pith_number":"pith:C3KPWME3","schema_version":"1.0","canonical_sha256":"16d4fb309beeff3970ccecfd80629a7e9195f5cc0c5ba2d98f05120c7617ad93","source":{"kind":"arxiv","id":"1209.0096","version":1},"attestation_state":"computed","paper":{"title":"A note on 5-cycle double covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof","submitted_at":"2012-09-01T14:32:39Z","abstract_excerpt":"The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$, there is a cycle double cover of $G$ which contains $C$. We conjecture that there is even a 5-cycle double cover $S$ of $G$ which contains $C$, i.e. $C$ is a subgraph of one of the five 2-regular subgraphs of $S$. We prove a necessary and sufficient condition for a 2-regular subgraph to be contained in a 5-cycle double cover of $G$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.0096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-01T14:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"5fad428d6b2fb8efed05503f36c3823c13ac2ab7c98607313f43d3310faa93ac","abstract_canon_sha256":"86407e7a1478171435b4393ef59cc6867b19d15cb756db2a40a11d815243295f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:12.260789Z","signature_b64":"d/HdsU7a4qPKCRiXwjbwjx9YIzHbMTt4l6kf4K2KW1W3e9NAPxGT9Q0drabKlzGAm6wuehodlJ5SDz6fmmxkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d4fb309beeff3970ccecfd80629a7e9195f5cc0c5ba2d98f05120c7617ad93","last_reissued_at":"2026-05-18T03:41:12.260118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:12.260118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on 5-cycle double covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof","submitted_at":"2012-09-01T14:32:39Z","abstract_excerpt":"The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$, there is a cycle double cover of $G$ which contains $C$. We conjecture that there is even a 5-cycle double cover $S$ of $G$ which contains $C$, i.e. $C$ is a subgraph of one of the five 2-regular subgraphs of $S$. We prove a necessary and sufficient condition for a 2-regular subgraph to be contained in a 5-cycle double cover of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0096","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.0096","created_at":"2026-05-18T03:41:12.260223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0096v1","created_at":"2026-05-18T03:41:12.260223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0096","created_at":"2026-05-18T03:41:12.260223+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3KPWME3537T","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3KPWME3537TS4GM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3KPWME3","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2","json":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2.json","graph_json":"https://pith.science/api/pith-number/C3KPWME3537TS4GM5T6YAYU2P2/graph.json","events_json":"https://pith.science/api/pith-number/C3KPWME3537TS4GM5T6YAYU2P2/events.json","paper":"https://pith.science/paper/C3KPWME3"},"agent_actions":{"view_html":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2","download_json":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2.json","view_paper":"https://pith.science/paper/C3KPWME3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0096&json=true","fetch_graph":"https://pith.science/api/pith-number/C3KPWME3537TS4GM5T6YAYU2P2/graph.json","fetch_events":"https://pith.science/api/pith-number/C3KPWME3537TS4GM5T6YAYU2P2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2/action/storage_attestation","attest_author":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2/action/author_attestation","sign_citation":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2/action/citation_signature","submit_replication":"https://pith.science/pith/C3KPWME3537TS4GM5T6YAYU2P2/action/replication_record"}},"created_at":"2026-05-18T03:41:12.260223+00:00","updated_at":"2026-05-18T03:41:12.260223+00:00"}