{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BCAOOVTN7QHSZH33XIM7FGIBDZ","short_pith_number":"pith:BCAOOVTN","canonical_record":{"source":{"id":"1804.09684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T17:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"951e4fce2092958226ec3d6c1e1e20356acb23a8cafd4434654b8c59fd68b83b","abstract_canon_sha256":"4f3ba4e0e8441afd8a425d2a2af76d40712fe2cb6caeee04f3900643659b660f"},"schema_version":"1.0"},"canonical_sha256":"0880e7566dfc0f2c9f7bba19f299011e46c6c08b3be212a3f2fab7643ccc6144","source":{"kind":"arxiv","id":"1804.09684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09684","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09684v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09684","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"BCAOOVTN7QHS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCAOOVTN7QHSZH33","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCAOOVTN","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BCAOOVTN7QHSZH33XIM7FGIBDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T17:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"951e4fce2092958226ec3d6c1e1e20356acb23a8cafd4434654b8c59fd68b83b","abstract_canon_sha256":"4f3ba4e0e8441afd8a425d2a2af76d40712fe2cb6caeee04f3900643659b660f"},"schema_version":"1.0"},"canonical_sha256":"0880e7566dfc0f2c9f7bba19f299011e46c6c08b3be212a3f2fab7643ccc6144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.078169Z","signature_b64":"v5jbPR5c8wFwbJt71CWiHrLqDljUV6TfNESathrXB8GCQ/VZUR7oY0AIEhTxSBPp8axd+AxSgTM16Ah7p9ZIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0880e7566dfc0f2c9f7bba19f299011e46c6c08b3be212a3f2fab7643ccc6144","last_reissued_at":"2026-05-18T00:17:31.077456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.077456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09684","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-18T00:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV301Di2OtFBXVa3t1y2VRigwEBW0NHmD78fR/MO5GK/nFvmhgB6b3cYBcr/JOP3B0XZ5/n1LswTDYV9NhHOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:45:29.900214Z"},"content_sha256":"dfdace272e380a78b48401f75b7bc062b3827508a9ed80443510406abecddddd","schema_version":"1.0","event_id":"sha256:dfdace272e380a78b48401f75b7bc062b3827508a9ed80443510406abecddddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BCAOOVTN7QHSZH33XIM7FGIBDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power of $d$ Choices with Simple Tabulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup","submitted_at":"2018-04-25T17:23:48Z","abstract_excerpt":"Suppose that we are to place $m$ balls into $n$ bins sequentially using the $d$-choice paradigm: For each ball we are given a choice of $d$ bins, according to $d$ hash functions $h_1,\\dots,h_d$ and we place the ball in the least loaded of these bins breaking ties arbitrarily. Our interest is in the number of balls in the fullest bin after all $m$ balls have been placed.\n  Azar et al. [STOC'94] proved that when $m=O(n)$ and when the hash functions are fully random the maximum load is at most $\\frac{\\lg \\lg n }{\\lg d}+O(1)$ whp (i.e. with probability $1-O(n^{-\\gamma})$ for any choice of $\\gamma$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09684","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-18T00:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLO0s+TvJPpSibEIfxjrphSc35xLxd3qPQCO5mQ0s6V3lGWBQ47+S/PZswWrKY9caYUq9EqVOtdkUbJ8Sd9vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:45:29.900576Z"},"content_sha256":"0bd4d93e32621d05d625c16aca8e0161a0ba062d690f4d12939631286b831e5f","schema_version":"1.0","event_id":"sha256:0bd4d93e32621d05d625c16aca8e0161a0ba062d690f4d12939631286b831e5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/bundle.json","state_url":"https://pith.science/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/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-27T00:45:29Z","links":{"resolver":"https://pith.science/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ","bundle":"https://pith.science/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/bundle.json","state":"https://pith.science/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCAOOVTN7QHSZH33XIM7FGIBDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BCAOOVTN7QHSZH33XIM7FGIBDZ","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":"4f3ba4e0e8441afd8a425d2a2af76d40712fe2cb6caeee04f3900643659b660f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T17:23:48Z","title_canon_sha256":"951e4fce2092958226ec3d6c1e1e20356acb23a8cafd4434654b8c59fd68b83b"},"schema_version":"1.0","source":{"id":"1804.09684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09684","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09684v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09684","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"BCAOOVTN7QHS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCAOOVTN7QHSZH33","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCAOOVTN","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:0bd4d93e32621d05d625c16aca8e0161a0ba062d690f4d12939631286b831e5f","target":"graph","created_at":"2026-05-18T00:17:31Z","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":"Suppose that we are to place $m$ balls into $n$ bins sequentially using the $d$-choice paradigm: For each ball we are given a choice of $d$ bins, according to $d$ hash functions $h_1,\\dots,h_d$ and we place the ball in the least loaded of these bins breaking ties arbitrarily. Our interest is in the number of balls in the fullest bin after all $m$ balls have been placed.\n  Azar et al. [STOC'94] proved that when $m=O(n)$ and when the hash functions are fully random the maximum load is at most $\\frac{\\lg \\lg n }{\\lg d}+O(1)$ whp (i.e. with probability $1-O(n^{-\\gamma})$ for any choice of $\\gamma$","authors_text":"Anders Aamand, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T17:23:48Z","title":"Power of $d$ Choices with Simple Tabulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09684","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:dfdace272e380a78b48401f75b7bc062b3827508a9ed80443510406abecddddd","target":"record","created_at":"2026-05-18T00:17:31Z","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":"4f3ba4e0e8441afd8a425d2a2af76d40712fe2cb6caeee04f3900643659b660f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T17:23:48Z","title_canon_sha256":"951e4fce2092958226ec3d6c1e1e20356acb23a8cafd4434654b8c59fd68b83b"},"schema_version":"1.0","source":{"id":"1804.09684","kind":"arxiv","version":1}},"canonical_sha256":"0880e7566dfc0f2c9f7bba19f299011e46c6c08b3be212a3f2fab7643ccc6144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0880e7566dfc0f2c9f7bba19f299011e46c6c08b3be212a3f2fab7643ccc6144","first_computed_at":"2026-05-18T00:17:31.077456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:31.077456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5jbPR5c8wFwbJt71CWiHrLqDljUV6TfNESathrXB8GCQ/VZUR7oY0AIEhTxSBPp8axd+AxSgTM16Ah7p9ZIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:31.078169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfdace272e380a78b48401f75b7bc062b3827508a9ed80443510406abecddddd","sha256:0bd4d93e32621d05d625c16aca8e0161a0ba062d690f4d12939631286b831e5f"],"state_sha256":"de7820f00dd9eebcf6d9251652df13e83b977c8e9e224a1db7a7162ee9a47486"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcd8DgyVQVgonY3uHyNc1ZqLLGKm67MHfEmg+B0wUsA/+Oyes+CLCD2Bh4L7Zr+bfkciBSz/ZS1Ds+/NCy88AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:45:29.902454Z","bundle_sha256":"70bad095049464778cb96819bcb3774f8ddddca73ae94a78712c244a3c699a5e"}}