Paper Citation Record · LEDGER

Optimal Static Dictionary with Worst-Case Constant Query Time

As of 14 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2412.10655.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.10655 v2

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T15:56:02.876039Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

36 of 36 outbound references displayed

verified exact0
verified fuzzy27
unresolved9
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 14142ba7-034b-424a-b745-f4e2e8744532 · outbound

This paper cites Bender, Mart \'i n Farach-Colton , John Kuszmaul, William Kuszmaul, and Mingmou Liu.

Optimal Static Dictionary with Worst-Case Constant Query Time Bender, Mart \'i n Farach-Colton , John Kuszmaul, William Kuszmaul, and Mingmou Liu

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.688459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e85541c-e298-401a-acde-0721b7d6c0e9 · outbound

This paper cites Karp, Marek Karpinski, Michael Luby, and David Zuckerman.

Optimal Static Dictionary with Worst-Case Constant Query Time Karp, Marek Karpinski, Michael Luby, and David Zuckerman

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.495853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 0ae684ed-d1a0-4c8b-a274-3f9075af4355 · outbound

This paper cites Ian Munro.

Optimal Static Dictionary with Worst-Case Constant Query Time Ian Munro

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.477853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation d6ffb786-dd04-46a5-9ffe-4d88d2b8bb2f · outbound

This paper cites Are bitvectors optimal? SIAM J.

Optimal Static Dictionary with Worst-Case Constant Query Time Are bitvectors optimal? SIAM J

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.460213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f18c9ac6-aeed-4573-80e4-c8c06c784ef6 · outbound

This paper cites Cormen, Charles E.

Optimal Static Dictionary with Worst-Case Constant Query Time Cormen, Charles E

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.712534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a54bb25a-59b8-4b9e-bbb5-2a95a9deaced · outbound

This paper cites an unresolved cited work.

Optimal Static Dictionary with Worst-Case Constant Query Time Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-11T15:56:03.424473Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 9dd42bf0-8fd7-44d0-8479-c8e7f5a1bc08 · outbound

This paper cites Changing base without losing space.

Optimal Static Dictionary with Worst-Case Constant Query Time Changing base without losing space

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.407808Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 02bc95b8-0706-4a04-943d-892be67a38b7 · outbound

This paper cites Constant-time retrieval with O( m) extra bits.

Optimal Static Dictionary with Worst-Case Constant Query Time Constant-time retrieval with O( m) extra bits

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.388913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 9fd0e300-776e-4d37-970e-46763c2307e6 · outbound

This paper cites Fredman, J \'a nos Koml \'o s, and Endre Szemer \'e di.

Optimal Static Dictionary with Worst-Case Constant Query Time Fredman, J \'a nos Koml \'o s, and Endre Szemer \'e di

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.372702Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 288bc994-31c3-44b7-88e3-405adea49493 · outbound

This paper cites Fich and Peter Bro Miltersen.

Optimal Static Dictionary with Worst-Case Constant Query Time Fich and Peter Bro Miltersen

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.353604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 70df422f-7d1e-4bd0-a007-8f712699b611 · outbound

This paper cites Implicit O(1) probe search.

Optimal Static Dictionary with Worst-Case Constant Query Time Implicit O(1) probe search

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.333303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation afdf8979-5cc1-4239-b407-1bdd56c68828 · outbound

This paper cites Schmidt, and Alan Siegel.

Optimal Static Dictionary with Worst-Case Constant Query Time Schmidt, and Alan Siegel

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.315483Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation d0119776-1092-4b89-8a56-b3d692f466df · outbound

This paper cites Cell probe lower bounds for succinct data structures.

Optimal Static Dictionary with Worst-Case Constant Query Time Cell probe lower bounds for succinct data structures

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.298564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 60370aef-ca95-4a62-8e6a-a9b232eed6fb · outbound

This paper cites On representatives of subsets.

Optimal Static Dictionary with Worst-Case Constant Query Time On representatives of subsets

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.281062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 0f9d6ec4-8aac-41e2-9016-ec39a7eef546 · outbound

This paper cites Efficient minimal perfect hashing in nearly minimal space.

Optimal Static Dictionary with Worst-Case Constant Query Time Efficient minimal perfect hashing in nearly minimal space

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.262998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 7d4fb7e6-90b9-43ef-9d70-bc200814d1eb · outbound

This paper cites Nearly Tight Lower Bounds for Succinct Range Minimum Query.

Optimal Static Dictionary with Worst-Case Constant Query Time Nearly Tight Lower Bounds for Succinct Range Minimum Query

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.772490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4be4b31d-3f87-4a65-bec3-d3f14990582e · outbound

This paper cites Tight cell-probe lower bounds for dynamic succinct dictionaries.

Optimal Static Dictionary with Worst-Case Constant Query Time Tight cell-probe lower bounds for dynamic succinct dictionaries

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.777698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1279bf34-4d74-48bf-aae0-071f263847c1 · outbound

This paper cites Dynamic dictionary with subconstant wasted bits per key.

Optimal Static Dictionary with Worst-Case Constant Query Time Dynamic dictionary with subconstant wasted bits per key

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.782517Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 524126f1-e021-4e99-bba3-b3ee42c1286f · outbound

This paper cites Lower bound for succinct range minimum query.

Optimal Static Dictionary with Worst-Case Constant Query Time Lower bound for succinct range minimum query

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.787385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb87224d-4ecf-4078-9ded-802e568bae51 · outbound

This paper cites Lower bounds for static dictionaries on RAMs with bit operations but no multiplication.

Optimal Static Dictionary with Worst-Case Constant Query Time Lower bounds for static dictionaries on RAMs with bit operations but no multiplication

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.204989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 93bbbf65-d553-4623-ae7c-5584a47278ef · outbound

This paper cites On data structures and asymmetric communication complexity.

Optimal Static Dictionary with Worst-Case Constant Query Time On data structures and asymmetric communication complexity

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.188033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation b9ab2723-2cf7-4715-9790-2a78ade25cb3 · outbound

This paper cites Randomized Algorithms.

Optimal Static Dictionary with Worst-Case Constant Query Time Randomized Algorithms

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.802696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 464cfaf5-4b58-48b3-9ace-dfd01fcb8817 · outbound

This paper cites Private vs.

Optimal Static Dictionary with Worst-Case Constant Query Time Private vs

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.156583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 78639a46-78e5-42b7-a137-4dab2b70e9ee · outbound

This paper cites Low redundancy in static dictionaries with constant query time.

Optimal Static Dictionary with Worst-Case Constant Query Time Low redundancy in static dictionaries with constant query time

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.139376Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 5a04967c-91ac-481b-be62-59668d05e5ef · outbound

This paper cites On the cell probe complexity of membership and perfect hashing.

Optimal Static Dictionary with Worst-Case Constant Query Time On the cell probe complexity of membership and perfect hashing

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.121379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 3b7848e1-9e9d-4344-bcf6-cbc5df12c385 · outbound

This paper cites Succincter.

Optimal Static Dictionary with Worst-Case Constant Query Time Succincter

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.104412Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 627fa2d8-c146-4890-9551-2c79f29c8b36 · outbound

This paper cites Cell-probe lower bounds for succinct partial sums.

Optimal Static Dictionary with Worst-Case Constant Query Time Cell-probe lower bounds for succinct partial sums

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-11T15:56:02.828905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 958823d3-9e16-4ea1-a325-158ed4cfe003 · outbound

This paper cites A Chebychev's type of prime number theorem in a short interval II.

Optimal Static Dictionary with Worst-Case Constant Query Time A Chebychev's type of prime number theorem in a short interval II

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.077899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation d2fd2932-9411-4516-8f48-27a6d4c34d83 · outbound

This paper cites Schmidt and Alan Siegel.

Optimal Static Dictionary with Worst-Case Constant Query Time Schmidt and Alan Siegel

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.061531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation e758754b-f1fb-4dd0-91b8-0ab1ff2b20b4 · outbound

This paper cites Schmidt, Alan Siegel, and Aravind Srinivasan.

Optimal Static Dictionary with Worst-Case Constant Query Time Schmidt, Alan Siegel, and Aravind Srinivasan

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.045138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 1a549def-bb76-4efd-a064-65afc2a554e0 · outbound

This paper cites Simple tabulation, fast expanders, double tabulation, and high independence.

Optimal Static Dictionary with Worst-Case Constant Query Time Simple tabulation, fast expanders, double tabulation, and high independence

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.024544Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 16f517bd-354b-48c3-b9cc-93cb4e796d4d · outbound

This paper cites Storing a sparse table.

Optimal Static Dictionary with Worst-Case Constant Query Time Storing a sparse table

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:03.006251Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 7b33c336-4302-4fc6-9cee-88c2840c3b2a · outbound

This paper cites Bit-probe lower bounds for succinct data structures.

Optimal Static Dictionary with Worst-Case Constant Query Time Bit-probe lower bounds for succinct data structures

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:02.989743Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation ae4aa484-fd2f-4b5d-b353-6b8489909130 · outbound

This paper cites New sampling lower bounds via the separator.

Optimal Static Dictionary with Worst-Case Constant Query Time New sampling lower bounds via the separator

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:02.971444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 9b25327b-ef84-4aa5-8e51-9f66b93f0f1b · outbound

This paper cites Should tables be sorted? J.

Optimal Static Dictionary with Worst-Case Constant Query Time Should tables be sorted? J

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:02.954687Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 72365b63-e05f-441e-81e0-eb1dce1f63e9 · outbound

This paper cites Nearly optimal static Las Vegas succinct dictionary.

Optimal Static Dictionary with Worst-Case Constant Query Time Nearly optimal static Las Vegas succinct dictionary

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T15:56:02.936771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Pith citing papers

No inbound Pith citation observations are available.