{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMNMABORAUVJZUHEHZQIDNWTPS","short_pith_number":"pith:VMNMABOR","schema_version":"1.0","canonical_sha256":"ab1ac005d1052a9cd0e43e6081b6d37cb463bd2013b968ccc0dc0a41b1739f62","source":{"kind":"arxiv","id":"1401.5316","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Minimum Cut Approximation Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hsin-Hao Su","submitted_at":"2014-01-21T13:39:38Z","abstract_excerpt":"In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the context of centralized algorithms. However, there were no known non-trivial algorithms in the distributed model until the recent work of Ghaffari and Kuhn. They gave algorithms for finding cuts of size $O(\\epsilon^{-1}\\lambda)$ and $(2+\\epsilon)\\lambda$ in $O(D)+\\tilde{O}(n^{1/2+\\epsilon})$ rounds and $\\tilde{O}(D+\\sqrt{n})$ rounds respectively, where $\\lambda$ is the size of the minimum cut. This matches the lower "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.5316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-21T13:39:38Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f8b495475eebd470fd86522e978dc09e2e9d3ec5185aeef98d1addabf69f21d","abstract_canon_sha256":"101ee08017f31ee959c7465b36ca79afd9ec48a93d3fb694ba7e797e488c624c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.181202Z","signature_b64":"lGiGFpDYquHPlkL6BDuSLoDRXu68jf/zmfM8jUpgJUgN0cktuP0yQLCMYif5YxAcndR4VvTFkoCoIbQwF2RXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab1ac005d1052a9cd0e43e6081b6d37cb463bd2013b968ccc0dc0a41b1739f62","last_reissued_at":"2026-05-18T03:01:34.180408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.180408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Minimum Cut Approximation Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hsin-Hao Su","submitted_at":"2014-01-21T13:39:38Z","abstract_excerpt":"In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the context of centralized algorithms. However, there were no known non-trivial algorithms in the distributed model until the recent work of Ghaffari and Kuhn. They gave algorithms for finding cuts of size $O(\\epsilon^{-1}\\lambda)$ and $(2+\\epsilon)\\lambda$ in $O(D)+\\tilde{O}(n^{1/2+\\epsilon})$ rounds and $\\tilde{O}(D+\\sqrt{n})$ rounds respectively, where $\\lambda$ is the size of the minimum cut. This matches the lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5316","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.5316","created_at":"2026-05-18T03:01:34.180534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5316v1","created_at":"2026-05-18T03:01:34.180534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5316","created_at":"2026-05-18T03:01:34.180534+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMNMABORAUVJ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMNMABORAUVJZUHE","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMNMABOR","created_at":"2026-05-18T12:28:54.890064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS","json":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS.json","graph_json":"https://pith.science/api/pith-number/VMNMABORAUVJZUHEHZQIDNWTPS/graph.json","events_json":"https://pith.science/api/pith-number/VMNMABORAUVJZUHEHZQIDNWTPS/events.json","paper":"https://pith.science/paper/VMNMABOR"},"agent_actions":{"view_html":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS","download_json":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS.json","view_paper":"https://pith.science/paper/VMNMABOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5316&json=true","fetch_graph":"https://pith.science/api/pith-number/VMNMABORAUVJZUHEHZQIDNWTPS/graph.json","fetch_events":"https://pith.science/api/pith-number/VMNMABORAUVJZUHEHZQIDNWTPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS/action/storage_attestation","attest_author":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS/action/author_attestation","sign_citation":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS/action/citation_signature","submit_replication":"https://pith.science/pith/VMNMABORAUVJZUHEHZQIDNWTPS/action/replication_record"}},"created_at":"2026-05-18T03:01:34.180534+00:00","updated_at":"2026-05-18T03:01:34.180534+00:00"}