{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SY4GREXUBJADGOXTHWQ25JTINA","short_pith_number":"pith:SY4GREXU","canonical_record":{"source":{"id":"1808.05458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T13:18:43Z","cross_cats_sorted":[],"title_canon_sha256":"3061bae8484a90db2705b7edf5ab2daa94eb92727b74abd8dcb21e1e0d16f186","abstract_canon_sha256":"937b8e0132edd5f78fa89f05da2c04f591bd08bd3d20fb128f6a4d1389646aff"},"schema_version":"1.0"},"canonical_sha256":"96386892f40a40333af33da1aea66868033b093da8c9f5421e5f7403d60a11ae","source":{"kind":"arxiv","id":"1808.05458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05458","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05458v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05458","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"SY4GREXUBJAD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SY4GREXUBJADGOXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SY4GREXU","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SY4GREXUBJADGOXTHWQ25JTINA","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T13:18:43Z","cross_cats_sorted":[],"title_canon_sha256":"3061bae8484a90db2705b7edf5ab2daa94eb92727b74abd8dcb21e1e0d16f186","abstract_canon_sha256":"937b8e0132edd5f78fa89f05da2c04f591bd08bd3d20fb128f6a4d1389646aff"},"schema_version":"1.0"},"canonical_sha256":"96386892f40a40333af33da1aea66868033b093da8c9f5421e5f7403d60a11ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:56.935216Z","signature_b64":"grfghzPNj3zo334qofvuA+aeZ0Yj6c+91J+IvpYyYxPq+jeKz32pfp8zxBJrGeXwqybTsTG6bzjY+BIT3223DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96386892f40a40333af33da1aea66868033b093da8c9f5421e5f7403d60a11ae","last_reissued_at":"2026-05-18T00:07:56.934630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:56.934630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05458","source_version":1,"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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGV1BTzJNqTZWUeuxTpo3UMwsg1Sj1pHUVEqowYVW64DWabzgCMnK8Xrxvti3mXcfXjSF+S6WeWpg8NLqauGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:07:11.672912Z"},"content_sha256":"96e0960a952f939ee388a2987556ac7ef199bb552f1c9ddc1e5c0fe6bfe3449e","schema_version":"1.0","event_id":"sha256:96e0960a952f939ee388a2987556ac7ef199bb552f1c9ddc1e5c0fe6bfe3449e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SY4GREXUBJADGOXTHWQ25JTINA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shared-memory Exact Minimum Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Noe, Christian Schulz, Monika Henzinger","submitted_at":"2018-08-16T13:18:43Z","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. In this paper, we engineer the fastest known exact algorithm for the problem.\n  State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05458","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"},"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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/8Vof3q9b3Gggoci6DsITJUBu9Ct59Gmz18VjuOzxeSZ+o6sDtAMy2PbFNecnn2H+Azrt+tftOrUMd+1pExBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:07:11.673587Z"},"content_sha256":"fc4c808c4ab4ca3f98744d954c3c8effeececa087c4e74d4317061141c858715","schema_version":"1.0","event_id":"sha256:fc4c808c4ab4ca3f98744d954c3c8effeececa087c4e74d4317061141c858715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SY4GREXUBJADGOXTHWQ25JTINA/bundle.json","state_url":"https://pith.science/pith/SY4GREXUBJADGOXTHWQ25JTINA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SY4GREXUBJADGOXTHWQ25JTINA/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-30T23:07:11Z","links":{"resolver":"https://pith.science/pith/SY4GREXUBJADGOXTHWQ25JTINA","bundle":"https://pith.science/pith/SY4GREXUBJADGOXTHWQ25JTINA/bundle.json","state":"https://pith.science/pith/SY4GREXUBJADGOXTHWQ25JTINA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SY4GREXUBJADGOXTHWQ25JTINA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SY4GREXUBJADGOXTHWQ25JTINA","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":"937b8e0132edd5f78fa89f05da2c04f591bd08bd3d20fb128f6a4d1389646aff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T13:18:43Z","title_canon_sha256":"3061bae8484a90db2705b7edf5ab2daa94eb92727b74abd8dcb21e1e0d16f186"},"schema_version":"1.0","source":{"id":"1808.05458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05458","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05458v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05458","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"SY4GREXUBJAD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SY4GREXUBJADGOXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SY4GREXU","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:fc4c808c4ab4ca3f98744d954c3c8effeececa087c4e74d4317061141c858715","target":"graph","created_at":"2026-05-18T00:07:56Z","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. In this paper, we engineer the fastest known exact algorithm for the problem.\n  State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques.","authors_text":"Alexander Noe, Christian Schulz, Monika Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T13:18:43Z","title":"Shared-memory Exact Minimum Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05458","kind":"arxiv","version":1},"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:96e0960a952f939ee388a2987556ac7ef199bb552f1c9ddc1e5c0fe6bfe3449e","target":"record","created_at":"2026-05-18T00:07:56Z","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":"937b8e0132edd5f78fa89f05da2c04f591bd08bd3d20fb128f6a4d1389646aff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T13:18:43Z","title_canon_sha256":"3061bae8484a90db2705b7edf5ab2daa94eb92727b74abd8dcb21e1e0d16f186"},"schema_version":"1.0","source":{"id":"1808.05458","kind":"arxiv","version":1}},"canonical_sha256":"96386892f40a40333af33da1aea66868033b093da8c9f5421e5f7403d60a11ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96386892f40a40333af33da1aea66868033b093da8c9f5421e5f7403d60a11ae","first_computed_at":"2026-05-18T00:07:56.934630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:56.934630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"grfghzPNj3zo334qofvuA+aeZ0Yj6c+91J+IvpYyYxPq+jeKz32pfp8zxBJrGeXwqybTsTG6bzjY+BIT3223DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:56.935216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96e0960a952f939ee388a2987556ac7ef199bb552f1c9ddc1e5c0fe6bfe3449e","sha256:fc4c808c4ab4ca3f98744d954c3c8effeececa087c4e74d4317061141c858715"],"state_sha256":"4ad6d7594fca179b9f851f41292ea9c031b190e151b61efd89bda5b5b648fdd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hp5oYNv7G4b9xEavc1z9kKv+q7GDsVNpHzKEVRSIyPnURFKCd/GJ/Ul/Dx7orwzlKa3w8JfvOjCiMuDb1k94Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:07:11.677385Z","bundle_sha256":"e0d9e79183724fbb5e0fb4c099e8ab8212e08faf1c368f7a2ec4f6520bbb8153"}}