{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XJ4XU5ZWQCMNAJFLPBD7AVAA2A","short_pith_number":"pith:XJ4XU5ZW","canonical_record":{"source":{"id":"1310.5367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-20T20:15:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"00c7786a7b933f21e8e1b7dd3cb1fdba8553c84ee4e11217a47e46fce9520b28","abstract_canon_sha256":"9b3727ac635c57037288a14746ca1a722e192eecef48401470d4fe61ad6aec32"},"schema_version":"1.0"},"canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","source":{"kind":"arxiv","id":"1310.5367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5367","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5367v1","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5367","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4XU5ZWQCMN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4XU5ZWQCMNAJFL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4XU5ZW","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XJ4XU5ZWQCMNAJFLPBD7AVAA2A","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-20T20:15:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"00c7786a7b933f21e8e1b7dd3cb1fdba8553c84ee4e11217a47e46fce9520b28","abstract_canon_sha256":"9b3727ac635c57037288a14746ca1a722e192eecef48401470d4fe61ad6aec32"},"schema_version":"1.0"},"canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:36.053110Z","signature_b64":"IaFuVNZYOVdbr8Y2DoCMKRb9LTUi5I7QuJBX5/BONuEiluWuHoR6TweXrzL47ITTI94BUPkGZ6DVGXDEgu+kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","last_reissued_at":"2026-05-18T03:09:36.052512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:36.052512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5367","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-18T03:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wR7yIdAycmdYAOqD7rgZkIO2LgffuYcPu1BQCtCnZknkho9ELvubzAGoWbjrpPnVpOAFsjtO1FB55Gc61FxjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:42:57.404874Z"},"content_sha256":"12ec820c44f42cf4c82591bd2851292cb047a3aeeb65432693b3b839cc25e16f","schema_version":"1.0","event_id":"sha256:12ec820c44f42cf4c82591bd2851292cb047a3aeeb65432693b3b839cc25e16f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XJ4XU5ZWQCMNAJFLPBD7AVAA2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Kunal Talwar, Udi Wieder","submitted_at":"2013-10-20T20:15:07Z","abstract_excerpt":"We provide a relatively simple proof that the expected gap between the maximum load and the average load in the two choice process is bounded by $(1+o(1))\\log \\log n$, irrespective of the number of balls thrown. The theorem was first proven by Berenbrink et al. Their proof uses heavy machinery from Markov-Chain theory and some of the calculations are done using computers. In this manuscript we provide a significantly simpler proof that is not aided by computers and is self contained. The simplification comes at a cost of weaker bounds on the low order terms and a weaker tail bound for the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5367","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-18T03:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vefzbMe34O+lV1jRdiCOvVlhbV2NVdfJK9kdWzI0pmfOY0ZjEmImKPagyUJlMnkZq5E8BR/ysJBrC/VbGWoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:42:57.405451Z"},"content_sha256":"59916b75394fe003ba7e64a2ed41d6926ae07d01495e8ad7df868c4c8c9b0dee","schema_version":"1.0","event_id":"sha256:59916b75394fe003ba7e64a2ed41d6926ae07d01495e8ad7df868c4c8c9b0dee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/bundle.json","state_url":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/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-05T01:42:57Z","links":{"resolver":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A","bundle":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/bundle.json","state":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XJ4XU5ZWQCMNAJFLPBD7AVAA2A","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":"9b3727ac635c57037288a14746ca1a722e192eecef48401470d4fe61ad6aec32","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-20T20:15:07Z","title_canon_sha256":"00c7786a7b933f21e8e1b7dd3cb1fdba8553c84ee4e11217a47e46fce9520b28"},"schema_version":"1.0","source":{"id":"1310.5367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5367","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5367v1","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5367","created_at":"2026-05-18T03:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4XU5ZWQCMN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4XU5ZWQCMNAJFL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4XU5ZW","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:59916b75394fe003ba7e64a2ed41d6926ae07d01495e8ad7df868c4c8c9b0dee","target":"graph","created_at":"2026-05-18T03:09:36Z","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 provide a relatively simple proof that the expected gap between the maximum load and the average load in the two choice process is bounded by $(1+o(1))\\log \\log n$, irrespective of the number of balls thrown. The theorem was first proven by Berenbrink et al. Their proof uses heavy machinery from Markov-Chain theory and some of the calculations are done using computers. In this manuscript we provide a significantly simpler proof that is not aided by computers and is self contained. The simplification comes at a cost of weaker bounds on the low order terms and a weaker tail bound for the prob","authors_text":"Kunal Talwar, Udi Wieder","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-20T20:15:07Z","title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5367","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:12ec820c44f42cf4c82591bd2851292cb047a3aeeb65432693b3b839cc25e16f","target":"record","created_at":"2026-05-18T03:09:36Z","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":"9b3727ac635c57037288a14746ca1a722e192eecef48401470d4fe61ad6aec32","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-20T20:15:07Z","title_canon_sha256":"00c7786a7b933f21e8e1b7dd3cb1fdba8553c84ee4e11217a47e46fce9520b28"},"schema_version":"1.0","source":{"id":"1310.5367","kind":"arxiv","version":1}},"canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","first_computed_at":"2026-05-18T03:09:36.052512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:36.052512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IaFuVNZYOVdbr8Y2DoCMKRb9LTUi5I7QuJBX5/BONuEiluWuHoR6TweXrzL47ITTI94BUPkGZ6DVGXDEgu+kDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:36.053110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ec820c44f42cf4c82591bd2851292cb047a3aeeb65432693b3b839cc25e16f","sha256:59916b75394fe003ba7e64a2ed41d6926ae07d01495e8ad7df868c4c8c9b0dee"],"state_sha256":"7f909559df77dc05c9d1584cec811bc9b8958713fa7a1a49a3fa3bf54d915c3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3tKjEHwZ9A1acMCDyD/na/+rkFE+hQu46ZWDYMeXwU9kqfycl1hCKmEAHw+sBVh2NCbj0c9AYCm8XRwXC2y3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:42:57.408285Z","bundle_sha256":"3dfbd602ac9d97cdeafb5db1996deb7171944d673b0dfe6c4d044eadfcdd72c4"}}