{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FTO6INLDX7C6BEXE2X7Y6ZUHB5","short_pith_number":"pith:FTO6INLD","canonical_record":{"source":{"id":"1109.1146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-06T11:19:13Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"d116a0e212a779d78ba306c2ee5133f4c0c0c975cb8e01db50db63e366feeb35","abstract_canon_sha256":"b99d10120c523906046c1721f8a6d39f7693b58a520f20f9e5eb584796657b52"},"schema_version":"1.0"},"canonical_sha256":"2cdde43563bfc5e092e4d5ff8f66870f6ba5ee4113505b442710e258a6ff4782","source":{"kind":"arxiv","id":"1109.1146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1146","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1146v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1146","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"FTO6INLDX7C6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTO6INLDX7C6BEXE","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTO6INLD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FTO6INLDX7C6BEXE2X7Y6ZUHB5","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-06T11:19:13Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"d116a0e212a779d78ba306c2ee5133f4c0c0c975cb8e01db50db63e366feeb35","abstract_canon_sha256":"b99d10120c523906046c1721f8a6d39f7693b58a520f20f9e5eb584796657b52"},"schema_version":"1.0"},"canonical_sha256":"2cdde43563bfc5e092e4d5ff8f66870f6ba5ee4113505b442710e258a6ff4782","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.273260Z","signature_b64":"5AUjMlMcYzn0l1i8zEKTGRir0bCcRcgXvC4w7+yNcMOE6F9goNUkyTxLC9sCGS22WY9sB1Wp7YupkEEys8QkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cdde43563bfc5e092e4d5ff8f66870f6ba5ee4113505b442710e258a6ff4782","last_reissued_at":"2026-05-18T04:14:05.272631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.272631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1146","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UQgQ+td3RUoaghPWj1I/dhSJWYUEZltj0Fkay3xW5C4EDrZ0gQ1/42vI3mQ0S2qLFCeGSMc4iy0Jzpc5tJ2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:34:40.531999Z"},"content_sha256":"737a4cdcd5834b2529553521c320e55896673b7681e45376798b3ee68f194dec","schema_version":"1.0","event_id":"sha256:737a4cdcd5834b2529553521c320e55896673b7681e45376798b3ee68f194dec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FTO6INLDX7C6BEXE2X7Y6ZUHB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Shekhovtsov, Vaclav Hlavac","submitted_at":"2011-09-06T11:19:13Z","abstract_excerpt":"We develop a novel distributed algorithm for the minimum cut problem. We primarily aim at solving large sparse problems. Assuming vertices of the graph are partitioned into several regions, the algorithm performs path augmentations inside the regions and updates of the push-relabel style between the regions. The interaction between regions is considered expensive (regions are loaded into the memory one-by-one or located on separate machines in a network). The algorithm works in sweeps - passes over all regions. Let $B$ be the set of vertices incident to inter-region edges of the graph. We pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1146","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7PLxa3WJxhv9G/EvYDogNDG4Pwm91HAmHJC7esvHnWlEB0CfsFBDETfaWKFkbCQFOjqEKdLEAT1pWSbeUL8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:34:40.532656Z"},"content_sha256":"19d0c0d61514bc0b332ba461352adf64800157c8137f0e16bc02a29d719a97e1","schema_version":"1.0","event_id":"sha256:19d0c0d61514bc0b332ba461352adf64800157c8137f0e16bc02a29d719a97e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/bundle.json","state_url":"https://pith.science/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/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-06-10T22:34:40Z","links":{"resolver":"https://pith.science/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5","bundle":"https://pith.science/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/bundle.json","state":"https://pith.science/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTO6INLDX7C6BEXE2X7Y6ZUHB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FTO6INLDX7C6BEXE2X7Y6ZUHB5","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":"b99d10120c523906046c1721f8a6d39f7693b58a520f20f9e5eb584796657b52","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-06T11:19:13Z","title_canon_sha256":"d116a0e212a779d78ba306c2ee5133f4c0c0c975cb8e01db50db63e366feeb35"},"schema_version":"1.0","source":{"id":"1109.1146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1146","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1146v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1146","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"FTO6INLDX7C6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTO6INLDX7C6BEXE","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTO6INLD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:19d0c0d61514bc0b332ba461352adf64800157c8137f0e16bc02a29d719a97e1","target":"graph","created_at":"2026-05-18T04:14:05Z","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":"We develop a novel distributed algorithm for the minimum cut problem. We primarily aim at solving large sparse problems. Assuming vertices of the graph are partitioned into several regions, the algorithm performs path augmentations inside the regions and updates of the push-relabel style between the regions. The interaction between regions is considered expensive (regions are loaded into the memory one-by-one or located on separate machines in a network). The algorithm works in sweeps - passes over all regions. Let $B$ be the set of vertices incident to inter-region edges of the graph. We pres","authors_text":"Alexander Shekhovtsov, Vaclav Hlavac","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-06T11:19:13Z","title":"A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1146","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:737a4cdcd5834b2529553521c320e55896673b7681e45376798b3ee68f194dec","target":"record","created_at":"2026-05-18T04:14:05Z","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":"b99d10120c523906046c1721f8a6d39f7693b58a520f20f9e5eb584796657b52","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-06T11:19:13Z","title_canon_sha256":"d116a0e212a779d78ba306c2ee5133f4c0c0c975cb8e01db50db63e366feeb35"},"schema_version":"1.0","source":{"id":"1109.1146","kind":"arxiv","version":1}},"canonical_sha256":"2cdde43563bfc5e092e4d5ff8f66870f6ba5ee4113505b442710e258a6ff4782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cdde43563bfc5e092e4d5ff8f66870f6ba5ee4113505b442710e258a6ff4782","first_computed_at":"2026-05-18T04:14:05.272631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.272631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5AUjMlMcYzn0l1i8zEKTGRir0bCcRcgXvC4w7+yNcMOE6F9goNUkyTxLC9sCGS22WY9sB1Wp7YupkEEys8QkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.273260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:737a4cdcd5834b2529553521c320e55896673b7681e45376798b3ee68f194dec","sha256:19d0c0d61514bc0b332ba461352adf64800157c8137f0e16bc02a29d719a97e1"],"state_sha256":"dc56e38eb14d2d1f8d0fe457cf78a4692335a1f15d7e076864b407fcaf685103"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZosFNPnRnAMVXEcVBo36KjG/IKrdPbGvK+u/eff85hNJIwlubhyQpufPJPGc7/NpgGIev0h7wgU4lBOulAXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:34:40.536932Z","bundle_sha256":"3ef324da096df9d0f0c3a3730f7fe84d7ec7b7d265368242b9eebdd19e9043d8"}}