{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JSDWYNJ4GBG57FVMSPIZBF7FUU","short_pith_number":"pith:JSDWYNJ4","schema_version":"1.0","canonical_sha256":"4c876c353c304ddf96ac93d19097e5a50b84d6ba23f93b43dde2bfac1bbcf59c","source":{"kind":"arxiv","id":"2607.16390","version":1},"attestation_state":"computed","paper":{"title":"Locality in Open Addressing Hash Tables","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Or Zamir","submitted_at":"2026-07-17T17:58:13Z","abstract_excerpt":"Open-addressed hash tables without reordering, such as linear probing and uniform probing, are among the simplest and most widely used data structures. Their performance is traditionally measured by probe count. We study a complementary parameter: locality, defined as the geometric distance from the first probed location to the farthest cell inspected or used.\n  At load factor $1-\\varepsilon$, uniform probing achieves the optimal $\\Theta(1/\\varepsilon)$ probe count among greedy schemes, but has essentially no locality, whereas linear probing is highly local but performs $\\Theta(1/\\varepsilon^2"},"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":"2607.16390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-17T17:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"dd72762110468f6d88683ee5bd43cf3bb51842f46342242fc18bfda8e95bb7ec","abstract_canon_sha256":"2c6ec10ab6e5c514ad87c77f70143b5f5973485cc756c1796d4b70d021c22fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T00:20:15.423574Z","signature_b64":"DqZWH4nOETE/YZPUq/Fb2Ncxj27vO+NdRoe5kYTruQkpCooUux4/v2RPncNzQGS3kRgSs+bP9VgD6rkwYLWoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c876c353c304ddf96ac93d19097e5a50b84d6ba23f93b43dde2bfac1bbcf59c","last_reissued_at":"2026-07-21T00:20:15.422756Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T00:20:15.422756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality in Open Addressing Hash Tables","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Or Zamir","submitted_at":"2026-07-17T17:58:13Z","abstract_excerpt":"Open-addressed hash tables without reordering, such as linear probing and uniform probing, are among the simplest and most widely used data structures. Their performance is traditionally measured by probe count. We study a complementary parameter: locality, defined as the geometric distance from the first probed location to the farthest cell inspected or used.\n  At load factor $1-\\varepsilon$, uniform probing achieves the optimal $\\Theta(1/\\varepsilon)$ probe count among greedy schemes, but has essentially no locality, whereas linear probing is highly local but performs $\\Theta(1/\\varepsilon^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16390","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/2607.16390/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":"2607.16390","created_at":"2026-07-21T00:20:15.423167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16390v1","created_at":"2026-07-21T00:20:15.423167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16390","created_at":"2026-07-21T00:20:15.423167+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSDWYNJ4GBG5","created_at":"2026-07-21T00:20:15.423167+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSDWYNJ4GBG57FVM","created_at":"2026-07-21T00:20:15.423167+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSDWYNJ4","created_at":"2026-07-21T00:20:15.423167+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/JSDWYNJ4GBG57FVMSPIZBF7FUU","json":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU.json","graph_json":"https://pith.science/api/pith-number/JSDWYNJ4GBG57FVMSPIZBF7FUU/graph.json","events_json":"https://pith.science/api/pith-number/JSDWYNJ4GBG57FVMSPIZBF7FUU/events.json","paper":"https://pith.science/paper/JSDWYNJ4"},"agent_actions":{"view_html":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU","download_json":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU.json","view_paper":"https://pith.science/paper/JSDWYNJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16390&json=true","fetch_graph":"https://pith.science/api/pith-number/JSDWYNJ4GBG57FVMSPIZBF7FUU/graph.json","fetch_events":"https://pith.science/api/pith-number/JSDWYNJ4GBG57FVMSPIZBF7FUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU/action/storage_attestation","attest_author":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU/action/author_attestation","sign_citation":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU/action/citation_signature","submit_replication":"https://pith.science/pith/JSDWYNJ4GBG57FVMSPIZBF7FUU/action/replication_record"}},"created_at":"2026-07-21T00:20:15.423167+00:00","updated_at":"2026-07-21T00:20:15.423167+00:00"}