{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XJ4XU5ZWQCMNAJFLPBD7AVAA2A","short_pith_number":"pith:XJ4XU5ZW","schema_version":"1.0","canonical_sha256":"ba797a77368098d024ab7847f05400d0324324edd696e8939aae890d6c03c0bb","source":{"kind":"arxiv","id":"1310.5367","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.5367","created_at":"2026-05-18T03:09:36.052590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5367v1","created_at":"2026-05-18T03:09:36.052590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5367","created_at":"2026-05-18T03:09:36.052590+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJ4XU5ZWQCMN","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJ4XU5ZWQCMNAJFL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJ4XU5ZW","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A","json":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A.json","graph_json":"https://pith.science/api/pith-number/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/graph.json","events_json":"https://pith.science/api/pith-number/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/events.json","paper":"https://pith.science/paper/XJ4XU5ZW"},"agent_actions":{"view_html":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A","download_json":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A.json","view_paper":"https://pith.science/paper/XJ4XU5ZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5367&json=true","fetch_graph":"https://pith.science/api/pith-number/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/graph.json","fetch_events":"https://pith.science/api/pith-number/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/action/storage_attestation","attest_author":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/action/author_attestation","sign_citation":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/action/citation_signature","submit_replication":"https://pith.science/pith/XJ4XU5ZWQCMNAJFLPBD7AVAA2A/action/replication_record"}},"created_at":"2026-05-18T03:09:36.052590+00:00","updated_at":"2026-05-18T03:09:36.052590+00:00"}