{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MR7X3G7KPWEODKCNWF2C3JZO3E","short_pith_number":"pith:MR7X3G7K","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"},"canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","source":{"kind":"arxiv","id":"1708.06127","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MR7X3G7KPWEODKCNWF2C3JZO3E","target":"record","payload":{"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"},"canonical_sha256":"647f7d9bea7d88e1a84db1742da72ed91f7a459da73c22f33a088c9acc5a1100","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"},"source_kind":"arxiv","source_id":"1708.06127","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s89He1LUpIGFrCFxRqCGtVdHbHxcw0OaH4ge3TFalydR4MiFJu/YqPz2c5HtLiirO3Bq7GBOgWvQ4w6/KOByAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:33:28.622240Z"},"content_sha256":"9fd647b660de7e245595b1a45f3433bb580e7eab033f9bb7792c3ed5ccc17021","schema_version":"1.0","event_id":"sha256:9fd647b660de7e245595b1a45f3433bb580e7eab033f9bb7792c3ed5ccc17021"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MR7X3G7KPWEODKCNWF2C3JZO3E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsgDa0E3ysZ0Ouk47dU/MG3Lb4V3QHtKRSyBZKXxmr9TJfcbR7g6aALUZIR81G6NR0d9zgGhSuKV0tC2wewYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:33:28.622927Z"},"content_sha256":"360de37c3d06ca0c0987f4a2ef0a9bc754acba74ccec112d89c034ee348e4f2f","schema_version":"1.0","event_id":"sha256:360de37c3d06ca0c0987f4a2ef0a9bc754acba74ccec112d89c034ee348e4f2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/bundle.json","state_url":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T04:33:28Z","links":{"resolver":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E","bundle":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/bundle.json","state":"https://pith.science/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MR7X3G7KPWEODKCNWF2C3JZO3E/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xA3GO8lFqK4tZ5nTlhxz7n2iPpvJ0Fu1m2oplHoVMweY2Lhs5IYTUOqO596HNH4d2sSxBTijzR3bqCwJwKGLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:33:28.626434Z","bundle_sha256":"299c66a9063cf24bad0ef789c34ff2ff3dfcea8b5505dfb7276e92c51eed2976"}}