{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KVVULNPAJHG75PXZ7IV422UTJG","short_pith_number":"pith:KVVULNPA","canonical_record":{"source":{"id":"1908.03022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T11:35:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"954ba6cbf197ccfe1f50afa5d5ff0b680038d988c2940bde06e1a3f5640ff382","abstract_canon_sha256":"f3d11bdbe2e26b73f9f0307ee263fa14dbc474731e49ab7e088b08260775ab60"},"schema_version":"1.0"},"canonical_sha256":"556b45b5e049cdfebef9fa2bcd6a9349a5b51a2e8c84418fbb42660d47f5be8b","source":{"kind":"arxiv","id":"1908.03022","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03022","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03022v2","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03022","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_12","alias_value":"KVVULNPAJHG7","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_16","alias_value":"KVVULNPAJHG75PXZ","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_8","alias_value":"KVVULNPA","created_at":"2026-07-05T01:23:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KVVULNPAJHG75PXZ7IV422UTJG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T11:35:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"954ba6cbf197ccfe1f50afa5d5ff0b680038d988c2940bde06e1a3f5640ff382","abstract_canon_sha256":"f3d11bdbe2e26b73f9f0307ee263fa14dbc474731e49ab7e088b08260775ab60"},"schema_version":"1.0"},"canonical_sha256":"556b45b5e049cdfebef9fa2bcd6a9349a5b51a2e8c84418fbb42660d47f5be8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:54.599062Z","signature_b64":"iPHLyudWFA8WlCmy2PvbdQM00iZ18OB4Co2HffM25AIp6aSqYA8YP75+2kDS1hmExr5GgHiH8frbZC2PrXEMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556b45b5e049cdfebef9fa2bcd6a9349a5b51a2e8c84418fbb42660d47f5be8b","last_reissued_at":"2026-07-05T01:23:54.598680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:54.598680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03022","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-07-05T01:23:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGT6PPRKmaZZtpWvbX0zwSZMHXi0vkDf0v9asR9VdHO9omuYNvFUJi/1UhM9us6jWyXyQRL+risnU3fgR1ZsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:26:18.375708Z"},"content_sha256":"d8cb27ed884080f383366dcae38cc811a7fc7f4db1b60fa0541e8688dfbcfc7e","schema_version":"1.0","event_id":"sha256:d8cb27ed884080f383366dcae38cc811a7fc7f4db1b60fa0541e8688dfbcfc7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KVVULNPAJHG75PXZ7IV422UTJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Merav Parter","submitted_at":"2019-08-08T11:35:44Z","abstract_excerpt":"We revisit classical connectivity problems in the CONGEST model of distributed computing. By using techniques from fault tolerant network design, we show improved constructions, some of which are even \"local\" (i.e., with $\\widetilde{O}(1)$ rounds) for problems that are closely related to hard global problems (i.e., with a lower bound of $\\Omega(Diam+\\sqrt{n})$ rounds).\n  Our main results are:\n  (1) For $D$-diameter unweighted graphs with constant edge connectivity, we show an exact distributed deterministic computation of the minimum cut in $poly(D)$ rounds. This resolves one the open problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03022/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:23:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UMnI/vEpaNcfeAbsqJlc/cL5PUjo49F6ZFtMjeevwem4aGJfYLMhnkwOBYq8tj8TJ+OeAeeRpf35jiBDV7jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:26:18.376259Z"},"content_sha256":"bf60ae98a5f80c31da93d980f827b21c153283937b2d34b29fe5654a63475d9b","schema_version":"1.0","event_id":"sha256:bf60ae98a5f80c31da93d980f827b21c153283937b2d34b29fe5654a63475d9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVVULNPAJHG75PXZ7IV422UTJG/bundle.json","state_url":"https://pith.science/pith/KVVULNPAJHG75PXZ7IV422UTJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVVULNPAJHG75PXZ7IV422UTJG/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-08-16T11:26:18Z","links":{"resolver":"https://pith.science/pith/KVVULNPAJHG75PXZ7IV422UTJG","bundle":"https://pith.science/pith/KVVULNPAJHG75PXZ7IV422UTJG/bundle.json","state":"https://pith.science/pith/KVVULNPAJHG75PXZ7IV422UTJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVVULNPAJHG75PXZ7IV422UTJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KVVULNPAJHG75PXZ7IV422UTJG","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":"f3d11bdbe2e26b73f9f0307ee263fa14dbc474731e49ab7e088b08260775ab60","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T11:35:44Z","title_canon_sha256":"954ba6cbf197ccfe1f50afa5d5ff0b680038d988c2940bde06e1a3f5640ff382"},"schema_version":"1.0","source":{"id":"1908.03022","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03022","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03022v2","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03022","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_12","alias_value":"KVVULNPAJHG7","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_16","alias_value":"KVVULNPAJHG75PXZ","created_at":"2026-07-05T01:23:54Z"},{"alias_kind":"pith_short_8","alias_value":"KVVULNPA","created_at":"2026-07-05T01:23:54Z"}],"graph_snapshots":[{"event_id":"sha256:bf60ae98a5f80c31da93d980f827b21c153283937b2d34b29fe5654a63475d9b","target":"graph","created_at":"2026-07-05T01:23:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit classical connectivity problems in the CONGEST model of distributed computing. By using techniques from fault tolerant network design, we show improved constructions, some of which are even \"local\" (i.e., with $\\widetilde{O}(1)$ rounds) for problems that are closely related to hard global problems (i.e., with a lower bound of $\\Omega(Diam+\\sqrt{n})$ rounds).\n  Our main results are:\n  (1) For $D$-diameter unweighted graphs with constant edge connectivity, we show an exact distributed deterministic computation of the minimum cut in $poly(D)$ rounds. This resolves one the open problems","authors_text":"Merav Parter","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03022","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:d8cb27ed884080f383366dcae38cc811a7fc7f4db1b60fa0541e8688dfbcfc7e","target":"record","created_at":"2026-07-05T01:23:54Z","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":"f3d11bdbe2e26b73f9f0307ee263fa14dbc474731e49ab7e088b08260775ab60","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T11:35:44Z","title_canon_sha256":"954ba6cbf197ccfe1f50afa5d5ff0b680038d988c2940bde06e1a3f5640ff382"},"schema_version":"1.0","source":{"id":"1908.03022","kind":"arxiv","version":2}},"canonical_sha256":"556b45b5e049cdfebef9fa2bcd6a9349a5b51a2e8c84418fbb42660d47f5be8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556b45b5e049cdfebef9fa2bcd6a9349a5b51a2e8c84418fbb42660d47f5be8b","first_computed_at":"2026-07-05T01:23:54.598680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:54.598680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPHLyudWFA8WlCmy2PvbdQM00iZ18OB4Co2HffM25AIp6aSqYA8YP75+2kDS1hmExr5GgHiH8frbZC2PrXEMBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:54.599062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03022","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8cb27ed884080f383366dcae38cc811a7fc7f4db1b60fa0541e8688dfbcfc7e","sha256:bf60ae98a5f80c31da93d980f827b21c153283937b2d34b29fe5654a63475d9b"],"state_sha256":"d32c32104643bcbf106c7102d3dbc8ddea09d0a0fd7d8acce34457ef43769cfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Zct51HmEo/3v89kxjRgTZx2UaycxApjmovkzS58YC/cQyQKvozj1crUB5aPiBSEP2ip4yCSf6/ID6zgnpl+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:26:18.379971Z","bundle_sha256":"96aa9979943a1ba34ab7b081e9b98303f92b23fbdfc76144fb2deb2fc0cdc1a0"}}