{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O7QZ3DXYPFPRYKPEMWFBGRQ5XP","short_pith_number":"pith:O7QZ3DXY","canonical_record":{"source":{"id":"1812.04492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-09T13:04:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9f87753e3512afdb230b12877bfe9cbd919eabf8a1a771381d078a801ad20c70","abstract_canon_sha256":"9a27f640d402569d112cc21242fc6beee81e64391d5e0dda93cc82583e7a2c22"},"schema_version":"1.0"},"canonical_sha256":"77e19d8ef8795f1c29e4658a13461dbbd0381632581dfc04c28f20890f29282f","source":{"kind":"arxiv","id":"1812.04492","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04492","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04492v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04492","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"O7QZ3DXYPFPR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7QZ3DXYPFPRYKPE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7QZ3DXY","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O7QZ3DXYPFPRYKPEMWFBGRQ5XP","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-09T13:04:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9f87753e3512afdb230b12877bfe9cbd919eabf8a1a771381d078a801ad20c70","abstract_canon_sha256":"9a27f640d402569d112cc21242fc6beee81e64391d5e0dda93cc82583e7a2c22"},"schema_version":"1.0"},"canonical_sha256":"77e19d8ef8795f1c29e4658a13461dbbd0381632581dfc04c28f20890f29282f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.588372Z","signature_b64":"Fo8z6XqCcQ5492IDqrhJZ6Alc5f7RrVm5Q3ontm+5syGgDtCOqUFc9nZjJNXC7I1dM6bYlvboUyFodbZM5vAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e19d8ef8795f1c29e4658a13461dbbd0381632581dfc04c28f20890f29282f","last_reissued_at":"2026-05-17T23:57:30.587662Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.587662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04492","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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BhplS5Ylsy00bn0zkxqfNdvVZPyWVsBS2rX/mIIEWUGF2mg4elSa50X1BTfwo5iCARwse1wtjAS1GbHl4y2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:33:31.036493Z"},"content_sha256":"454a57bf063a8bad3595a680a176871986411e76284397fd3ceea142817caefd","schema_version":"1.0","event_id":"sha256:454a57bf063a8bad3595a680a176871986411e76284397fd3ceea142817caefd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O7QZ3DXYPFPRYKPEMWFBGRQ5XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Congestion Cycle Covers and their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Eylon Yogev, Merav Parter","submitted_at":"2018-12-09T13:04:45Z","abstract_excerpt":"A cycle cover of a bridgeless graph $G$ is a collection of simple cycles in $G$ such that each edge $e$ appears on at least one cycle. The common objective in cycle cover computation is to minimize the total lengths of all cycles. Motivated by applications to distributed computation, we introduce the notion of \\emph{low-congestion} cycle covers, in which all cycles in the cycle collection are both \\emph{short} and nearly \\emph{edge-disjoint}. Formally, a $(d,c)$-cycle cover of a graph $G$ is a collection of cycles in $G$ in which each cycle is of length at most $d$ and each edge participates i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04492","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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNqh+NvoAKmOI9T1AjWlnXAHuOZXy/M1BVsQMhqAzD9sIiGDGEKScEwk+4NS9xZv2+fto9/+M3FehrWfxRPgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:33:31.036843Z"},"content_sha256":"acf4fa8cd6613d1a5bc0cc6b3f9a7b3592c3d7690ce7cffff0ad2b2114f38851","schema_version":"1.0","event_id":"sha256:acf4fa8cd6613d1a5bc0cc6b3f9a7b3592c3d7690ce7cffff0ad2b2114f38851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/bundle.json","state_url":"https://pith.science/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/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-28T02:33:31Z","links":{"resolver":"https://pith.science/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP","bundle":"https://pith.science/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/bundle.json","state":"https://pith.science/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7QZ3DXYPFPRYKPEMWFBGRQ5XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O7QZ3DXYPFPRYKPEMWFBGRQ5XP","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":"9a27f640d402569d112cc21242fc6beee81e64391d5e0dda93cc82583e7a2c22","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-09T13:04:45Z","title_canon_sha256":"9f87753e3512afdb230b12877bfe9cbd919eabf8a1a771381d078a801ad20c70"},"schema_version":"1.0","source":{"id":"1812.04492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04492","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04492v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04492","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"O7QZ3DXYPFPR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7QZ3DXYPFPRYKPE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7QZ3DXY","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:acf4fa8cd6613d1a5bc0cc6b3f9a7b3592c3d7690ce7cffff0ad2b2114f38851","target":"graph","created_at":"2026-05-17T23:57: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 cycle cover of a bridgeless graph $G$ is a collection of simple cycles in $G$ such that each edge $e$ appears on at least one cycle. The common objective in cycle cover computation is to minimize the total lengths of all cycles. Motivated by applications to distributed computation, we introduce the notion of \\emph{low-congestion} cycle covers, in which all cycles in the cycle collection are both \\emph{short} and nearly \\emph{edge-disjoint}. Formally, a $(d,c)$-cycle cover of a graph $G$ is a collection of cycles in $G$ in which each cycle is of length at most $d$ and each edge participates i","authors_text":"Eylon Yogev, Merav Parter","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-09T13:04:45Z","title":"Low Congestion Cycle Covers and their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04492","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:454a57bf063a8bad3595a680a176871986411e76284397fd3ceea142817caefd","target":"record","created_at":"2026-05-17T23:57: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":"9a27f640d402569d112cc21242fc6beee81e64391d5e0dda93cc82583e7a2c22","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-09T13:04:45Z","title_canon_sha256":"9f87753e3512afdb230b12877bfe9cbd919eabf8a1a771381d078a801ad20c70"},"schema_version":"1.0","source":{"id":"1812.04492","kind":"arxiv","version":2}},"canonical_sha256":"77e19d8ef8795f1c29e4658a13461dbbd0381632581dfc04c28f20890f29282f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77e19d8ef8795f1c29e4658a13461dbbd0381632581dfc04c28f20890f29282f","first_computed_at":"2026-05-17T23:57:30.587662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:30.587662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fo8z6XqCcQ5492IDqrhJZ6Alc5f7RrVm5Q3ontm+5syGgDtCOqUFc9nZjJNXC7I1dM6bYlvboUyFodbZM5vAAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:30.588372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:454a57bf063a8bad3595a680a176871986411e76284397fd3ceea142817caefd","sha256:acf4fa8cd6613d1a5bc0cc6b3f9a7b3592c3d7690ce7cffff0ad2b2114f38851"],"state_sha256":"1f12871f9a86b202528320c41efd4380437e16af07e4b53db3f1adc2fd1fac9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zW2imB+iQioUapmGr0xh/i+EkPUdg2ltgWZV8xGB48HVELklnwCgJ7pp3ABTlqqXNY/MHg/3XrleMcrmBi7UAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:33:31.039633Z","bundle_sha256":"d3dfdfdaf4fa296be8aee507baac9e7d002c9b48c12531813a23de95179c8120"}}