{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L3B7WJL5RC4SLRRDEVQAYPVBTE","short_pith_number":"pith:L3B7WJL5","schema_version":"1.0","canonical_sha256":"5ec3fb257d88b925c62325600c3ea199127025fd4ec6fd039da571b3f3ecc14e","source":{"kind":"arxiv","id":"2409.11280","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Classical Open Addressing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bender, Renfei Zhou, William Kuszmaul","submitted_at":"2024-09-17T15:36:06Z","abstract_excerpt":"We introduce a classical open-addressed hash table, called rainbow hashing, that supports a load factor of up to $1 - \\varepsilon$, while also supporting $O(1)$ expected-time queries, and $O(\\log \\log \\varepsilon^{-1})$ expected-time insertions and deletions. We further prove that this tradeoff curve is optimal: any classical open-addressed hash table that supports load factor $1 - \\varepsilon$ must incur $\\Omega(\\log \\log \\varepsilon^{-1})$ expected time per operation.\n  Finally, we extend rainbow hashing to the setting where the hash table is dynamically resized over time. Surprisingly, the "},"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":"2409.11280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-17T15:36:06Z","cross_cats_sorted":[],"title_canon_sha256":"9fc55e96cbce2aa0e027b89cfbf99206fd95619678f94c146f909faeda48d55d","abstract_canon_sha256":"87fa3ef9e82e5a2e572643c3b5fdb7e4e169f07d996429dc929baef3a9ac4ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:15.962086Z","signature_b64":"HBkMyzxzpGuhZFFAcMNhifQyg59EcCIZnwlYETIKGnmq4PIO8gm83iP5HaSSv6VMGlGaHPGdC7/fFHcYw9wLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec3fb257d88b925c62325600c3ea199127025fd4ec6fd039da571b3f3ecc14e","last_reissued_at":"2026-07-05T09:08:15.961585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:15.961585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Classical Open Addressing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bender, Renfei Zhou, William Kuszmaul","submitted_at":"2024-09-17T15:36:06Z","abstract_excerpt":"We introduce a classical open-addressed hash table, called rainbow hashing, that supports a load factor of up to $1 - \\varepsilon$, while also supporting $O(1)$ expected-time queries, and $O(\\log \\log \\varepsilon^{-1})$ expected-time insertions and deletions. We further prove that this tradeoff curve is optimal: any classical open-addressed hash table that supports load factor $1 - \\varepsilon$ must incur $\\Omega(\\log \\log \\varepsilon^{-1})$ expected time per operation.\n  Finally, we extend rainbow hashing to the setting where the hash table is dynamically resized over time. Surprisingly, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.11280","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.11280/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":"2409.11280","created_at":"2026-07-05T09:08:15.961658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.11280v1","created_at":"2026-07-05T09:08:15.961658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.11280","created_at":"2026-07-05T09:08:15.961658+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3B7WJL5RC4S","created_at":"2026-07-05T09:08:15.961658+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3B7WJL5RC4SLRRD","created_at":"2026-07-05T09:08:15.961658+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3B7WJL5","created_at":"2026-07-05T09:08:15.961658+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/L3B7WJL5RC4SLRRDEVQAYPVBTE","json":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE.json","graph_json":"https://pith.science/api/pith-number/L3B7WJL5RC4SLRRDEVQAYPVBTE/graph.json","events_json":"https://pith.science/api/pith-number/L3B7WJL5RC4SLRRDEVQAYPVBTE/events.json","paper":"https://pith.science/paper/L3B7WJL5"},"agent_actions":{"view_html":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE","download_json":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE.json","view_paper":"https://pith.science/paper/L3B7WJL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.11280&json=true","fetch_graph":"https://pith.science/api/pith-number/L3B7WJL5RC4SLRRDEVQAYPVBTE/graph.json","fetch_events":"https://pith.science/api/pith-number/L3B7WJL5RC4SLRRDEVQAYPVBTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE/action/storage_attestation","attest_author":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE/action/author_attestation","sign_citation":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE/action/citation_signature","submit_replication":"https://pith.science/pith/L3B7WJL5RC4SLRRDEVQAYPVBTE/action/replication_record"}},"created_at":"2026-07-05T09:08:15.961658+00:00","updated_at":"2026-07-05T09:08:15.961658+00:00"}