{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WE4VHGQXMM5JED6NDKH6OSWPMW","short_pith_number":"pith:WE4VHGQX","canonical_record":{"source":{"id":"1102.5425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T15:45:45Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"65ed5a072cc0d240502b745680663d65b04d09a527e3de3ca9cddd8b70148b2c","abstract_canon_sha256":"61a02556331fc104ae75ac15560e3a7f1cea2a04534ca0512ddac5511c1e196a"},"schema_version":"1.0"},"canonical_sha256":"b139539a17633a920fcd1a8fe74acf65a2b31d3ea6186ca2c00e7b645089d865","source":{"kind":"arxiv","id":"1102.5425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5425","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5425v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5425","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"WE4VHGQXMM5J","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WE4VHGQXMM5JED6N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WE4VHGQX","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WE4VHGQXMM5JED6NDKH6OSWPMW","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T15:45:45Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"65ed5a072cc0d240502b745680663d65b04d09a527e3de3ca9cddd8b70148b2c","abstract_canon_sha256":"61a02556331fc104ae75ac15560e3a7f1cea2a04534ca0512ddac5511c1e196a"},"schema_version":"1.0"},"canonical_sha256":"b139539a17633a920fcd1a8fe74acf65a2b31d3ea6186ca2c00e7b645089d865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:46.961559Z","signature_b64":"qMbNSkh9pDMGoxonLuYXcCUOeAPumApGFUQoh8/2k50VxgwqEkNdEYKBmKBRu0vhMB52TgW5cqmvEaG9En2hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b139539a17633a920fcd1a8fe74acf65a2b31d3ea6186ca2c00e7b645089d865","last_reissued_at":"2026-05-18T04:27:46.960930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:46.960930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5425","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywFs5mLtSvZ4VmixhyW4jgm/6oFWH+qRtH/8uUepSRCTfQ92L/HRtKj6LiFgGnsEoY19JQMP7yKjisRFdXKmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:14:37.924826Z"},"content_sha256":"d534f6bd9ed7a27d195d851cee0ae7d898e45969e2472c525385b863f4762a77","schema_version":"1.0","event_id":"sha256:d534f6bd9ed7a27d195d851cee0ae7d898e45969e2472c525385b863f4762a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WE4VHGQXMM5JED6NDKH6OSWPMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds for Parallel Randomized Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.CC","authors_text":"Christoph Lenzen, Roger Wattenhofer","submitted_at":"2011-02-26T15:45:45Z","abstract_excerpt":"We explore the fundamental limits of distributed balls-into-bins algorithms. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication rounds using O(n) messages in total. Larger bin loads can be traded in for smaller time complexities. We prove a matching lower bound of (1-o(1))log* n on the time complexity of symmetric algorithms that guarantee small bin loads at an asymptotically optimal message complexity of O(n). For each assumption of the lower bound, we provide an algorithm violating it, in turn achieving a constant maximum bin load in const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5425","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Epr5hx6rQy0rNBYuySqUF+LN3Eos2WmyHHh20WoYM3S32SApLiQIFsm/Gg3kXOevMZ925tIgfs+VRr9oNZVmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:14:37.925169Z"},"content_sha256":"156083b8bde01576adeb22a4473f99dd66a1fb1de2d9929b1bada64bca3bff08","schema_version":"1.0","event_id":"sha256:156083b8bde01576adeb22a4473f99dd66a1fb1de2d9929b1bada64bca3bff08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/bundle.json","state_url":"https://pith.science/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/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-30T08:14:37Z","links":{"resolver":"https://pith.science/pith/WE4VHGQXMM5JED6NDKH6OSWPMW","bundle":"https://pith.science/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/bundle.json","state":"https://pith.science/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WE4VHGQXMM5JED6NDKH6OSWPMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WE4VHGQXMM5JED6NDKH6OSWPMW","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":"61a02556331fc104ae75ac15560e3a7f1cea2a04534ca0512ddac5511c1e196a","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T15:45:45Z","title_canon_sha256":"65ed5a072cc0d240502b745680663d65b04d09a527e3de3ca9cddd8b70148b2c"},"schema_version":"1.0","source":{"id":"1102.5425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5425","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5425v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5425","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"WE4VHGQXMM5J","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WE4VHGQXMM5JED6N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WE4VHGQX","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:156083b8bde01576adeb22a4473f99dd66a1fb1de2d9929b1bada64bca3bff08","target":"graph","created_at":"2026-05-18T04:27:46Z","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 explore the fundamental limits of distributed balls-into-bins algorithms. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication rounds using O(n) messages in total. Larger bin loads can be traded in for smaller time complexities. We prove a matching lower bound of (1-o(1))log* n on the time complexity of symmetric algorithms that guarantee small bin loads at an asymptotically optimal message complexity of O(n). For each assumption of the lower bound, we provide an algorithm violating it, in turn achieving a constant maximum bin load in const","authors_text":"Christoph Lenzen, Roger Wattenhofer","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T15:45:45Z","title":"Tight Bounds for Parallel Randomized Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5425","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:d534f6bd9ed7a27d195d851cee0ae7d898e45969e2472c525385b863f4762a77","target":"record","created_at":"2026-05-18T04:27:46Z","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":"61a02556331fc104ae75ac15560e3a7f1cea2a04534ca0512ddac5511c1e196a","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T15:45:45Z","title_canon_sha256":"65ed5a072cc0d240502b745680663d65b04d09a527e3de3ca9cddd8b70148b2c"},"schema_version":"1.0","source":{"id":"1102.5425","kind":"arxiv","version":1}},"canonical_sha256":"b139539a17633a920fcd1a8fe74acf65a2b31d3ea6186ca2c00e7b645089d865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b139539a17633a920fcd1a8fe74acf65a2b31d3ea6186ca2c00e7b645089d865","first_computed_at":"2026-05-18T04:27:46.960930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:46.960930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qMbNSkh9pDMGoxonLuYXcCUOeAPumApGFUQoh8/2k50VxgwqEkNdEYKBmKBRu0vhMB52TgW5cqmvEaG9En2hBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:46.961559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d534f6bd9ed7a27d195d851cee0ae7d898e45969e2472c525385b863f4762a77","sha256:156083b8bde01576adeb22a4473f99dd66a1fb1de2d9929b1bada64bca3bff08"],"state_sha256":"ceacd668d7c84bc7feda0ddbadbdf88f2c1a8be9c1fdcec9f2e765531f99a029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZBlnkn+kue58JaR0lFPbAFODTxaYOe9AJJ4L0o85p8njFg5iEyKyqxoRXszqTsR0KLuRHctlg8EzX58xh9UAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:14:37.927121Z","bundle_sha256":"66aace3e1a7ffce600baaace9dfe0f667d48b7071ca5b5927710c1eb41038625"}}