Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-10T22:31:07.609526Z
Paper Citation Record · LEDGER
Optimal Bounds for Open Addressing Without Reordering
As of 20 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 2 inbound Pith citation observations for arXiv:2501.02305.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-03T01:31:45.965915Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
21 of 21 outbound references displayed
- verified exact1
- verified fuzzy17
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch1
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 37dd5441-79d4-4d8f-91fb-c63bf02316c9 · outbound
This paper cites There is no fast single hashing algorithm.
Optimal Bounds for Open Addressing Without Reordering There is no fast single hashing algorithm
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.226713Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 3f500f33-1ae0-4a0c-9378-894db60156e7 · outbound
This paper cites Iceberg hashing: Optimizing many hash-table c riteria at once.
Optimal Bounds for Open Addressing Without Reordering Iceberg hashing: Optimizing many hash-table c riteria at once
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.209600Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 9ecac62f-77c3-4b13-b08a-8460e76dfd04 · outbound
This paper cites Bender, Alex Conway, Mart ´ ın Farach-Colton, William Kuszmaul, and Guido Tagliavini.
Optimal Bounds for Open Addressing Without Reordering Bender, Alex Conway, Mart ´ ın Farach-Colton, William Kuszmaul, and Guido Tagliavini
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T22:31:07.512874Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 03b8a638-040a-47ad-a962-1a1d559bdbb5 · outbound
This paper cites Bender, Martin Farach-Colton, Simai He, Brad ley C.
Optimal Bounds for Open Addressing Without Reordering Bender, Martin Farach-Colton, Simai He, Brad ley C
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.192989Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 5d48fd57-12d0-4c0d-866c-aaa93c185bf6 · outbound
This paper cites Balanced allocations: the heavily loaded case.
Optimal Bounds for Open Addressing Without Reordering Balanced allocations: the heavily loaded case
Reference 5
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-10T22:31:07.937901Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation a87fcd9e-0ecd-4e82-841e-3ce26a18d48d · outbound
This paper cites Reducing the retrieval time of scatter s torage techniques.
Optimal Bounds for Open Addressing Without Reordering Reducing the retrieval time of scatter s torage techniques
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.177530Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation be7b2e46-c4ce-4254-a8a1-ab8c92f12b76 · outbound
This paper cites Multilevel adaptive ha shing.
Optimal Bounds for Open Addressing Without Reordering Multilevel adaptive ha shing
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.162037Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 90c3f3a0-f690-442c-956e-70d0a4f69073 · outbound
This paper cites External double hashing with choice.
Optimal Bounds for Open Addressing Without Reordering External double hashing with choice
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.142362Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 1651c86f-1e26-4550-9c12-294fc42f78e7 · outbound
This paper cites Space efficient hash tables with worst case constant access time.
Optimal Bounds for Open Addressing Without Reordering Space efficient hash tables with worst case constant access time
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.124253Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 9cdc0fdf-7b48-4dc2-a503-2e4340c80c8e · outbound
This paper cites Efficient ordering of hash tables.
Optimal Bounds for Open Addressing Without Reordering Efficient ordering of hash tables
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.109170Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 03a9f995-f12c-402c-ae56-2bda55321284 · outbound
This paper cites Notes on “open” addressing.
Optimal Bounds for Open Addressing Without Reordering Notes on “open” addressing
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.092958Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation a86cff96-885d-4166-b664-5a8998eb2102 · outbound
This paper cites Computer science and its relation to mat hematics.
Optimal Bounds for Open Addressing Without Reordering Computer science and its relation to mat hematics
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.077005Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation d1aed1bc-2977-47f3-b127-485eb2abfc9a · outbound
This paper cites The Art of Computer Programming, Volume III: Sorting and Searchin g.
Optimal Bounds for Open Addressing Without Reordering The Art of Computer Programming, Volume III: Sorting and Searchin g
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T22:31:07.566014Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 513e73ef-2f42-45cd-a598-4b76afc96fa0 · outbound
This paper cites More analysis of double hashing.
Optimal Bounds for Open Addressing Without Reordering More analysis of double hashing
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.061148Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation b29a2b25-bc6b-44af-a55a-0d4566c8794e · outbound
This paper cites Double hashing wit h multiple passbits.
Optimal Bounds for Open Addressing Without Reordering Double hashing wit h multiple passbits
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.044160Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 6b34e748-4a1d-433a-a0b4-e628d1a929ef · outbound
This paper cites Analysis and design of algorithms: double hashing and paral lel graph searching.
Optimal Bounds for Open Addressing Without Reordering Analysis and design of algorithms: double hashing and paral lel graph searching
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.026371Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 86305575-f73f-49ba-8352-0b0cffc6e1df · outbound
This paper cites Techniques for collision re solution in hash tables with open addressing.
Optimal Bounds for Open Addressing Without Reordering Techniques for collision re solution in hash tables with open addressing
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:08.008372Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ed00ab2f-1b5e-4ea9-a189-7e8c65725bb9 · outbound
This paper cites Hashing with Linear Probing and Referential Integrity.
Optimal Bounds for Open Addressing Without Reordering Hashing with Linear Probing and Referential Integrity
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-10T22:31:07.668915Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation bf5f2931-ba87-45b1-a4e4-36e55d80c78c · outbound
This paper cites A note on the efficiency of hashing functio ns.
Optimal Bounds for Open Addressing Without Reordering A note on the efficiency of hashing functio ns
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:07.990911Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 692866a7-0526-42d4-9903-50c7e7d91af0 · outbound
This paper cites How asymmetry helps load balancing.
Optimal Bounds for Open Addressing Without Reordering How asymmetry helps load balancing
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:07.972874Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 1a309487-399e-44d7-8edc-b64712e2f806 · outbound
This paper cites Uniform hashing is optimal.
Optimal Bounds for Open Addressing Without Reordering Uniform hashing is optimal
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T22:31:07.956166Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Pith citing papers
Observation 4bf871e1-8ff6-4d38-bf75-97cc2eafdb47 · inbound
Locality in Open Addressing Hash Tables cites this paper.
Locality in Open Addressing Hash Tables Optimal Bounds for Open Addressing Without Reordering
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T21:18:15.810931Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation beb3d970-567f-4356-a4b3-8e057ca37624 · inbound
Succinct and Fast Tiny Pointer Hash Tables cites this paper.
Succinct and Fast Tiny Pointer Hash Tables Optimal Bounds for Open Addressing Without Reordering
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T01:31:45.965915Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.