{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MR7X3G7KPWEODKCNWF2C3JZO3E","short_pith_number":"pith:MR7X3G7K","schema_version":"1.0","canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","source":{"kind":"arxiv","id":"1708.06127","version":2},"attestation_state":"computed","paper":{"title":"Practical Minimum Cut Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Noe, Christian Schulz, Darren Strash, Monika Henzinger","submitted_at":"2017-08-21T09:34:13Z","abstract_excerpt":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances sign"},"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":"1708.06127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T09:34:13Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ee1e06aedace3e89de457bf3c80d73d763cafee9c3dce01ee38b4e28aacd6820","abstract_canon_sha256":"d99724dbce0438d13eb5808a047b8b5a67dd840a992b9fa199089b3280b807c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:22.965880Z","signature_b64":"5oIbUn1+ehnHjTW4oTeDahcR0uYOGhusUsU+VyJAULqoze3aeCvZ2OEKJ5aK/MKHD4JcayMQptUrMnxCpHQFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","last_reissued_at":"2026-05-17T23:44:22.965152Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:22.965152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Minimum Cut Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Noe, Christian Schulz, Darren Strash, Monika Henzinger","submitted_at":"2017-08-21T09:34:13Z","abstract_excerpt":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06127","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.06127","created_at":"2026-05-17T23:44:22.965273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06127v2","created_at":"2026-05-17T23:44:22.965273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06127","created_at":"2026-05-17T23:44:22.965273+00:00"},{"alias_kind":"pith_short_12","alias_value":"MR7X3G7KPWEO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MR7X3G7KPWEODKCN","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MR7X3G7K","created_at":"2026-05-18T12:31:31.346846+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/MR7X3G7KPWEODKCNWF2C3JZO3E","json":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E.json","graph_json":"https://pith.science/api/pith-number/MR7X3G7KPWEODKCNWF2C3JZO3E/graph.json","events_json":"https://pith.science/api/pith-number/MR7X3G7KPWEODKCNWF2C3JZO3E/events.json","paper":"https://pith.science/paper/MR7X3G7K"},"agent_actions":{"view_html":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E","download_json":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E.json","view_paper":"https://pith.science/paper/MR7X3G7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06127&json=true","fetch_graph":"https://pith.science/api/pith-number/MR7X3G7KPWEODKCNWF2C3JZO3E/graph.json","fetch_events":"https://pith.science/api/pith-number/MR7X3G7KPWEODKCNWF2C3JZO3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/action/storage_attestation","attest_author":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/action/author_attestation","sign_citation":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/action/citation_signature","submit_replication":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/action/replication_record"}},"created_at":"2026-05-17T23:44:22.965273+00:00","updated_at":"2026-05-17T23:44:22.965273+00:00"}