{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:T6XSQKSCCDMHSABQBFH27C65FB","short_pith_number":"pith:T6XSQKSC","schema_version":"1.0","canonical_sha256":"9faf282a4210d8790030094faf8bdd285a172cdb5e19c4a20118e0b30f2e1ad2","source":{"kind":"arxiv","id":"0901.1155","version":2},"attestation_state":"computed","paper":{"title":"Balanced allocation: Memory performance tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Itai Benjamini, Yury Makarychev","submitted_at":"2009-01-09T00:23:33Z","abstract_excerpt":"Suppose we sequentially put $n$ balls into $n$ bins. If we put each ball into a random bin then the heaviest bin will contain ${\\sim}\\log n/\\log\\log n$ balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180--200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ${\\sim}\\log\\log n$ balls with high probability. How much memory do we need to implement this scheme? We need roughly $\\log\\log\\log n$ bits per bin, and $n\\log\\log\\log n$ bits in total. Let us "},"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":"0901.1155","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-09T00:23:33Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"c86abb126cc8852b208f61f88ed47935fbc2fd172ea8be3161526918623496fb","abstract_canon_sha256":"bf1496e08972dd6cfa0375664642c7db12688a73e1b68aee46d2dbe2407e06bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:51.936697Z","signature_b64":"+SOrEMYWeJCoJ+bHBe3waT2p29LBtuNHyMr+AMRT6ap6L4DzSaYoQyCF6AqwQAosrX6djhptCwF5hSJtGsTgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9faf282a4210d8790030094faf8bdd285a172cdb5e19c4a20118e0b30f2e1ad2","last_reissued_at":"2026-05-18T03:45:51.935613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:51.935613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced allocation: Memory performance tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Itai Benjamini, Yury Makarychev","submitted_at":"2009-01-09T00:23:33Z","abstract_excerpt":"Suppose we sequentially put $n$ balls into $n$ bins. If we put each ball into a random bin then the heaviest bin will contain ${\\sim}\\log n/\\log\\log n$ balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180--200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ${\\sim}\\log\\log n$ balls with high probability. How much memory do we need to implement this scheme? We need roughly $\\log\\log\\log n$ bits per bin, and $n\\log\\log\\log n$ bits in total. Let us "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.1155","kind":"arxiv","version":2},"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":"0901.1155","created_at":"2026-05-18T03:45:51.935725+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.1155v2","created_at":"2026-05-18T03:45:51.935725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.1155","created_at":"2026-05-18T03:45:51.935725+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6XSQKSCCDMH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6XSQKSCCDMHSABQ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6XSQKSC","created_at":"2026-05-18T12:26:01.383474+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/T6XSQKSCCDMHSABQBFH27C65FB","json":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB.json","graph_json":"https://pith.science/api/pith-number/T6XSQKSCCDMHSABQBFH27C65FB/graph.json","events_json":"https://pith.science/api/pith-number/T6XSQKSCCDMHSABQBFH27C65FB/events.json","paper":"https://pith.science/paper/T6XSQKSC"},"agent_actions":{"view_html":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB","download_json":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB.json","view_paper":"https://pith.science/paper/T6XSQKSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.1155&json=true","fetch_graph":"https://pith.science/api/pith-number/T6XSQKSCCDMHSABQBFH27C65FB/graph.json","fetch_events":"https://pith.science/api/pith-number/T6XSQKSCCDMHSABQBFH27C65FB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB/action/storage_attestation","attest_author":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB/action/author_attestation","sign_citation":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB/action/citation_signature","submit_replication":"https://pith.science/pith/T6XSQKSCCDMHSABQBFH27C65FB/action/replication_record"}},"created_at":"2026-05-18T03:45:51.935725+00:00","updated_at":"2026-05-18T03:45:51.935725+00:00"}