{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ECZL2FU5NGB7HC3LSPTIJGPHHX","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":"e654d67d39b5200a9c08b365031de2223ce90e83e8cfd6985ff883ab3fb029ee","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-23T19:13:15Z","title_canon_sha256":"5831f9c15e9dff06ceb41cbfb65fb9fb0f4002e7ad0cda569f785453e150f5ee"},"schema_version":"1.0","source":{"id":"1305.5520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5520","created_at":"2026-05-18T03:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5520v2","created_at":"2026-05-18T03:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5520","created_at":"2026-05-18T03:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"ECZL2FU5NGB7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ECZL2FU5NGB7HC3L","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ECZL2FU5","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:e2aa3ea00b74a1c540252248737c7684b673c91e5f028727b7ad6c78e6beb9fd","target":"graph","created_at":"2026-05-18T03:06:35Z","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":"We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, $O(\\log n)$ bits can be transmitted over each edge (a.k.a. the CONGEST model). We present a distributed algorithm that, for any weighted graph and any $\\epsilon \\in (0, 1)$, with high probability finds a cut of size at most $O(\\epsilon^{-1}\\lambda)$ in $O(D) + \\tilde{O}(n^{1/2 + \\epsilon})$ rounds, where $\\lambda$ is the size of the minimum cut. This algorithm is based on a simple approach for analyzing random edge sampling, which w","authors_text":"Fabian Kuhn, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-23T19:13:15Z","title":"Distributed Minimum Cut Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5520","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:1cb6f69199bb15c4142d7c1844ca0556271bf24d5f9ee729828d9a1fea81e061","target":"record","created_at":"2026-05-18T03:06:35Z","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":"e654d67d39b5200a9c08b365031de2223ce90e83e8cfd6985ff883ab3fb029ee","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-23T19:13:15Z","title_canon_sha256":"5831f9c15e9dff06ceb41cbfb65fb9fb0f4002e7ad0cda569f785453e150f5ee"},"schema_version":"1.0","source":{"id":"1305.5520","kind":"arxiv","version":2}},"canonical_sha256":"20b2bd169d6983f38b6b93e68499e73dd297f12bcfd14431c47d869ee9d3beb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20b2bd169d6983f38b6b93e68499e73dd297f12bcfd14431c47d869ee9d3beb8","first_computed_at":"2026-05-18T03:06:35.177215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:35.177215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PwDHI5vrfYPc+68tGEKv4atXrUvaJhB7Zs19d5AISNqZLKCTHEz8/ihltbdUixMKxnR7cGrk47MHBUWxA6iWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:35.177834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cb6f69199bb15c4142d7c1844ca0556271bf24d5f9ee729828d9a1fea81e061","sha256:e2aa3ea00b74a1c540252248737c7684b673c91e5f028727b7ad6c78e6beb9fd"],"state_sha256":"6d93356981e7aad59de5d6567319102e52a3631d9fabea51997374db21f78db5"}