{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PEAJXHHFRJYZ7JB277KCCFGG2M","short_pith_number":"pith:PEAJXHHF","schema_version":"1.0","canonical_sha256":"79009b9ce58a719fa43affd42114c6d30ea14547d9308a6ca57286252662bec7","source":{"kind":"arxiv","id":"2503.13628","version":1},"attestation_state":"computed","paper":{"title":"Optimal Non-Oblivious 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":"2025-03-17T18:23:54Z","abstract_excerpt":"A hash table is said to be open-addressed (or non-obliviously open-addressed) if it stores elements (and free slots) in an array with no additional metadata. Intuitively, open-addressed hash tables must incur a space-time tradeoff: The higher the load factor at which the hash table operates, the longer insertions/deletions/queries should take.\n  In this paper, we show that no such tradeoff exists: It is possible to construct an open-addressed hash table that supports constant-time operations even when the hash table is entirely full. In fact, it is even possible to construct a version of this "},"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":"2503.13628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-17T18:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"34c29482251e458d4d64a799388e1797047fc41bb3001963291cfe9ab3958be2","abstract_canon_sha256":"ea44c0c0f36a72fbe316392a9ef59f294e9ba2c73cf4b78bbfee9d4cc8bebb91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:14.452923Z","signature_b64":"hJ+VqIaCVDd6jxHDATsB4bvg24L1+v2cdRfXkUPfGBIh/CpFrqbA5cPZLs9Xbf2MBc/CXh2Obk74VhcGMseWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79009b9ce58a719fa43affd42114c6d30ea14547d9308a6ca57286252662bec7","last_reissued_at":"2026-07-05T10:33:14.452306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:14.452306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Non-Oblivious 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":"2025-03-17T18:23:54Z","abstract_excerpt":"A hash table is said to be open-addressed (or non-obliviously open-addressed) if it stores elements (and free slots) in an array with no additional metadata. Intuitively, open-addressed hash tables must incur a space-time tradeoff: The higher the load factor at which the hash table operates, the longer insertions/deletions/queries should take.\n  In this paper, we show that no such tradeoff exists: It is possible to construct an open-addressed hash table that supports constant-time operations even when the hash table is entirely full. In fact, it is even possible to construct a version of this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13628","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/2503.13628/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":"2503.13628","created_at":"2026-07-05T10:33:14.452388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13628v1","created_at":"2026-07-05T10:33:14.452388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13628","created_at":"2026-07-05T10:33:14.452388+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEAJXHHFRJYZ","created_at":"2026-07-05T10:33:14.452388+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEAJXHHFRJYZ7JB2","created_at":"2026-07-05T10:33:14.452388+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEAJXHHF","created_at":"2026-07-05T10:33:14.452388+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/PEAJXHHFRJYZ7JB277KCCFGG2M","json":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M.json","graph_json":"https://pith.science/api/pith-number/PEAJXHHFRJYZ7JB277KCCFGG2M/graph.json","events_json":"https://pith.science/api/pith-number/PEAJXHHFRJYZ7JB277KCCFGG2M/events.json","paper":"https://pith.science/paper/PEAJXHHF"},"agent_actions":{"view_html":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M","download_json":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M.json","view_paper":"https://pith.science/paper/PEAJXHHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13628&json=true","fetch_graph":"https://pith.science/api/pith-number/PEAJXHHFRJYZ7JB277KCCFGG2M/graph.json","fetch_events":"https://pith.science/api/pith-number/PEAJXHHFRJYZ7JB277KCCFGG2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M/action/storage_attestation","attest_author":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M/action/author_attestation","sign_citation":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M/action/citation_signature","submit_replication":"https://pith.science/pith/PEAJXHHFRJYZ7JB277KCCFGG2M/action/replication_record"}},"created_at":"2026-07-05T10:33:14.452388+00:00","updated_at":"2026-07-05T10:33:14.452388+00:00"}