{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TT2IT6IEZ2JU2ZLTOV2HHWPKV6","short_pith_number":"pith:TT2IT6IE","schema_version":"1.0","canonical_sha256":"9cf489f904ce934d6573757473d9eaafbbeaacda6a455ec92e11184aba77e343","source":{"kind":"arxiv","id":"1407.6846","version":3},"attestation_state":"computed","paper":{"title":"The Power of Two Choices with Simple Tabulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eva Rotenberg, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup, S{\\o}ren Dahlgaard","submitted_at":"2014-07-25T10:56:37Z","abstract_excerpt":"The power of two choices is a classic paradigm for load balancing when assigning $m$ balls to $n$ bins. When placing a ball, we pick two bins according to two hash functions $h_0$ and $h_1$, and place the ball in the least loaded bin. Assuming fully random hash functions, when $m=O(n)$, Azar et al.~[STOC'94] proved that the maximum load is $\\lg \\lg n + O(1)$ with high probability.\n  In this paper, we investigate the power of two choices when the hash functions $h_0$ and $h_1$ are implemented with simple tabulation, which is a very efficient hash function evaluated in constant time. Following t"},"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":"1407.6846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-25T10:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"85d3a63e074d8cd9f137eba0431a68ce8df0e6d8f55a7f59e391f3f4c69e5246","abstract_canon_sha256":"763e4a36cc4c21675c3934a13d73ff4d1b3b2c711b4bafcc55e75c29b0aaa0c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:08.567420Z","signature_b64":"f0NdDMz5bln+2AvFP8PtlW/OD6cREX+IyouVHpAV8CTp87kVgRhVwpz6zXmLa7WJMFhOnWLAMv4/2F/H/7aeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf489f904ce934d6573757473d9eaafbbeaacda6a455ec92e11184aba77e343","last_reissued_at":"2026-05-18T01:22:08.566812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:08.566812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Two Choices with Simple Tabulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eva Rotenberg, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup, S{\\o}ren Dahlgaard","submitted_at":"2014-07-25T10:56:37Z","abstract_excerpt":"The power of two choices is a classic paradigm for load balancing when assigning $m$ balls to $n$ bins. When placing a ball, we pick two bins according to two hash functions $h_0$ and $h_1$, and place the ball in the least loaded bin. Assuming fully random hash functions, when $m=O(n)$, Azar et al.~[STOC'94] proved that the maximum load is $\\lg \\lg n + O(1)$ with high probability.\n  In this paper, we investigate the power of two choices when the hash functions $h_0$ and $h_1$ are implemented with simple tabulation, which is a very efficient hash function evaluated in constant time. Following t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6846","kind":"arxiv","version":3},"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":"1407.6846","created_at":"2026-05-18T01:22:08.566894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6846v3","created_at":"2026-05-18T01:22:08.566894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6846","created_at":"2026-05-18T01:22:08.566894+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT2IT6IEZ2JU","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT2IT6IEZ2JU2ZLT","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT2IT6IE","created_at":"2026-05-18T12:28:52.271510+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/TT2IT6IEZ2JU2ZLTOV2HHWPKV6","json":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6.json","graph_json":"https://pith.science/api/pith-number/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/graph.json","events_json":"https://pith.science/api/pith-number/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/events.json","paper":"https://pith.science/paper/TT2IT6IE"},"agent_actions":{"view_html":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6","download_json":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6.json","view_paper":"https://pith.science/paper/TT2IT6IE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6846&json=true","fetch_graph":"https://pith.science/api/pith-number/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/graph.json","fetch_events":"https://pith.science/api/pith-number/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/action/storage_attestation","attest_author":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/action/author_attestation","sign_citation":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/action/citation_signature","submit_replication":"https://pith.science/pith/TT2IT6IEZ2JU2ZLTOV2HHWPKV6/action/replication_record"}},"created_at":"2026-05-18T01:22:08.566894+00:00","updated_at":"2026-05-18T01:22:08.566894+00:00"}