{"as_of":"2026-08-21T02:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:977211713aa1d0a1abd16f1c4cfe89ae3d1ee1337fbd0742b77ab1b504371282","coverage":[{"denominator":108,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:31:52.626986Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.28892/citation-record","integrity":"/paper/2607.28892/integrity","json":"/paper/2607.28892/citation-record.json","paper":"/paper/2607.28892"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:31:42.676306Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:42.676306Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:2f04b63452c90b1a09249b2e2c8a9bd8b82a44a4cc670858cf39d87af3078d27","observation_id":"ed576750-4e89-4ac5-a5dc-e80e0d1a7bf3","resolution":{"observed_at":"2026-08-03T01:31:42.676306Z","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-03T01:31:42.743327Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:42.743327Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:445dc2ff29294f406efb168e7965a78a813094a3e4cfb22e5e28bcecdc50278d","observation_id":"18c23bc9-9b22-428c-854f-424bc063ff9e","resolution":{"observed_at":"2026-08-03T01:31:42.743327Z","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-03T01:31:42.871759Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:42.871759Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:e418be313e3d16d4a6f90f415cdf713ba2b9d89c709ef008ea1529e5ee5ef529","observation_id":"a02c0d43-bf55-47ae-80df-11e2dd3adff0","resolution":{"observed_at":"2026-08-03T01:31:42.871759Z","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-03T01:31:43.033978Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.033978Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:b998bcf425f8e925cd0accf50a39de4906775ee2b74a088f9f4867853ba8ac4c","observation_id":"a744ad83-de50-4fb0-8f71-de2fbc89caea","resolution":{"observed_at":"2026-08-03T01:31:43.033978Z","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-03T01:31:43.181314Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.181314Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:94ee174a51ecdaf89fdcdef45c6f6f1e9b0f8a632558cc1c79a41fc40f556dbd","observation_id":"34fd6827-3a11-425d-8a60-6d96e6be01f7","resolution":{"observed_at":"2026-08-03T01:31:43.181314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21016","last_updated":"2025-03-26T22:04:41Z","snapshot_observed_at":"2026-08-16T12:46:29.056523Z","submitted_at":"2025-03-26T22:04:41Z","title":"History-Independent Concurrent Hash Tables","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21016","snapshot_observed_at":"2026-08-03T01:31:43.363735Z","title":"Bender, Martín Farach-Colton, Rotem Oshman, and Noa Schiller","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.363735Z"},"links":{"cited_paper":"/paper/2503.21016","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:606747f7f8f4900dd19ab5f1d295dfdcf71b3c939b7a53531b273c5e4439534b","observation_id":"e2dfbe3f-dd35-4602-a72b-2ccdfb25d86a","resolution":{"observed_at":"2026-08-03T01:31:43.363735Z","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":"10.1137/s0097539795288490","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Broder, Anna R","venue":"SIAM Journal on Computing","work_id":"8d03621a-bb9f-445a-9e1b-dabb2fa9bdee","year":1999},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.513116Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:01a31f02d3074140c6cb7d782d3e9c7552253a10fb8bf09fd7873dc798e5e6d0","observation_id":"bbf4f90e-6aa6-4adc-9183-3ca6cf91fea2","resolution":{"observed_at":"2026-08-03T01:33:28.710114Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:06.379971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:06.379971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:43.668584Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.668584Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:6bc76b229a5ea351e1a4c9519d5376080e6185b0aada4f2fee023283c2d77f1c","observation_id":"a46d0c89-e437-4f42-ad1e-6b35e240322e","resolution":{"observed_at":"2026-08-03T01:31:43.668584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06558","last_updated":"2022-05-13T10:57:33Z","snapshot_observed_at":"2026-08-16T17:00:33.712918Z","submitted_at":"2022-05-13T10:57:33Z","title":"Balanced Allocations: The Heavily Loaded Case with Deletions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06558","snapshot_observed_at":"2026-08-03T01:31:43.734448Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.734448Z"},"links":{"cited_paper":"/paper/2205.06558","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:0180fe4d8345600725ca694a2674b294f32cc65f2debd4c9fe211a8c17c095df","observation_id":"f3874ac4-7a98-44c0-9fc3-cd30b602e5fe","resolution":{"observed_at":"2026-08-03T01:31:43.734448Z","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-03T01:31:43.820233Z","title":"Botelho, and Martin Dietzfelbinger","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.820233Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:11d02fe4615097252a008863b80ed9c20d5dca12970c7c57cb2cd72964fa1e6e","observation_id":"f788e2f9-9568-472f-8f66-7278fbb3f3cb","resolution":{"observed_at":"2026-08-03T01:31:43.820233Z","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-03T01:31:43.906656Z","title":"Bender, Alex Conway, Martín Farach-Colton, William Kuszmaul, and Guido Tagliavini","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:43.906656Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:547d40e1ae35b3d7952a930e9ef9d1894754447e5a7d25c7482e46c7fee0fd35","observation_id":"48188c30-e53e-48df-a100-650d42bc4666","resolution":{"observed_at":"2026-08-03T01:31:43.906656Z","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":"10.1137/1.9781611977554.ch21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, and Guido Tagliavini","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"1ba3f72d-19e7-459c-b5ff-cca3a5009653","year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.034717Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5ef3acd0d56a2b3c6f7c2867fe488ca8f322a25250ed785d4ad275ba560b48a6","observation_id":"d9bd8406-3d4e-4e79-bcfa-59b3028510c4","resolution":{"observed_at":"2026-08-03T01:33:28.611470Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:06.613417+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:06.613417+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:44.118704Z","title":"Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.118704Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:e11e79fb4edcd075f834717ddca09bdc0b7ae0fe622422f0c92e3d1bcb03994f","observation_id":"5d28f13f-b499-49bf-a53b-792c53112024","resolution":{"observed_at":"2026-08-03T01:31:44.118704Z","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-03T01:31:44.180788Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.180788Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:25f556fccc143b12df89c361a55e94f28822e618702ca438e867ad2d09a26e98","observation_id":"cb3d304e-f0ed-4e6a-b2b6-7ac63c913594","resolution":{"observed_at":"2026-08-03T01:31:44.180788Z","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-03T01:31:44.292686Z","title":"Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul, and Mingmou Liu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.292686Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:9f6458cd67211d8d40760002f08c0785bc58f56d3777495c9b19a8aa5e657c5f","observation_id":"f1959d32-ca0b-4ccc-b8f3-5898322f13e2","resolution":{"observed_at":"2026-08-03T01:31:44.292686Z","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-03T01:31:44.365039Z","title":"Bender, Bradley C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.365039Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3ec5f495ecff7ef68d4504f9dcaef465cf9618baf9ac282dc2f1bb45e6339304","observation_id":"4cf581fb-c322-4295-8435-4a522cf9f1cf","resolution":{"observed_at":"2026-08-03T01:31:44.365039Z","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":"10.1137/s009753970444435x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Computing","work_id":"f6eedf01-518d-43a2-a591-3f8e5c5776e2","year":2006},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.453095Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:1f3a0e29abcd9146745657961131ca57d0db9c8067c7e74f6aa3848d1948968a","observation_id":"8a67f988-5214-4954-8799-d32a9225f573","resolution":{"observed_at":"2026-08-03T01:33:28.557481Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:06.716914+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:06.716914+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:44.517004Z","title":"Botelho, Rasmus Pagh, and Nivio Ziviani","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.517004Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:bfa43292718f1702b920f3df8be7ea4e7c8491e172699af1b733af6ddeb4e368","observation_id":"23ee78f1-5d98-40bb-aeac-938329576b60","resolution":{"observed_at":"2026-08-03T01:31:44.517004Z","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-03T01:31:44.607232Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.607232Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:46847139bd19c82036841d04e681dbcc6900970be4404a596d475556cf7026fe","observation_id":"6cba1670-847e-4a9a-a3f4-2cfeff01ef6d","resolution":{"observed_at":"2026-08-03T01:31:44.607232Z","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-03T01:31:44.663061Z","title":"Breslow, Dong Ping Zhang, Joseph L","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.663061Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:a22e2ebcad389a6ff95c777f1029fc8f8cce493a662d0802ecf6a678c6791ad8","observation_id":"18f2a8a4-2a29-46d5-9906-d2408638e60b","resolution":{"observed_at":"2026-08-03T01:31:44.663061Z","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-03T01:31:44.724591Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.724591Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:134b3740115211d329ace4fd1b9b1cfa9caea6d9c040cb167a880851262a0d38","observation_id":"446f516a-450a-44d7-8181-399f37c46b2f","resolution":{"observed_at":"2026-08-03T01:31:44.724591Z","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-03T01:31:44.841034Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.841034Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:7d7168a21cdb443fe2999a337873cc47250a99200b355b21d8560e125b7d1e3a","observation_id":"8fc65ee3-35b5-4e06-b634-5cac592150ce","resolution":{"observed_at":"2026-08-03T01:31:44.841034Z","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-03T01:31:44.914805Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.914805Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:dbfb666ca9141144e296e1f15805f9e14cfba8c7f72570975d90b2c9a525ba4c","observation_id":"4254efc1-d2fc-4cc4-aa0c-ed9e25123fb3","resolution":{"observed_at":"2026-08-03T01:31:44.914805Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3725424","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Phillips, and Prashant Pandey","venue":"Proceedings of the ACM on Management of Data","work_id":"c196f79d-abf1-40fa-b501-fe8c64f041fa","year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:44.987265Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:a9fb2c6ef1f329a2be947ec8f049dd0710cc62e0ea21815aba7f4eddac232cb9","observation_id":"f3672279-aa5d-4c1e-a289-65b21224b809","resolution":{"observed_at":"2026-08-03T01:33:28.467348Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:06.816485+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:06.816485+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:45.028671Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.028671Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:c729b4667f8c62a3a8d37eeaa61c47a1f40c1844e4abeef3677625273148d69e","observation_id":"d6f1a619-2dc2-4e0f-840d-5dd701a09309","resolution":{"observed_at":"2026-08-03T01:31:45.028671Z","resolver_source":null,"status":"malformed_identifier"},"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-03T01:31:45.164934Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.164934Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:fe36419a975e3d53538938623aa6e45184a4ce6956936819522cf9fe76096502","observation_id":"98d8c190-f2c3-4f72-abba-0ece2e57a9fc","resolution":{"observed_at":"2026-08-03T01:31:45.164934Z","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-03T01:31:45.235180Z","title":"Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Rus- sell Sears","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.235180Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:280ba16117ba3fb5217fd3f8a6e01d3c53655aae62abcce3639b05697b21fa10","observation_id":"7427f214-5631-406b-885e-bd5ead0c0c0c","resolution":{"observed_at":"2026-08-03T01:31:45.235180Z","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-03T01:31:45.314949Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.314949Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:a37c34e6898497693936ed266bd3cf9b767ff237d38401078aa5aa9107c0d7e9","observation_id":"41601231-8890-4226-be3c-027619fee348","resolution":{"observed_at":"2026-08-03T01:31:45.314949Z","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-03T01:31:45.371571Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.371571Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5136920c183de5a006cb2b4b955b442f96b503574071f14179f56a6ccd01c88a","observation_id":"adac2c3b-204f-4b34-b6fa-dbe4cbcc8006","resolution":{"observed_at":"2026-08-03T01:31:45.371571Z","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-03T01:31:45.449645Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.449645Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:ba77eaa11184482d5a4fdf06873e31ae356ba3ee28c8ab4950c7933dc08e8929","observation_id":"7bf65537-60ac-4fd6-87ee-6d348675d278","resolution":{"observed_at":"2026-08-03T01:31:45.449645Z","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":"10.1137/s0097539791194094","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:33:28.321572Z","title":null,"venue":null,"work_id":"802cd771-6539-4fd2-a103-ee4d5ec3a00a","year":1994},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.545321Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:fcf93b27538f3bd4169060dee32a149115ff90c2261e1b20509a9cb5d8636067","observation_id":"cb1a5b4b-97d4-418a-907c-0f2ffec6d0cb","resolution":{"observed_at":"2026-08-03T01:33:28.371967Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.065549+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.065549+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:45.636807Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.636807Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:b3b17e51f7411422e10e0f733d1ee945d9025ff6ca9fd0e9b16f09ba3b215a9d","observation_id":"27712413-50aa-4735-a6e9-531456260bfc","resolution":{"observed_at":"2026-08-03T01:31:45.636807Z","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-03T01:31:45.735085Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.735085Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:4a470e49dd7a93516b363374fc442cf1d364834681caee395afed0435be0addb","observation_id":"a6ae96a1-33a7-4f67-b441-0ac6921409ad","resolution":{"observed_at":"2026-08-03T01:31:45.735085Z","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-03T01:31:45.820113Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.820113Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:1fcdb835a467f03e115634a8505c83947aef2554a29ad3ff5482f8c1e66e9211","observation_id":"71353a7c-8a48-42de-ac69-58b9310c01d7","resolution":{"observed_at":"2026-08-03T01:31:45.820113Z","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-03T01:31:45.900935Z","title":"Andersen, and Michael Kaminsky","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.900935Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:8d9fe46a81a8a4ab5263597981ce7ed3769dab6d3a495efe552d6e63716a42d7","observation_id":"3b94b763-9195-4b1c-92c0-7a147ee68040","resolution":{"observed_at":"2026-08-03T01:31:45.900935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02305","last_updated":"2025-02-28T15:53:43Z","snapshot_observed_at":"2026-08-11T14:32:54.421501Z","submitted_at":"2025-01-04T14:57:12Z","title":"Optimal Bounds for Open Addressing Without Reordering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02305","snapshot_observed_at":"2026-08-03T01:31:45.965915Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.965915Z"},"links":{"cited_paper":"/paper/2501.02305","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:8ab1b0b1c3379c9e1b99b68a6323bc821c2c3782a6e19f35e301963f2b703ad9","observation_id":"beb3d970-567f-4356-a4b3-8e057ca37624","resolution":{"observed_at":"2026-08-03T01:31:45.965915Z","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-03T01:31:46.029352Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.029352Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:05de3c18e7a8c47316c87ba3f68690b29a3d6865ade3713ce385e7e584707f57","observation_id":"e085e473-44f4-4612-83ec-e39c02671cdf","resolution":{"observed_at":"2026-08-03T01:31:46.029352Z","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-03T01:31:46.090673Z","title":"Fredman, János Komlós, and Endre Szemerédi","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.090673Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:470d96ebf2522e881a40f4acc7b73e81f9e22d6745bc2c3012f0517f2b68bea3","observation_id":"f62ff5c7-03ee-4515-836a-6c1e8c885488","resolution":{"observed_at":"2026-08-03T01:31:46.090673Z","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-03T01:31:46.155299Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.155299Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3336c08fe94efe32cbd590237bd61b478290b7dbaca283557782bc2d0d0eb65b","observation_id":"24ba0c9b-52f8-4206-8fae-013444376bf8","resolution":{"observed_at":"2026-08-03T01:31:46.155299Z","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-03T01:31:46.220263Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.220263Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:59f70fa4c1a0f9372e365c98d87596deac8be055e42cfd7b4b097817b2d882e4","observation_id":"5fc61899-fb70-4513-ab53-279698e9bfe9","resolution":{"observed_at":"2026-08-03T01:31:46.220263Z","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-03T01:31:46.284984Z","title":"Andersen, and Michael Kaminsky","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.284984Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:d0e6c7730e1062faf698c3b863571764a06bb7f78552900d4d45fd89f345d2aa","observation_id":"8aeecfb3-16d1-406a-bc47-70e1e37553b1","resolution":{"observed_at":"2026-08-03T01:31:46.284984Z","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-03T01:31:46.458003Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.458003Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3a1c40a268b950cdf145893bd1e7194a81ecf72830329ea169c1d7f3eb30564f","observation_id":"cbccaae2-6436-4359-8e7e-77f77be26083","resolution":{"observed_at":"2026-08-03T01:31:46.458003Z","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":"10.1007/978-3-031-69766-1_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"10bb65f1-8330-432b-9075-6c0395fd992f","year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.532867Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:cadd219d5dd201e2f2ecbe7785e23104b76283286424f82d7b2fd833d87d65d8","observation_id":"6f2165d4-fcb9-487f-bdb6-f71cbac0b838","resolution":{"observed_at":"2026-08-03T01:33:28.303936Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.257505+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.257505+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:46.598345Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.598345Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:c385b74364c3f2da2b169cc245ab7cc09eeb06c77ead30c298dfde1bda0ac3f1","observation_id":"f1620877-085c-461d-a182-8cd6f5df4fe6","resolution":{"observed_at":"2026-08-03T01:31:46.598345Z","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-03T01:31:46.717595Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.717595Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:85c86e704e019fcf8df8b3ca5951da25493bf397847e1865050bf8787fd52659","observation_id":"b1333804-8a4e-43ad-9b16-0825d91bfb24","resolution":{"observed_at":"2026-08-03T01:31:46.717595Z","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-03T01:31:46.794059Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.794059Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:232ad69e81007d66bc07bc06e59770151f950c075a2419606eeec2701fb0adeb","observation_id":"35c7e863-8c86-46fe-b59c-a19bd9698c56","resolution":{"observed_at":"2026-08-03T01:31:46.794059Z","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-03T01:31:46.898243Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.898243Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:a39a8478285b7c3a1837549756ba6ea1fb60da0b1dd777a0a409812160ca794b","observation_id":"ff5c651b-411f-42b4-a8f6-1db3bb715cf6","resolution":{"observed_at":"2026-08-03T01:31:46.898243Z","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":"10.1145/2629582","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Transactions on Reconfigurable Technology and Systems","work_id":"43b929bc-d3ee-4425-80c0-d98b0b4d9475","year":2015},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:46.969695Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:4f1d6f65d94b0d41a69f8068fd0b1c51f11d9b8d70089edbb3d05fe3a57efd34","observation_id":"9983bdbf-915f-4405-ac9d-8e9fd9ef72a6","resolution":{"observed_at":"2026-08-03T01:33:28.222682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.349133+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.349133+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:47.032118Z","title":"Patel, Brian P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.032118Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3b7a6da25dd3d8083b96e36f51ff359ad7a0e208180004ac04638e86b7c0f0dd","observation_id":"f3bf1f6e-97ea-4eb3-86eb-d825885b039d","resolution":{"observed_at":"2026-08-03T01:31:47.032118Z","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-03T01:31:47.138692Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.138692Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3e0b1289ae1c52cd3be4f94382a67fd41a6e208974d333fee46619794beadb33","observation_id":"eb5cd22e-591e-455a-876b-da1114ed1e34","resolution":{"observed_at":"2026-08-03T01:31:47.138692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.04339","last_updated":"2018-11-14T16:01:27Z","snapshot_observed_at":"2026-08-14T18:29:33.071103Z","submitted_at":"2018-09-12T10:06:41Z","title":"Concurrent Robin Hood Hashing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.04339","snapshot_observed_at":"2026-08-03T01:31:47.183650Z","title":"Pearlmutter, and Phil Maguire","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.183650Z"},"links":{"cited_paper":"/paper/1809.04339","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:b36aa2ebe5039f155f14dde15c9e55b432986d62dd8a74cddbc94da0426b0090","observation_id":"2591ea46-f327-4416-b564-070f72ce4cd5","resolution":{"observed_at":"2026-08-03T01:31:47.183650Z","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-03T01:31:47.247210Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.247210Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:76fe5beb4c93ef2a921e5094530bc487edd64490ae937d0a5377ae3e229473d7","observation_id":"93ea819e-222d-45a2-94fc-0a34616ef20a","resolution":{"observed_at":"2026-08-03T01:31:47.247210Z","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-03T01:31:47.324510Z","title":"Puglisi, and Rajeev Raman","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.324510Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:76d591b547f54df991a517c006ec4e832d80e74c340868dd802f26d6044ca750","observation_id":"6906529c-fe20-4a5e-8949-64618d3164a4","resolution":{"observed_at":"2026-08-03T01:31:47.324510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04745","last_updated":"2022-11-08T13:29:31Z","snapshot_observed_at":"2026-08-16T17:01:25.551660Z","submitted_at":"2022-05-10T08:42:03Z","title":"PaCHash: Packed and Compressed Hash Tables","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04745","snapshot_observed_at":"2026-08-03T01:31:47.385988Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.385988Z"},"links":{"cited_paper":"/paper/2205.04745","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:716f264d308e78555c62d7b8f74b7b0673a7dd5c93215f89c6573b439819d36a","observation_id":"1dbe2e9d-bed1-469e-a763-5622ab6147e7","resolution":{"observed_at":"2026-08-03T01:31:47.385988Z","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-03T01:31:47.457710Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.457710Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:907a125e5a93e68e20c64724bf632cec7590b9cf28406e6c984ff712914c1804","observation_id":"da8c0150-38dd-4eca-94a2-1fa902bfad31","resolution":{"observed_at":"2026-08-03T01:31:47.457710Z","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":"10.1145/3716819","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Computing Surveys","work_id":"c604c4bb-a334-4511-9d90-33bce56d5b10","year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.531418Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:46f93cedd8e9b4f560a36f963543ab070818bb854f676f1b77f832ba34510378","observation_id":"447d9e05-2e5b-4b28-87f6-9cb45d3ec1d1","resolution":{"observed_at":"2026-08-03T01:33:28.138691Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.589445+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.589445+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:47.606072Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.606072Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:1e9dbcdcef260c2b3be1762da830e49e56521da5d186e7d3a85549a28f329fe8","observation_id":"884ad19f-2f40-442e-98e6-84195f07b83a","resolution":{"observed_at":"2026-08-03T01:31:47.606072Z","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-03T01:31:47.674422Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.674422Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5179d0ff823b2d936df44281d9e170f14358de0bffc04804d2ed9bb4a3602a12","observation_id":"4475b2cf-56bb-4bc0-87c1-9fc4ac807c82","resolution":{"observed_at":"2026-08-03T01:31:47.674422Z","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-03T01:31:47.757960Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.757960Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:d6c79f2d03d7fc41373760fb7d366fde7e0a6e5e9a0919224c451806390176df","observation_id":"7617485b-631d-4952-a64e-3ca1639a0655","resolution":{"observed_at":"2026-08-03T01:31:47.757960Z","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-03T01:31:47.837651Z","title":"Andersen, and Michael Kaminsky","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.837651Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:4cdfd3c307a0783ecb6a88e817d045e924a11e5c8b6d2b5512b9248f638669e1","observation_id":"ff437be9-fe4d-4804-bf4d-3bac04ab37fa","resolution":{"observed_at":"2026-08-03T01:31:47.837651Z","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-03T01:31:47.888947Z","title":"Andersen, and Michael Kaminsky","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.888947Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:54b0b4e7edea7a01df1bcce8641379c03e4f4527f568796a7156ddeffacda53f","observation_id":"570292a3-e9d5-4b3c-bd6a-63f6f4ebf89b","resolution":{"observed_at":"2026-08-03T01:31:47.888947Z","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-03T01:31:47.963622Z","title":"Ravishankar","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:47.963622Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:d0fb2ee4004ddd278ae7c5b272571049f3fea5084f423db2ea1ced9c16ce00de","observation_id":"362faafa-b710-4b65-a45b-a20e7e3c2869","resolution":{"observed_at":"2026-08-03T01:31:47.963622Z","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":"10.1137/1.9781611977073.74","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2022.Bal- anced Allocations: Caching and Packing, Twinning and Thin- ning","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"7bf999ce-0994-4e7e-b5f5-d84dd944c8a0","year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.043968Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:39b85099eb1dac490c95d5393735894ac5541d9e7b2817cce5b057ae93a8eb6f","observation_id":"37ecda45-6e44-41d5-a786-407b5821bfaa","resolution":{"observed_at":"2026-08-03T01:33:28.019291Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.687211+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.687211+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:48.107102Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.107102Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:569fc5f54a44862daa0a754a656771d9033e28c6e338688ffa7b325812564d42","observation_id":"49a03485-f044-4ecd-a36d-a27463cc4e40","resolution":{"observed_at":"2026-08-03T01:31:48.107102Z","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-03T01:31:48.202120Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.202120Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:3eac4c863114fc4001f546a57e2b3cafa1c754f10eb741dffdd6b1b5d131d7f4","observation_id":"2af18fc0-3bf4-4e97-b96f-eb7c952f78d2","resolution":{"observed_at":"2026-08-03T01:31:48.202120Z","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-03T01:31:48.300442Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.300442Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:7cc26322be4c7b4b5bf7dd0d944b25a248c6a439b6e60faaa5e6e544cdae8cbd","observation_id":"a2c8384d-e6b5-4682-8db6-93718aa50948","resolution":{"observed_at":"2026-08-03T01:31:48.300442Z","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-03T01:31:48.378843Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.378843Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:1c79d1897644131d437231b54685e2a88f9d00750b69c975167e398963de6d49","observation_id":"5f47c623-a8d1-44ce-af7a-d1f3e6b1db38","resolution":{"observed_at":"2026-08-03T01:31:48.378843Z","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-03T01:31:48.491911Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.491911Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:dafd6bf4c583bb6c4584fe9044b88586c416b4056f50407c503ae021da7f5650","observation_id":"762b77db-58ee-480e-9f02-d0d92eb4628a","resolution":{"observed_at":"2026-08-03T01:31:48.491911Z","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-03T01:31:48.562530Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.562530Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:1ce321d9a3d161d6c50e8f5a7d711963555d6c90cae0fae15664ed00c6c1acea","observation_id":"432da296-38e6-4e40-8f59-d55e13d4fc4b","resolution":{"observed_at":"2026-08-03T01:31:48.562530Z","resolver_source":null,"status":"malformed_identifier"},"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-03T01:31:48.656070Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.656070Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:20d29a0421c80faab7de7795cffc6b8b3bdff557c6e09fd5c36769e9c9df4097","observation_id":"b51d9eb4-b3b0-453c-b996-38ccd2bce892","resolution":{"observed_at":"2026-08-03T01:31:48.656070Z","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-03T01:31:48.434688Z","title":"InProceedings of the 2022 International Conference on Management of Data(Philadelphia, PA, USA)(SIGMOD ’22)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.434688Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5a764823d6eff0a27037787c93c1022b7ca21cdd2d26f524ef868b7ba55b7c38","observation_id":"85b763fc-21c3-41ae-a474-7f9cbc7fa0b2","resolution":{"observed_at":"2026-08-03T01:31:48.434688Z","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-03T01:31:48.918648Z","title":"2005.Probability and Computing: Ran- domized Algorithms and Probabilistic Analysis","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.918648Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:c96ddd719f50aed3bedaacbe21b76803431e9ca2ce5ed7661a08e4079722ffd4","observation_id":"6507560a-f8c3-4e33-bd24-62f9650cce6b","resolution":{"observed_at":"2026-08-03T01:31:48.918648Z","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-03T01:31:49.060492Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.060492Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:62e5ea7943feeca418759f2e14fff0a1192070c152e03b5f582d646ed81e8175","observation_id":"00eaf08d-1b56-4c0e-b7e6-190ad9499ebb","resolution":{"observed_at":"2026-08-03T01:31:49.060492Z","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-03T01:31:49.172689Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.172689Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:fc8d669007d4dfdccf3934836b46fbf4b523a6f017ae958e3e3912b66175723c","observation_id":"29b1d567-42df-4a6b-9024-b8e13992916d","resolution":{"observed_at":"2026-08-03T01:31:49.172689Z","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-03T01:31:48.800023Z","title":"Menezes, Scott A","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:48.800023Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:c10870b1c79242af0f547b35b2298080f7467de2e46461a4c91523eb3dbfc28e","observation_id":"9e208d69-de79-494f-9d12-2571a127f67d","resolution":{"observed_at":"2026-08-03T01:31:48.800023Z","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-03T01:31:49.434437Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.434437Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:9718a635e02428608fcced92d5296f68f73737c185acdc977455ca3bcf74ab4a","observation_id":"182b9949-5de5-4ff4-8473-423d6ac7365d","resolution":{"observed_at":"2026-08-03T01:31:49.434437Z","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-03T01:31:49.577987Z","title":"Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, and Rob Johnson","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.577987Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:a7a55010ef13d060c93162ffb6039e50951eedbe48f159e35eaef34f86130044","observation_id":"3589e224-78f6-47d2-a6b0-190a9af9dc9c","resolution":{"observed_at":"2026-08-03T01:31:49.577987Z","resolver_source":null,"status":"malformed_identifier"},"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-03T01:31:49.712887Z","title":"Bender, Martin Farach- Colton, and Rob Johnson","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.712887Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:9fba7010083c5569b357f0dc5d8e46a3bb0bbb3b8cd945575baba3aaf58d43fe","observation_id":"5bc725b6-503e-4675-94d4-fb5dde41b27c","resolution":{"observed_at":"2026-08-03T01:31:49.712887Z","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-03T01:31:49.284190Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.284190Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:77dcdf597341eeee3766275b9a443e21dc4d22872fe5d1107e8a7ee8af4459e7","observation_id":"a34369a3-8451-401b-acf9-f05523189ab7","resolution":{"observed_at":"2026-08-03T01:31:49.284190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.05682","last_updated":"2017-04-19T10:45:05Z","snapshot_observed_at":"2026-08-14T21:06:03.073655Z","submitted_at":"2017-04-19T10:45:05Z","title":"m-Bonsai: a Practical Compact Dynamic Trie","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.05682","snapshot_observed_at":"2026-08-03T01:31:49.969739Z","title":"Puglisi, and Rajeev Raman","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.969739Z"},"links":{"cited_paper":"/paper/1704.05682","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:54088f5bb5b2516ca4546245156a6f100d5aa3f191071cb8f5351beece6fef66","observation_id":"98e81009-5151-4218-90f3-8a81a9b5b51f","resolution":{"observed_at":"2026-08-03T01:31:49.969739Z","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-03T01:31:50.076005Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.076005Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:569319845aa8585787bbf9f0c67533c791e7d4da745f5b685a794963efc1dc05","observation_id":"1dade231-932f-497c-93bf-947b1e20b131","resolution":{"observed_at":"2026-08-03T01:31:50.076005Z","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-03T01:31:50.172127Z","title":"Balls into Bins","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.172127Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:30f5a30598f57c83fe9bdc80718a3f8adfd11986c04ce44c626b55131120cfb3","observation_id":"9c9484e7-89ac-417b-9aca-e20509f39401","resolution":{"observed_at":"2026-08-03T01:31:50.172127Z","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-03T01:31:49.852830Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:49.852830Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5db7c9fb8648d718d93a0acdb8416a03fb8417a1e4f225750e73f7485886c2f5","observation_id":"28769f5e-740c-4642-a47a-7bae5f20b2cb","resolution":{"observed_at":"2026-08-03T01:31:49.852830Z","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-03T01:31:50.385251Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.385251Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:932d1508445342afbe54dc0d577faa32d1737191e0e28547763ee6dfba71d9f8","observation_id":"43023829-439a-498d-89c2-cfd695546f01","resolution":{"observed_at":"2026-08-03T01:31:50.385251Z","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-03T01:31:50.560336Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.560336Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:765b1e391cfba1e911ad6dc564264c7aa80252e52a95e19f6696b18d5c5980e2","observation_id":"ed93c084-2fc6-440d-9dfa-1922bfe0ea7c","resolution":{"observed_at":"2026-08-03T01:31:50.560336Z","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":"10.1145/1147954","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the ACM","work_id":"9b0582b0-4a9c-4a98-bc66-54984e15d399","year":2006},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.789730Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:25a4749d906c8b43bd7fc5499cbc59efaef2d0697506e95c3eccf4582859c034","observation_id":"516dd81d-e297-4f40-b428-5033c9621adc","resolution":{"observed_at":"2026-08-03T01:33:27.924217Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:08.06523+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:08.06523+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-03T01:31:50.230055Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.230055Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:cdb201a23e62ffb51f2f4ef7bfd9640432b7c8da781a8b23c3d7b6ef7a1baf77","observation_id":"3813994d-3466-4401-af74-189f670f649e","resolution":{"observed_at":"2026-08-03T01:31:50.230055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.5367","last_updated":"2013-10-20T20:15:07Z","snapshot_observed_at":"2026-08-14T23:58:19.921785Z","submitted_at":"2013-10-20T20:15:07Z","title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.5367","snapshot_observed_at":"2026-08-03T01:31:51.096584Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.096584Z"},"links":{"cited_paper":"/paper/1310.5367","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:2e62901aea4110f75e48d6934e6fc85a15db603cb46678317f70c8782eb26613","observation_id":"832f17f2-4a33-4807-abef-15a4a38a9bf4","resolution":{"observed_at":"2026-08-03T01:31:51.096584Z","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-03T01:31:51.119283Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.119283Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:889c5f00dec3214ccb4a8bd84fed82bf4b5cec53a2e2250039303da13b18c078","observation_id":"9b72d002-ec28-4fa3-8280-26d16435aeb8","resolution":{"observed_at":"2026-08-03T01:31:51.119283Z","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-03T01:31:51.252082Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.252082Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:33cd5074c14e02e7f25407352c73d3ac0438382d7726106dbb7f69e1e0e0b1f0","observation_id":"e7535b3c-03ae-41a6-a9c8-ff6b32e10570","resolution":{"observed_at":"2026-08-03T01:31:51.252082Z","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-03T01:31:50.986284Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:50.986284Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:9a86903c8863274385bd3cb1bbb5d40ed6cca72e2eda3e244d8b394b922fe0e1","observation_id":"887652c0-4d1b-47be-8ece-d95ca89ade27","resolution":{"observed_at":"2026-08-03T01:31:50.986284Z","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-03T01:31:51.405738Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.405738Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:4bbe6648c500fad1c1c0a727080e4420f97af7c9c88b879907da33379a343b37","observation_id":"70091951-9d49-46e7-8607-5c9eb8e476b2","resolution":{"observed_at":"2026-08-03T01:31:51.405738Z","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-03T01:31:51.470103Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.470103Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:4d1e44a21f2abeb737f868da1dedf4982089a1184bf9c46fe4bcb53a2f951321","observation_id":"4dc66fa6-258d-4487-8b6e-e7676e66bc64","resolution":{"observed_at":"2026-08-03T01:31:51.470103Z","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-03T01:31:51.575848Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.575848Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:0d9dd8842d8b4a921fc1b0ea883eb351eaa5d15bd428edcef2159213ecd5b3a8","observation_id":"6d029d59-7e3f-442f-bc4e-31ba5c4bf42c","resolution":{"observed_at":"2026-08-03T01:31:51.575848Z","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-03T01:31:51.352049Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.352049Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:b3443b34d7598b7209cb21d600a0ad00aecf012739b6dbe14df22c9c3639cc35","observation_id":"db822570-41a6-49c8-a968-2ca1e686c1f0","resolution":{"observed_at":"2026-08-03T01:31:51.352049Z","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-03T01:31:52.015770Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:52.015770Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:417ab8eca439d1c8332683122515a7de9d99e09d97a6fbe313a1eec19a00883e","observation_id":"134c366e-5c3f-4a76-b8f5-4416a5a0091e","resolution":{"observed_at":"2026-08-03T01:31:52.015770Z","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-03T01:31:52.098232Z","title":"Tamer Özsu, and Walid G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:52.098232Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:b8e356f83f9f669793f10b0a8f36f566520548346fbc62c19a39e2b461c784f3","observation_id":"8b4df4e3-206f-4ca7-b8b5-bcc8b6e11b3c","resolution":{"observed_at":"2026-08-03T01:31:52.098232Z","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-03T01:31:52.204736Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:52.204736Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:325b1aa049fc00cc228a7cf6e7b6faa6fca46d03db6e017e652573f0798e2450","observation_id":"58372cce-0b68-46de-8045-e2c9d73adcc1","resolution":{"observed_at":"2026-08-03T01:31:52.204736Z","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-03T01:31:51.735679Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.735679Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:5849d4c49e1d834b1a4e5399b9be4a2ecf094a92935cd4955798d8cdbbce1fcb","observation_id":"899b8897-c453-4cd1-bcb8-c427fefacedc","resolution":{"observed_at":"2026-08-03T01:31:51.735679Z","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-03T01:31:52.626986Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:52.626986Z"},"links":{"citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:14254c66327e1f201fb2eda6dd7aced9bb57bbc58f6f76040808388f1d6ce682","observation_id":"cdf25453-872f-4dba-8d61-e6953a844ff6","resolution":{"observed_at":"2026-08-03T01:31:52.626986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":86,"verified_exact":10,"verified_fuzzy":0},"total_outbound_references":108},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 108 outbound references and 0 inbound Pith citation observations for arXiv:2607.28892."}