{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UCNVP5AGXO3IPPMT5PNYOLUWDP","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":"8a0ae46a82ee312941e762c60fbf231c01594f32f8275b33db0d28ff54bf6dba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-28T23:33:18Z","title_canon_sha256":"4fa04cc20cb63b7030b23a167f81e4ebef73ad0c1f03a8e61a3aba0658e80356"},"schema_version":"1.0","source":{"id":"1711.10614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10614","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10614v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10614","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"UCNVP5AGXO3I","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UCNVP5AGXO3IPPMT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UCNVP5AG","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0466946715f230d14c373621a79fada74927dae470d7e4d2366561efedada05","target":"graph","created_at":"2026-05-18T00:07:50Z","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":"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$.","authors_text":"Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-28T23:33:18Z","title":"Cycle double covers and non-separating cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10614","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:7912602de0a1689bd7093f920a7cb53d162c550422323ad1899bb8784d4c91f7","target":"record","created_at":"2026-05-18T00:07:50Z","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":"8a0ae46a82ee312941e762c60fbf231c01594f32f8275b33db0d28ff54bf6dba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-28T23:33:18Z","title_canon_sha256":"4fa04cc20cb63b7030b23a167f81e4ebef73ad0c1f03a8e61a3aba0658e80356"},"schema_version":"1.0","source":{"id":"1711.10614","kind":"arxiv","version":2}},"canonical_sha256":"a09b57f406bbb687bd93ebdb872e961bda8e2959ead7e6210720de9031e67330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09b57f406bbb687bd93ebdb872e961bda8e2959ead7e6210720de9031e67330","first_computed_at":"2026-05-18T00:07:50.343812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.343812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkNMMn/CM74LBPj3RQup2Di+ZkC1XUyeqcWAh5qKjiJZGWVTbWybFGd8wFEdpZ7giTSVNHSVe3bWQFowBQRkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.344481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7912602de0a1689bd7093f920a7cb53d162c550422323ad1899bb8784d4c91f7","sha256:d0466946715f230d14c373621a79fada74927dae470d7e4d2366561efedada05"],"state_sha256":"37b5454bbb1c099b37e91221dfc9b0869c989b4cc1d5213a0888e5995fb645ff"}