{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MCFD6CUAVFYJQ45HHIDDCO2R7J","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":"1b3ed4fca913e89ccc95b13b7618039b77e9ffceaa8359c21b9f1a3e2b40017a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-24T23:18:37Z","title_canon_sha256":"ecb8a1ef77dabfe18824b7ad890b505986da98375ab6c7ba156aba5bb49f4e9b"},"schema_version":"1.0","source":{"id":"1403.6188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6188","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6188v2","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6188","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"MCFD6CUAVFYJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MCFD6CUAVFYJQ45H","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MCFD6CUA","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:f51c23dfd87af61447c3f79f686885c71abd5f92690c0315089e50ae426bd61c","target":"graph","created_at":"2026-05-18T02:51:49Z","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":"In this short paper, we present an improved algorithm for approximating the minimum cut on distributed (CONGEST) networks. Let $\\lambda$ be the minimum cut. Our algorithm can compute $\\lambda$ exactly in $\\tilde{O}((\\sqrt{n}+D)\\poly(\\lambda))$ time, where $n$ is the number of nodes (processors) in the network, $D$ is the network diameter, and $\\tilde{O}$ hides $\\poly\\log n$. By a standard reduction, we can convert this algorithm into a $(1+\\epsilon)$-approximation $\\tilde{O}((\\sqrt{n}+D)/\\poly(\\epsilon))$-time algorithm. The latter result improves over the previous $(2+\\epsilon)$-approximation","authors_text":"Danupon Nanongkai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-24T23:18:37Z","title":"Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6188","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:ed8011a805761dc987755e860eb9a3b18f1ffeacd0c919cb4dc7384eca4d9ea0","target":"record","created_at":"2026-05-18T02:51:49Z","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":"1b3ed4fca913e89ccc95b13b7618039b77e9ffceaa8359c21b9f1a3e2b40017a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-24T23:18:37Z","title_canon_sha256":"ecb8a1ef77dabfe18824b7ad890b505986da98375ab6c7ba156aba5bb49f4e9b"},"schema_version":"1.0","source":{"id":"1403.6188","kind":"arxiv","version":2}},"canonical_sha256":"608a3f0a80a9709873a73a06313b51fa4585a233d9a20bf783585ac72c59dcc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"608a3f0a80a9709873a73a06313b51fa4585a233d9a20bf783585ac72c59dcc8","first_computed_at":"2026-05-18T02:51:49.425456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:49.425456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFshDTHUtfkNU2Gp80dt2dXMpMWxJTKEDqIP3UdskJgTo4kS9/b9mmealpgdGQukbxR/l7ZSRSHZn2OyuNwoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:49.425909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed8011a805761dc987755e860eb9a3b18f1ffeacd0c919cb4dc7384eca4d9ea0","sha256:f51c23dfd87af61447c3f79f686885c71abd5f92690c0315089e50ae426bd61c"],"state_sha256":"bcb1827ed22c2f4f8d6443664e788e46b693a492cee0a7a7739253223bae7fe5"}