{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UCNVP5AGXO3IPPMT5PNYOLUWDP","short_pith_number":"pith:UCNVP5AG","schema_version":"1.0","canonical_sha256":"a09b57f406bbb687bd93ebdb872e961bda8e2959ead7e6210720de9031e67330","source":{"kind":"arxiv","id":"1711.10614","version":2},"attestation_state":"computed","paper":{"title":"Cycle double covers and non-separating cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang","submitted_at":"2017-11-28T23:33:18Z","abstract_excerpt":"Which $2$-regular subgraph $R$ of a cubic graph $G$ can be extended to a cycle double cover of $G$? We provide a condition which ensures that every $R$ satisfying this condition is part of a cycle double cover of $G$. As one consequence, we prove that every $2$-connected cubic graph which has a decomposition into a spanning tree and a $2$-regular subgraph $C$ consisting of $k$ circuits with $k\\leq 3$, has a cycle double cover containing $C$."},"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":"1711.10614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-28T23:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"4fa04cc20cb63b7030b23a167f81e4ebef73ad0c1f03a8e61a3aba0658e80356","abstract_canon_sha256":"8a0ae46a82ee312941e762c60fbf231c01594f32f8275b33db0d28ff54bf6dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.344481Z","signature_b64":"XkNMMn/CM74LBPj3RQup2Di+ZkC1XUyeqcWAh5qKjiJZGWVTbWybFGd8wFEdpZ7giTSVNHSVe3bWQFowBQRkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09b57f406bbb687bd93ebdb872e961bda8e2959ead7e6210720de9031e67330","last_reissued_at":"2026-05-18T00:07:50.343812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.343812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle double covers and non-separating cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang","submitted_at":"2017-11-28T23:33:18Z","abstract_excerpt":"Which $2$-regular subgraph $R$ of a cubic graph $G$ can be extended to a cycle double cover of $G$? We provide a condition which ensures that every $R$ satisfying this condition is part of a cycle double cover of $G$. As one consequence, we prove that every $2$-connected cubic graph which has a decomposition into a spanning tree and a $2$-regular subgraph $C$ consisting of $k$ circuits with $k\\leq 3$, has a cycle double cover containing $C$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10614","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.10614","created_at":"2026-05-18T00:07:50.343894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10614v2","created_at":"2026-05-18T00:07:50.343894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10614","created_at":"2026-05-18T00:07:50.343894+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCNVP5AGXO3I","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCNVP5AGXO3IPPMT","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCNVP5AG","created_at":"2026-05-18T12:31:46.661854+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/UCNVP5AGXO3IPPMT5PNYOLUWDP","json":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP.json","graph_json":"https://pith.science/api/pith-number/UCNVP5AGXO3IPPMT5PNYOLUWDP/graph.json","events_json":"https://pith.science/api/pith-number/UCNVP5AGXO3IPPMT5PNYOLUWDP/events.json","paper":"https://pith.science/paper/UCNVP5AG"},"agent_actions":{"view_html":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP","download_json":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP.json","view_paper":"https://pith.science/paper/UCNVP5AG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10614&json=true","fetch_graph":"https://pith.science/api/pith-number/UCNVP5AGXO3IPPMT5PNYOLUWDP/graph.json","fetch_events":"https://pith.science/api/pith-number/UCNVP5AGXO3IPPMT5PNYOLUWDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP/action/storage_attestation","attest_author":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP/action/author_attestation","sign_citation":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP/action/citation_signature","submit_replication":"https://pith.science/pith/UCNVP5AGXO3IPPMT5PNYOLUWDP/action/replication_record"}},"created_at":"2026-05-18T00:07:50.343894+00:00","updated_at":"2026-05-18T00:07:50.343894+00:00"}