{"as_of":"2026-08-18T15:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a2f87023f0b0665a7e10333855feae33e2b04099df2424d67c8742a7765808e","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:56:02.876039Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.10655/citation-record","integrity":"/paper/2412.10655/integrity","json":"/paper/2412.10655/citation-record.json","paper":"/paper/2412.10655"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.688459Z","title":"Bender, Mart \\'i n Farach-Colton , John Kuszmaul, William Kuszmaul, and Mingmou Liu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.688459Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:8a9c9eee27235146b81c8e2a995c1552db1b18a2bc4c7adac5134cd520f1c577","observation_id":"14142ba7-034b-424a-b745-f4e2e8744532","resolution":{"observed_at":"2026-08-11T15:56:02.688459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.490162Z","title":"Karp, Marek Karpinski, Michael Luby, and David Zuckerman","venue":null,"work_id":"fde54fee-624f-4c4e-9899-0ec450303474","year":1995},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.694659Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:1c4a232162e7544e470a8e7d80869f62c909b37a8e44655f376e3c4e6e5825cd","observation_id":"2e85541c-e298-401a-acde-0721b7d6c0e9","resolution":{"observed_at":"2026-08-11T15:56:03.495853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.472296Z","title":"Ian Munro","venue":null,"work_id":"47402f36-e88e-4305-be3b-ffcabb756c07","year":1999},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.700208Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:75637fb5e96ffc9ff69e947c324e2aa2d2dc34201bd7d3f55ea17f468ebe3be9","observation_id":"0ae684ed-d1a0-4c8b-a274-3f9075af4355","resolution":{"observed_at":"2026-08-11T15:56:03.477853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.454802Z","title":"Are bitvectors optimal? SIAM J","venue":null,"work_id":"a4336d29-2979-4201-be0a-2d5b58d54b35","year":2002},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.705602Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:3e9492817c95c3c61e4005d8bda87317e850b3bd22958b8a536dd214e3788bd1","observation_id":"d6ffb786-dd04-46a5-9ffe-4d88d2b8bb2f","resolution":{"observed_at":"2026-08-11T15:56:03.460213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.712534Z","title":"Cormen, Charles E","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.712534Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:e399e342aac002674fed71e3ef5e6e42839ff19af24b6b501a9932c7a6dcb606","observation_id":"f18c9ac6-aeed-4573-80e4-c8c06c784ef6","resolution":{"observed_at":"2026-08-11T15:56:02.712534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.419104Z","title":null,"venue":null,"work_id":"5106e98b-fb16-467b-93cd-89fbe5219076","year":1979},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.717762Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:c81039f920ccedcc398607cd3ed0fc8df8674443070f5039a407a5db10365032","observation_id":"a54bb25a-59b8-4b9e-bbb5-2a95a9deaced","resolution":{"observed_at":"2026-08-11T15:56:03.424473Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.401738Z","title":"Changing base without losing space","venue":null,"work_id":"04811e0a-2bce-4998-9df1-d0fa4b97fffe","year":2010},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.723837Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:e2f9c541427dc9e45b562964b895b90e2fd3430c1bca0bb5f2b6d2dad527a4fc","observation_id":"9dd42bf0-8fd7-44d0-8479-c8e7f5a1bc08","resolution":{"observed_at":"2026-08-11T15:56:03.407808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.383427Z","title":"Constant-time retrieval with O( m) extra bits","venue":null,"work_id":"378386f3-6869-4800-8e82-814548422f21","year":2019},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.728887Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:83e54124d72e10260442af9f2ed7429a1639c60547ad158c843136ddac1beb17","observation_id":"02bc95b8-0706-4a04-943d-892be67a38b7","resolution":{"observed_at":"2026-08-11T15:56:03.388913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.367702Z","title":"Fredman, J \\'a nos Koml \\'o s, and Endre Szemer \\'e di","venue":null,"work_id":"0a03ee93-fe9a-4319-9f96-11b8c64198bb","year":1984},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.735254Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:d0056e29984356689b9285bc54f81b79b87414c127ca5b0cbafa1071de0e2781","observation_id":"9fd0e300-776e-4d37-970e-46763c2307e6","resolution":{"observed_at":"2026-08-11T15:56:03.372702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.347193Z","title":"Fich and Peter Bro Miltersen","venue":null,"work_id":"5328be59-af19-4b68-b47b-cfe031fb5ce0","year":1995},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.740120Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:dd11138a1ea80c2b56a50324947eb10fe3ae83220ee875404c10d7d537077cee","observation_id":"288bc994-31c3-44b7-88e3-405adea49493","resolution":{"observed_at":"2026-08-11T15:56:03.353604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.327929Z","title":"Implicit O(1) probe search","venue":null,"work_id":"f905894e-22fd-4dd3-bc9c-56769e01d7a3","year":1993},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.745261Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:5529c69aff25d71ec60073f2cb7bd2787fe5e9fe639d8811c2fc7e742d34556d","observation_id":"70df422f-7d1e-4bd0-a007-8f712699b611","resolution":{"observed_at":"2026-08-11T15:56:03.333303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.310504Z","title":"Schmidt, and Alan Siegel","venue":null,"work_id":"1eae64a4-ea62-4eb5-874d-31c21aa1bdc5","year":1992},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.750662Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:0b6681643d07f074ea747465b8cb1288734039393dac181491b31f27ef1d2d4e","observation_id":"afdf8979-5cc1-4239-b407-1bdd56c68828","resolution":{"observed_at":"2026-08-11T15:56:03.315483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.292438Z","title":"Cell probe lower bounds for succinct data structures","venue":null,"work_id":"f02632ff-ebfb-4a26-8742-d80675873dd1","year":2009},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.757026Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:4082d5d310519903b345302ea7e3158b3c485b7d7d13de45449dcd511e623721","observation_id":"d0119776-1092-4b89-8a56-b3d692f466df","resolution":{"observed_at":"2026-08-11T15:56:03.298564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.275936Z","title":"On representatives of subsets","venue":null,"work_id":"64b247a7-dc3d-49ee-b3c2-590cedc28673","year":1935},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.762503Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:f70d57ded77a5f1b9fa41bf8bb79e4410ec871555cd2d9561c0dc74ac518f414","observation_id":"60370aef-ca95-4a62-8e6a-a9b232eed6fb","resolution":{"observed_at":"2026-08-11T15:56:03.281062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.256972Z","title":"Efficient minimal perfect hashing in nearly minimal space","venue":null,"work_id":"28c41f0e-bea2-4b80-92b0-daa24ee8331b","year":2010},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.767409Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:7bef425091b7b22c327c5c13910516cb73b569a6129feee02b018ab4b66add54","observation_id":"0f9d6ec4-8aac-41e2-9016-ec39a7eef546","resolution":{"observed_at":"2026-08-11T15:56:03.262998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02318","last_updated":"2022-02-09T08:15:23Z","snapshot_observed_at":"2026-08-16T17:44:16.986320Z","submitted_at":"2021-11-03T16:11:22Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02318","snapshot_observed_at":"2026-08-11T15:56:02.772490Z","title":"Nearly tight lower bounds for succinct range minimum query","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.772490Z"},"links":{"cited_paper":"/paper/2111.02318","citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:f5a2f37075fdf3237677183f816bbbcca45bc1cfd82bcc1125814798b51725b3","observation_id":"7d4fb7e6-90b9-43ef-9d70-bc200814d1eb","resolution":{"observed_at":"2026-08-11T15:56:02.772490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.777698Z","title":"Tight cell-probe lower bounds for dynamic succinct dictionaries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.777698Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:67a45da4415b59fd51fbde8f7114a2720367798df6f0a459345e08afbecff801","observation_id":"4be4b31d-3f87-4a65-bec3-d3f14990582e","resolution":{"observed_at":"2026-08-11T15:56:02.777698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.782517Z","title":"Dynamic dictionary with subconstant wasted bits per key","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.782517Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:0a08e28d763b2c2e5902666885538dbde5f808a1bc78f69965ab4fdd2641197e","observation_id":"1279bf34-4d74-48bf-aae0-071f263847c1","resolution":{"observed_at":"2026-08-11T15:56:02.782517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.787385Z","title":"Lower bound for succinct range minimum query","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.787385Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:2d381b37156650fcefad50e052f481b3c8f8a3f45bc9635f18541bce26929fee","observation_id":"524126f1-e021-4e99-bba3-b3ee42c1286f","resolution":{"observed_at":"2026-08-11T15:56:02.787385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.199147Z","title":"Lower bounds for static dictionaries on RAMs with bit operations but no multiplication","venue":null,"work_id":"cf3e2e3d-be3e-4975-a05b-7694415dce8b","year":1996},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.792385Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:0b8c2583277b6e3c66c2af04e561b661814e8b70b4c6c118a3f50eafc9f9db42","observation_id":"eb87224d-4ecf-4078-9ded-802e568bae51","resolution":{"observed_at":"2026-08-11T15:56:03.204989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.181553Z","title":"On data structures and asymmetric communication complexity","venue":null,"work_id":"d90100b4-e1d3-4f77-83f4-29cf3ec0f7f2","year":1998},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.797283Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:c45e761196037a06f1eff0523170d3a3ff7316e0707ca89870f4fb12eebf56b6","observation_id":"93bbbf65-d553-4623-ae7c-5584a47278ef","resolution":{"observed_at":"2026-08-11T15:56:03.188033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.802696Z","title":"Randomized Algorithms","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.802696Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:1b166d1806b3393520c9dfd806834ff513f7eb4e0962e13d35e00a1eebf5f482","observation_id":"b9ab2723-2cf7-4715-9790-2a78ade25cb3","resolution":{"observed_at":"2026-08-11T15:56:02.802696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.151041Z","title":"Private vs","venue":null,"work_id":"99497b5a-7476-4e56-ad8e-1e8d052d5630","year":1991},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.808066Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:44b44ba8017af4b04395a65f10c2b2a1ffa320d5436dbdbd6de7b07355cfe6cc","observation_id":"464cfaf5-4b58-48b3-9ace-dfd01fcb8817","resolution":{"observed_at":"2026-08-11T15:56:03.156583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.133734Z","title":"Low redundancy in static dictionaries with constant query time","venue":null,"work_id":"1bcfe8e8-7e12-48a4-9635-5afcdb27320d","year":2001},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.812839Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:3012b84cc525abb4f40b15f3e78fab3a8ff74ca0ddb11807fdbbcbeccb2a1f9c","observation_id":"78639a46-78e5-42b7-a137-4dab2b70e9ee","resolution":{"observed_at":"2026-08-11T15:56:03.139376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.115616Z","title":"On the cell probe complexity of membership and perfect hashing","venue":null,"work_id":"582ca2f6-eef9-450f-852c-cb6ee3875699","year":2001},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.819303Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:e3f20d909d5ece4cdc79421c1c512520e379a7e366145c46d891a661e720f419","observation_id":"5a04967c-91ac-481b-be62-59668d05e5ef","resolution":{"observed_at":"2026-08-11T15:56:03.121379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.099172Z","title":"Succincter","venue":null,"work_id":"14146106-cb6d-4252-8182-5fefe8aebf58","year":2008},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.824093Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:12142c6b6ea734d09aac355437a375428309f9c42fb6c10f994ebc45d6060b79","observation_id":"3b7848e1-9e9d-4344-bcf6-cbc5df12c385","resolution":{"observed_at":"2026-08-11T15:56:03.104412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.828905Z","title":"Cell-probe lower bounds for succinct partial sums","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.828905Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:d36d1a4de49f8f199702e47d18a8059da355e7ce2877588a968bcf1b1452d10b","observation_id":"627fa2d8-c146-4890-9551-2c79f29c8b36","resolution":{"observed_at":"2026-08-11T15:56:02.828905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.072770Z","title":"A Chebychev's type of prime number theorem in a short interval II","venue":null,"work_id":"35d54b0f-6321-46ae-9eeb-ee792fdbaac5","year":1992},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.833960Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:d653e2092d167b8b414ec8c287ab4e2530506ab05cc17b688bbfd444353c83ab","observation_id":"958823d3-9e16-4ea1-a325-158ed4cfe003","resolution":{"observed_at":"2026-08-11T15:56:03.077899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.056901Z","title":"Schmidt and Alan Siegel","venue":null,"work_id":"a8c1394d-74ac-41db-a131-4803ef2038a9","year":1990},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.838989Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:53516ccfd6b7a2cb634ca3e8aec624bb9ac1a84c8d6f44ba42ad8cd15a305130","observation_id":"d2fd2932-9411-4516-8f48-27a6d4c34d83","resolution":{"observed_at":"2026-08-11T15:56:03.061531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.038712Z","title":"Schmidt, Alan Siegel, and Aravind Srinivasan","venue":null,"work_id":"eee61642-8006-416e-8eef-e0df38c39f7c","year":1995},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.844256Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:890453de26d52d0780bb40faf25ee792508f0ecb90be0415bd8a79c0ce721405","observation_id":"e758754b-f1fb-4dd0-91b8-0ab1ff2b20b4","resolution":{"observed_at":"2026-08-11T15:56:03.045138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.018479Z","title":"Simple tabulation, fast expanders, double tabulation, and high independence","venue":null,"work_id":"d82a38cd-d3c9-4606-952a-82fbf3eab23d","year":2013},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.849782Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:ffe2061f4a7ed8d0f14d6ededa3aac68ca72ec1ad8cc571b75a009c7e8a3c2ea","observation_id":"1a549def-bb76-4efd-a064-65afc2a554e0","resolution":{"observed_at":"2026-08-11T15:56:03.024544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:03.001193Z","title":"Storing a sparse table","venue":null,"work_id":"7c8dcdf8-0d02-4e94-912e-5f9579518b21","year":1979},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.855298Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:75f103acc9810f0572c3be1f72d15927cb63f4f39c59291f7b821652e6871dfb","observation_id":"16f517bd-354b-48c3-b9cc-93cb4e796d4d","resolution":{"observed_at":"2026-08-11T15:56:03.006251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.984250Z","title":"Bit-probe lower bounds for succinct data structures","venue":null,"work_id":"0bb94fd1-4a1f-4a23-a83d-766556029d53","year":2012},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.860983Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:e42dc115ba29ff4cdff33e11b8e65626fe6015446cba6abbf7de2ef460c95382","observation_id":"7b33c336-4302-4fc6-9cee-88c2840c3b2a","resolution":{"observed_at":"2026-08-11T15:56:02.989743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.966403Z","title":"New sampling lower bounds via the separator","venue":null,"work_id":"4b378adb-b4f9-442c-a1ba-09509ca8864b","year":2023},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.865980Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:8bb372fe0174667482342bb67d50ce9b3eef84e669f44db1066ae72a9381015d","observation_id":"ae4aa484-fd2f-4b5d-b353-6b8489909130","resolution":{"observed_at":"2026-08-11T15:56:02.971444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.949786Z","title":"Should tables be sorted? J","venue":null,"work_id":"3d6cd9b4-75e2-4a4c-8313-e7b59c5f5017","year":1981},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.871288Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:28472c9d989a09cbed19c9b1774f6769363bdab57d3a12efb778f5f99c66f036","observation_id":"9b25327b-ef84-4aa5-8e51-9f66b93f0f1b","resolution":{"observed_at":"2026-08-11T15:56:02.954687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:56:02.929652Z","title":"Nearly optimal static Las Vegas succinct dictionary","venue":null,"work_id":"14bd4c2a-4d7b-4f93-b736-10fcb3b7da0f","year":2020},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.876039Z"},"links":{"citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:bb7954eb659c6aeaec8d6100a7e2fa807b793920afd2ee5ff0dcd12fa422a3ef","observation_id":"72365b63-e05f-441e-81e0-eb1dce1f63e9","resolution":{"observed_at":"2026-08-11T15:56:02.936771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2412.10655."}