{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZQB3D47X54AHCCD522VDU25OVT","short_pith_number":"pith:ZQB3D47X","canonical_record":{"source":{"id":"1408.0557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T00:23:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3a9589f8a63a74cc820814ce73a4a9c41652de7a4a2af00a82f7ecd39bb8227c","abstract_canon_sha256":"91affebf115e53df1532961755e7621933032486571ceb4f5ebc33645967b79f"},"schema_version":"1.0"},"canonical_sha256":"cc03b1f3f7ef0071087dd6aa3a6baeacff81c6807d94be8e5f01b9c232ff57c4","source":{"kind":"arxiv","id":"1408.0557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0557","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0557v1","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0557","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZQB3D47X54AH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQB3D47X54AHCCD5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQB3D47X","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZQB3D47X54AHCCD522VDU25OVT","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T00:23:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3a9589f8a63a74cc820814ce73a4a9c41652de7a4a2af00a82f7ecd39bb8227c","abstract_canon_sha256":"91affebf115e53df1532961755e7621933032486571ceb4f5ebc33645967b79f"},"schema_version":"1.0"},"canonical_sha256":"cc03b1f3f7ef0071087dd6aa3a6baeacff81c6807d94be8e5f01b9c232ff57c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:56.814353Z","signature_b64":"Vkrrtd30dcx/zWWbRl9o8Sw8MmnqXMQpz5CJdEcgO3hemm4Ax0VAAsHS9HZbD9ylHAugfgvOd5CIcDVKZlYyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc03b1f3f7ef0071087dd6aa3a6baeacff81c6807d94be8e5f01b9c232ff57c4","last_reissued_at":"2026-05-18T02:45:56.813813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:56.813813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0557","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-18T02:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Py/EGSb7lPCjjyMavZfRbxJLVn1l/kwv2ECcbRjWYh/fuO70brlCTCcuHcWZQrZLVeWw4v2OqMskSFZ5KWxfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:11:38.184051Z"},"content_sha256":"9352ebec47bb0b6b65c50a0a3bae768eba0f6a6680ddf25187876439e7282cb2","schema_version":"1.0","event_id":"sha256:9352ebec47bb0b6b65c50a0a3bae768eba0f6a6680ddf25187876439e7282cb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZQB3D47X54AHCCD522VDU25OVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-Tight Distributed Minimum Cut Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Hsin-Hao Su","submitted_at":"2014-08-04T00:23:28Z","abstract_excerpt":"We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our algorithm can compute $\\lambda$ exactly in $O((\\sqrt{n} \\log^{*} n+D)\\lambda^4 \\log^2 n)$ time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this problem are known only for unweighted graphs when $\\lambda\\leq 3$ due t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0557","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-18T02:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKfr8dO+5nLnrV0xnxPYUb5o9kJik1BBAEvEo/hKeifUEH3jfzbxRsI2irNMUToXFXEeuqtKdraJ0goLNNZHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:11:38.184736Z"},"content_sha256":"c83f4ab0b143dbcb6a2b5880394b6f41ac4172a605a08a2384fb012c4ee3b75a","schema_version":"1.0","event_id":"sha256:c83f4ab0b143dbcb6a2b5880394b6f41ac4172a605a08a2384fb012c4ee3b75a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQB3D47X54AHCCD522VDU25OVT/bundle.json","state_url":"https://pith.science/pith/ZQB3D47X54AHCCD522VDU25OVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQB3D47X54AHCCD522VDU25OVT/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-27T16:11:38Z","links":{"resolver":"https://pith.science/pith/ZQB3D47X54AHCCD522VDU25OVT","bundle":"https://pith.science/pith/ZQB3D47X54AHCCD522VDU25OVT/bundle.json","state":"https://pith.science/pith/ZQB3D47X54AHCCD522VDU25OVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQB3D47X54AHCCD522VDU25OVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZQB3D47X54AHCCD522VDU25OVT","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":"91affebf115e53df1532961755e7621933032486571ceb4f5ebc33645967b79f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T00:23:28Z","title_canon_sha256":"3a9589f8a63a74cc820814ce73a4a9c41652de7a4a2af00a82f7ecd39bb8227c"},"schema_version":"1.0","source":{"id":"1408.0557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0557","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0557v1","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0557","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZQB3D47X54AH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQB3D47X54AHCCD5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQB3D47X","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:c83f4ab0b143dbcb6a2b5880394b6f41ac4172a605a08a2384fb012c4ee3b75a","target":"graph","created_at":"2026-05-18T02:45: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":"We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our algorithm can compute $\\lambda$ exactly in $O((\\sqrt{n} \\log^{*} n+D)\\lambda^4 \\log^2 n)$ time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this problem are known only for unweighted graphs when $\\lambda\\leq 3$ due t","authors_text":"Danupon Nanongkai, Hsin-Hao Su","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T00:23:28Z","title":"Almost-Tight Distributed Minimum Cut Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0557","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:9352ebec47bb0b6b65c50a0a3bae768eba0f6a6680ddf25187876439e7282cb2","target":"record","created_at":"2026-05-18T02:45: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":"91affebf115e53df1532961755e7621933032486571ceb4f5ebc33645967b79f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T00:23:28Z","title_canon_sha256":"3a9589f8a63a74cc820814ce73a4a9c41652de7a4a2af00a82f7ecd39bb8227c"},"schema_version":"1.0","source":{"id":"1408.0557","kind":"arxiv","version":1}},"canonical_sha256":"cc03b1f3f7ef0071087dd6aa3a6baeacff81c6807d94be8e5f01b9c232ff57c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc03b1f3f7ef0071087dd6aa3a6baeacff81c6807d94be8e5f01b9c232ff57c4","first_computed_at":"2026-05-18T02:45:56.813813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:56.813813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vkrrtd30dcx/zWWbRl9o8Sw8MmnqXMQpz5CJdEcgO3hemm4Ax0VAAsHS9HZbD9ylHAugfgvOd5CIcDVKZlYyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:56.814353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9352ebec47bb0b6b65c50a0a3bae768eba0f6a6680ddf25187876439e7282cb2","sha256:c83f4ab0b143dbcb6a2b5880394b6f41ac4172a605a08a2384fb012c4ee3b75a"],"state_sha256":"ebad0d8d3d2ac967c2278d73e8b23e80431c56c229bf87cbaf30eaa789a46019"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13ZhpX2dIuveLVDSsn6/yWKEdQ5T6YU+0IPwlIDizDSah147RQTTy+kSqpuX9YP6HSc6H2UHCCND5hypDYfzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:11:38.188930Z","bundle_sha256":"e6bb480b88031601b56f45e71b6dbcb11e01543b748899815a8acbd7dc308012"}}