{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MR7X3G7KPWEODKCNWF2C3JZO3E","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":"d99724dbce0438d13eb5808a047b8b5a67dd840a992b9fa199089b3280b807c3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T09:34:13Z","title_canon_sha256":"ee1e06aedace3e89de457bf3c80d73d763cafee9c3dce01ee38b4e28aacd6820"},"schema_version":"1.0","source":{"id":"1708.06127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06127","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06127v2","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06127","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"MR7X3G7KPWEO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MR7X3G7KPWEODKCN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MR7X3G7K","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:360de37c3d06ca0c0987f4a2ef0a9bc754acba74ccec112d89c034ee348e4f2f","target":"graph","created_at":"2026-05-17T23:44:22Z","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":"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","authors_text":"Alexander Noe, Christian Schulz, Darren Strash, Monika Henzinger","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T09:34:13Z","title":"Practical Minimum Cut Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06127","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:9fd647b660de7e245595b1a45f3433bb580e7eab033f9bb7792c3ed5ccc17021","target":"record","created_at":"2026-05-17T23:44:22Z","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":"d99724dbce0438d13eb5808a047b8b5a67dd840a992b9fa199089b3280b807c3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T09:34:13Z","title_canon_sha256":"ee1e06aedace3e89de457bf3c80d73d763cafee9c3dce01ee38b4e28aacd6820"},"schema_version":"1.0","source":{"id":"1708.06127","kind":"arxiv","version":2}},"canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","first_computed_at":"2026-05-17T23:44:22.965152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:22.965152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5oIbUn1+ehnHjTW4oTeDahcR0uYOGhusUsU+VyJAULqoze3aeCvZ2OEKJ5aK/MKHD4JcayMQptUrMnxCpHQFDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:22.965880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fd647b660de7e245595b1a45f3433bb580e7eab033f9bb7792c3ed5ccc17021","sha256:360de37c3d06ca0c0987f4a2ef0a9bc754acba74ccec112d89c034ee348e4f2f"],"state_sha256":"0e65b09c257454e758319a1752edac2ecba4b94fe1b37087c9717b6836071edd"}