{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JWGKUZTMG7JQ6BKXBC2HHGRATD","short_pith_number":"pith:JWGKUZTM","canonical_record":{"source":{"id":"1405.6929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T14:35:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"67d77fc4e3abc937608f97948e3c2d56c5696a139882925f231e0d1b88ef5e0c","abstract_canon_sha256":"72fe926dde288540e22c434f4d6596f80c60563a80ad5bd1d165e0953fe97760"},"schema_version":"1.0"},"canonical_sha256":"4d8caa666c37d30f055708b4739a2098ed52a92c8cad58ebe375246cd740b2e3","source":{"kind":"arxiv","id":"1405.6929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6929","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6929v2","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6929","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"JWGKUZTMG7JQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWGKUZTMG7JQ6BKX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWGKUZTM","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JWGKUZTMG7JQ6BKXBC2HHGRATD","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T14:35:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"67d77fc4e3abc937608f97948e3c2d56c5696a139882925f231e0d1b88ef5e0c","abstract_canon_sha256":"72fe926dde288540e22c434f4d6596f80c60563a80ad5bd1d165e0953fe97760"},"schema_version":"1.0"},"canonical_sha256":"4d8caa666c37d30f055708b4739a2098ed52a92c8cad58ebe375246cd740b2e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:30.747435Z","signature_b64":"SW2woJA8sd3KOkYXlVjLkVqQUgGsV0uvLAwE04ehT0b4VLGIVVwbV+DfAdc/oAAj8yINyWRYczxqLs/JJ+IzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d8caa666c37d30f055708b4739a2098ed52a92c8cad58ebe375246cd740b2e3","last_reissued_at":"2026-05-18T02:32:30.747084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:30.747084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6929","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-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hk6S8efj8uT8Ja96+Rupt68spPh0AhW1KiymsxDwc7ViIFUjBTx7KxENNUJrPg4/YmszaJ3Q8lyonHfoNiUcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:05.785665Z"},"content_sha256":"2878cd506efac308293a1cfc7776e4aaa3c49182bb6f52244801c10a327c5aa4","schema_version":"1.0","event_id":"sha256:2878cd506efac308293a1cfc7776e4aaa3c49182bb6f52244801c10a327c5aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JWGKUZTMG7JQ6BKXBC2HHGRATD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed cycle double covers and cut-obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, Martin Loebl","submitted_at":"2014-05-27T14:35:12Z","abstract_excerpt":"A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstacles to the existence of a directed cycle double cover in a graph are bridges. Jaeger conjectured that bridges are actually the only obstacles. One of the difficulties in proving the Jaeger's conjecture lies in discovering and avoiding obstructions to partial strategies that, if successful, create directed cycle double covers. In this work, we suggest a way to circumvent this difficulty. We formul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6929","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-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtNpLtbN7i1SB2XGKt8ZRdDnBYvWQfD7JVihHDW8UIEgfsSDznLrFZthD2AOzw3lHiVut66BR+e5B3ZYqW5ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:05.786336Z"},"content_sha256":"4105607d2f80d22aa684dc4db344dac8a2877ecf2112958f4d68410b97640142","schema_version":"1.0","event_id":"sha256:4105607d2f80d22aa684dc4db344dac8a2877ecf2112958f4d68410b97640142"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/bundle.json","state_url":"https://pith.science/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/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-27T09:27:05Z","links":{"resolver":"https://pith.science/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD","bundle":"https://pith.science/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/bundle.json","state":"https://pith.science/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWGKUZTMG7JQ6BKXBC2HHGRATD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JWGKUZTMG7JQ6BKXBC2HHGRATD","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":"72fe926dde288540e22c434f4d6596f80c60563a80ad5bd1d165e0953fe97760","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T14:35:12Z","title_canon_sha256":"67d77fc4e3abc937608f97948e3c2d56c5696a139882925f231e0d1b88ef5e0c"},"schema_version":"1.0","source":{"id":"1405.6929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6929","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6929v2","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6929","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"JWGKUZTMG7JQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWGKUZTMG7JQ6BKX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWGKUZTM","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:4105607d2f80d22aa684dc4db344dac8a2877ecf2112958f4d68410b97640142","target":"graph","created_at":"2026-05-18T02:32:30Z","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":"A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstacles to the existence of a directed cycle double cover in a graph are bridges. Jaeger conjectured that bridges are actually the only obstacles. One of the difficulties in proving the Jaeger's conjecture lies in discovering and avoiding obstructions to partial strategies that, if successful, create directed cycle double covers. In this work, we suggest a way to circumvent this difficulty. We formul","authors_text":"Andrea Jim\\'enez, Martin Loebl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T14:35:12Z","title":"Directed cycle double covers and cut-obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6929","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:2878cd506efac308293a1cfc7776e4aaa3c49182bb6f52244801c10a327c5aa4","target":"record","created_at":"2026-05-18T02:32:30Z","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":"72fe926dde288540e22c434f4d6596f80c60563a80ad5bd1d165e0953fe97760","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T14:35:12Z","title_canon_sha256":"67d77fc4e3abc937608f97948e3c2d56c5696a139882925f231e0d1b88ef5e0c"},"schema_version":"1.0","source":{"id":"1405.6929","kind":"arxiv","version":2}},"canonical_sha256":"4d8caa666c37d30f055708b4739a2098ed52a92c8cad58ebe375246cd740b2e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d8caa666c37d30f055708b4739a2098ed52a92c8cad58ebe375246cd740b2e3","first_computed_at":"2026-05-18T02:32:30.747084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:30.747084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SW2woJA8sd3KOkYXlVjLkVqQUgGsV0uvLAwE04ehT0b4VLGIVVwbV+DfAdc/oAAj8yINyWRYczxqLs/JJ+IzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:30.747435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2878cd506efac308293a1cfc7776e4aaa3c49182bb6f52244801c10a327c5aa4","sha256:4105607d2f80d22aa684dc4db344dac8a2877ecf2112958f4d68410b97640142"],"state_sha256":"bfef6adaac6fedce335a09d91a0ba189ea10fee9c94d1b9e6aec320ceddf9fd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUy33708o+na76pFLAKOmjKWyTpZ4DmGbR8ziaY/9HN7G+yMD2XbDr5/VYkGooXh5ngoNWowwVcuKanmViPvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:27:05.789965Z","bundle_sha256":"5c7cf098e2dd27e7254ee40c914cf449a9f66f292b3d53142e0f84e6b5c14261"}}