{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZVHKX4PEEYJ4ORBARHAKWKTJDQ","short_pith_number":"pith:ZVHKX4PE","schema_version":"1.0","canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","source":{"kind":"arxiv","id":"2111.00602","version":2},"attestation_state":"computed","paper":{"title":"On the Optimal Time/Space Tradeoff for Hash Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kuszmaul, Mart\\'in Farach-Colton, Michael A. Bender, Mingmou Liu, William Kuszmaul","submitted_at":"2021-10-31T21:58:06Z","abstract_excerpt":"For nearly six decades, the central open question in the study of hash tables has been to determine the optimal achievable tradeoff curve between time and space. State-of-the-art hash tables offer the following guarantee: If keys/values are Theta(log n) bits each, then it is possible to achieve constant-time insertions/deletions/queries while wasting only O(loglog n) bits of space per key when compared to the information-theoretic optimum. Even prior to this bound being achieved, the target of O(loglog n) wasted bits per key was known to be a natural end goal, and was proven to be optimal for "},"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":"2111.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d3599c4a5860eb0a93ed46e68ca2dd8b8f19412c472fd420f4f6d05a6e4456e","abstract_canon_sha256":"c949da7a16a188a41ac8abb59b2a45f4f4788ed4b53ef538587f91b37d897043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:04.542030Z","signature_b64":"QnVwk+tjH2X0SfxKAnPS4T1yvCcRPd6yZYpfv320kl1WoghVfnf18cNYF7wjtCDO8rC0T9cWBzQFX+WCnZLLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","last_reissued_at":"2026-07-05T03:29:04.541601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:04.541601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Time/Space Tradeoff for Hash Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kuszmaul, Mart\\'in Farach-Colton, Michael A. Bender, Mingmou Liu, William Kuszmaul","submitted_at":"2021-10-31T21:58:06Z","abstract_excerpt":"For nearly six decades, the central open question in the study of hash tables has been to determine the optimal achievable tradeoff curve between time and space. State-of-the-art hash tables offer the following guarantee: If keys/values are Theta(log n) bits each, then it is possible to achieve constant-time insertions/deletions/queries while wasting only O(loglog n) bits of space per key when compared to the information-theoretic optimum. Even prior to this bound being achieved, the target of O(loglog n) wasted bits per key was known to be a natural end goal, and was proven to be optimal for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00602","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.00602/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.00602","created_at":"2026-07-05T03:29:04.541658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00602v2","created_at":"2026-07-05T03:29:04.541658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00602","created_at":"2026-07-05T03:29:04.541658+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVHKX4PEEYJ4","created_at":"2026-07-05T03:29:04.541658+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVHKX4PEEYJ4ORBA","created_at":"2026-07-05T03:29:04.541658+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVHKX4PE","created_at":"2026-07-05T03:29:04.541658+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/ZVHKX4PEEYJ4ORBARHAKWKTJDQ","json":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ.json","graph_json":"https://pith.science/api/pith-number/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/graph.json","events_json":"https://pith.science/api/pith-number/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/events.json","paper":"https://pith.science/paper/ZVHKX4PE"},"agent_actions":{"view_html":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ","download_json":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ.json","view_paper":"https://pith.science/paper/ZVHKX4PE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00602&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/action/replication_record"}},"created_at":"2026-07-05T03:29:04.541658+00:00","updated_at":"2026-07-05T03:29:04.541658+00:00"}