{"as_of":"2026-08-18T04:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5705260120791a3af0a02547ebf5889032b9c8a717b0c0e7ff5380944947ce4f","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:18.395796Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.06077/citation-record","integrity":"/paper/2608.06077/integrity","json":"/paper/2608.06077/citation-record.json","paper":"/paper/2608.06077"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:28.660485Z","title":"A lower bound for finding predecessors in yao's call probe model","venue":null,"work_id":"236104af-1b69-4b02-b7ee-0fc63ad3fb9f","year":1988},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.219340Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:fa0ae194b9b86c7f394d80b8fc0abebc51ae1fa8d92c0a8901237a0a7100656c","observation_id":"54ca186b-5cf8-4420-ae61-069a97c9470e","resolution":{"observed_at":"2026-08-07T15:29:28.712007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:28.389604Z","title":"Backyard cuckoo hashing: constant worst-case operations with a succinct representation","venue":null,"work_id":"688ed1b3-fe76-4783-b42a-1022e3491220","year":2010},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.315281Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:1cbae7ec9f6a3261aa25254ef9ec117d751a136627185f4598e76692104d0e35","observation_id":"c456b46e-a910-4831-8923-1fbae5296c8d","resolution":{"observed_at":"2026-08-07T15:29:28.514813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:28.058691Z","title":null,"venue":null,"work_id":"bd3792fd-c10b-41cd-91cd-9d436a474ea9","year":1962},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.431534Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:8b8fecf5208a48d66bdb02ce2fcda05423b85e2b3aa4345a5dfe14cd24a9fa33","observation_id":"fc12db61-5878-4755-b44d-ad1d7ff5a322","resolution":{"observed_at":"2026-08-07T15:29:28.181073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:27.920730Z","title":"Blandford and Guy E","venue":null,"work_id":"d4bfcdd2-22e9-4786-bc58-be98ccbb6cf8","year":2004},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.563418Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:399929929b63a3b7fd3906354450d913d8ac25d56fa1aedcbdc6b325ededf51e","observation_id":"2514e924-48d2-4fa4-96d3-1edd0ee6f3b2","resolution":{"observed_at":"2026-08-07T15:29:27.957954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:27.726240Z","title":"Blandford and Guy E","venue":null,"work_id":"73a0b171-e19e-4c84-8780-37e95213fe38","year":2008},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.704395Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:21eb06320422e1ecd54ab22dfedecacd70b05c7fe98761a4de3d8acfe949b500","observation_id":"25e2c27f-0117-4a12-a57a-3b33219e1b62","resolution":{"observed_at":"2026-08-07T15:29:27.854001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:27.432685Z","title":"Monotone minimal perfect hashing: searching a sorted table with O (1) accesses","venue":null,"work_id":"5629faf8-7b7b-490a-9b2f-318cfede8046","year":2009},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.826500Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:91a9754a91771b7030349bbdeb5a1eed5a22befdfbfc776c1d640d9ed9181aeb","observation_id":"f41e84bd-79fb-481d-b98c-6004e7de328f","resolution":{"observed_at":"2026-08-07T15:29:27.636086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:27.123722Z","title":"Bender, Alex Conway, Mart \\'i n Farach-Colton , William Kuszmaul, and Guido Tagliavini","venue":null,"work_id":"97260476-7df9-4b17-af95-1a0a50b7f606","year":2023},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:14.969978Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:ccaf142d857e33d88820fb3deb91c0291206bc14afa7527d1f2478d820f20dcb","observation_id":"d22f3860-3f9a-4988-b820-88a534c0d3a8","resolution":{"observed_at":"2026-08-07T15:29:27.248702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:26.821245Z","title":null,"venue":null,"work_id":"1ddf9ca7-2a97-4665-919e-e6d4a1dbcd90","year":1999},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.117800Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:a5f88ffc6ffcd538276e8646fe94121292061d17d8b9e4fd823ef2ed7838b331","observation_id":"871a6042-eaaa-445f-b643-1ae500d9848c","resolution":{"observed_at":"2026-08-07T15:29:26.971949Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:26.473568Z","title":"Bender, Mart \\'i n Farach-Colton , John Kuszmaul, William Kuszmaul, and Mingmou Liu","venue":null,"work_id":"5293eb2c-afbe-484f-9373-a3cfe12a8fdb","year":2022},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.250098Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:d2a57b50557fcd82cf2dfccb07ee4af258a48f4761c34816414aea3ea83187ea","observation_id":"5b049c73-e99a-468d-8a3f-af372d27073c","resolution":{"observed_at":"2026-08-07T15:29:26.609037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:26.183563Z","title":"Tight bounds for classical open addressing","venue":null,"work_id":"a9022855-e5fa-43d5-8c03-1ca0a37453cd","year":2024},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.385359Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:08d9a007630f0d932cb466abf5b572dca0ff7e3f8dcdf328f2a4a6bdfa05fed1","observation_id":"c65aa0c6-2b46-43d1-b906-8048f006a34a","resolution":{"observed_at":"2026-08-07T15:29:26.325147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:25.771553Z","title":"Optimal non-oblivious open addressing","venue":null,"work_id":"dcc33b86-5004-47b8-8d4c-903362c0fef7","year":2025},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.520757Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:d3e5502fbfd46b9f3a1b74e49617f7dd67373c872c96b2b777bd8a38d1431066","observation_id":"ae5a818b-4ffc-4c7a-84cd-37c45e4ca877","resolution":{"observed_at":"2026-08-07T15:29:25.948331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:25.645020Z","title":"Minimal and monotone minimal perfect hash functions","venue":null,"work_id":"686deb90-1f6f-4a3c-a9f4-e26d7ac424dc","year":2015},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.660981Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:1ec45f059028de2a97f4cb3142009797247bc1d387afeb52dd14ae9039c15869","observation_id":"cbe2e481-11b7-4b56-8c89-7116a62123b3","resolution":{"observed_at":"2026-08-07T15:29:25.701468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:25.449545Z","title":"Reducing the retrieval time of scatter storage techniques","venue":null,"work_id":"07d46a46-4df0-4b28-9389-9b45b10f0d0e","year":1973},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.802855Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:80ff5dc69c6a6e40f969fc59c1e31be7e90f2ad1563055929dfc49ab4bce103e","observation_id":"eb5410b7-422d-41a7-ae1b-3a7705409747","resolution":{"observed_at":"2026-08-07T15:29:25.558586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02839","last_updated":"2023-11-06T02:59:44Z","snapshot_observed_at":"2026-08-16T14:45:48.961471Z","submitted_at":"2023-11-06T02:59:44Z","title":"Cell-Probe Lower Bound for Accessible Interval Graphs","version":1},"cited_work":{"arxiv_id":"2311.02839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.02839","snapshot_observed_at":"2026-08-07T15:29:18.836083Z","title":"Cell-Probe Lower Bound for Accessible Interval Graphs","venue":"cs.DS","work_id":"9988c229-a0ad-425b-a8a5-b61363eb2bd7","year":2023},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:15.920059Z"},"links":{"cited_paper":"/paper/2311.02839","citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:8d24c7918e080bbb5df29705ac2eb62febf95dcb91c250088d0604e3a7d1c2f3","observation_id":"7b0a69f5-a74a-4cdb-bd71-51cd4b4a89d1","resolution":{"observed_at":"2026-08-07T15:29:18.950895Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:25.228630Z","title":"Robin hood hashing","venue":null,"work_id":"a9f14fd3-1fee-48f2-aa48-2dbd54c695f7","year":1985},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.042849Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:e13ed61b58fc3a52c82354e7585b88590014a424bbc1d0626ec7da8c6cafa7e2","observation_id":"6a301214-630e-44be-8aad-b0ee5162e520","resolution":{"observed_at":"2026-08-07T15:29:25.314299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:25.094873Z","title":"Demaine, Friedhelm Meyer auf der Heide , Rasmus Pagh, and Mihai P a tra s cu","venue":null,"work_id":"a15cee55-7503-4898-aa89-94c985e19d58","year":2006},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.207171Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:b984fc10d19b2f327c37b06d7951678d9fb75a30dcb05e566541cdc49777367e","observation_id":"cf3b4afd-8f19-4078-bae5-5ea10852b677","resolution":{"observed_at":"2026-08-07T15:29:25.148515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:24.904590Z","title":"Optimal bounds for open addressing without reordering","venue":null,"work_id":"1cafc328-044a-473d-9e08-fcdb4058181c","year":2024},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.304397Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:7a3eacced855de1f79efc21a4ca4873b3c57eb375b798ce47f3b3418c4f1afa9","observation_id":"ddea6d49-d1f9-4418-9cb5-6225259da9fe","resolution":{"observed_at":"2026-08-07T15:29:25.035925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:24.479807Z","title":"Non-oblivious hashing","venue":null,"work_id":"34489dd7-9d00-47b8-ad50-508e886e32dc","year":1988},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.377544Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:959071361be1131f2373957d92ff98e9392a75b5a03efd023dbf3e2d91031ed0","observation_id":"80cde0d2-5b0e-486e-a2f6-4562be62e5da","resolution":{"observed_at":"2026-08-07T15:29:24.682154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:24.219435Z","title":null,"venue":null,"work_id":"0d0c7e6c-b42a-47d9-883a-cc53612c624b","year":1983},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.456721Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:9f52889afb0b03e587c95368c5379c749f48c9ff58551dd76a08d9fd2d4145e0","observation_id":"5092a14c-3632-4f45-b5a7-ff3b161a8508","resolution":{"observed_at":"2026-08-07T15:29:24.364177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:23.993514Z","title":"Fredman and Dan E","venue":null,"work_id":"ef2ed7bf-deb7-4d15-8753-9b63bd8909d6","year":1990},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.554205Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:f287b57bbd80341f28d088aee0414aeef1c35d1c08c3de3b11dc96656f6ae714","observation_id":"f27c1ac4-597b-4a01-9dc4-fac98cf00764","resolution":{"observed_at":"2026-08-07T15:29:24.057183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:23.774237Z","title":"Fredman and Dan E","venue":null,"work_id":"f9a7ddac-1e5a-4953-aef6-2b99134c1fae","year":1993},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.632984Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:35079f77bf76240e50fbe6173c29bc7c91ea32f86d69296177327e842bd02c88","observation_id":"2f53210f-bfdf-4579-812f-b306d2f6b08f","resolution":{"observed_at":"2026-08-07T15:29:23.865645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:23.503374Z","title":"Compressed data structures: Dictionaries and data-aware measures","venue":null,"work_id":"8e1b61a6-d0b1-4996-b777-3bc278add9d5","year":2007},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.704732Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:1fedc5d475fde0236a70f3842b3f34ef3961f62aa2a32d221d0ca27e64554cf7","observation_id":"f6378f1f-cc56-4f41-8501-3b6e9c2990b7","resolution":{"observed_at":"2026-08-07T15:29:23.634800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:23.270627Z","title":"Squeezing succinct data structures into entropy bounds","venue":null,"work_id":"04d629d8-6c24-4a89-a320-2c6636120775","year":2006},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.790125Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:fe7d8ec9ecb09dba257996ecf48770cc6eeb9019690abbab85d033196c2346b4","observation_id":"98886df0-c460-4e1f-b138-731c8a189052","resolution":{"observed_at":"2026-08-07T15:29:23.340846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:23.046623Z","title":"Optimal static dictionary with worst-case constant query time","venue":null,"work_id":"61c836f6-dd52-471f-a8ea-35ee3fbd3d7d","year":2025},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.857403Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:d5444c558693250a1a3687085f62426591a2c960a78473337b221eaf040f4c24","observation_id":"db7b07fb-27aa-4786-97e3-570e885ae6e5","resolution":{"observed_at":"2026-08-07T15:29:23.133950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:22.879261Z","title":"Succinct dynamic rank/select: Bypassing the tree-structure bottleneck","venue":null,"work_id":"8b456748-ec6d-4da3-b854-3e69bc6799c8","year":2026},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.922678Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:19ecac5950d25e4df0d44951f3db98e466cf513ccbd97199754fc6a92cd933c7","observation_id":"fd70e63a-2811-4946-b54b-9c01605e5780","resolution":{"observed_at":"2026-08-07T15:29:22.976516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:22.628844Z","title":"Tight bounds and phase transitions for incremental and dynamic retrieval","venue":null,"work_id":"e7109252-1b6a-4b72-b597-40b9f5aad437","year":2025},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:16.988123Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:dbce7bd8557315065fd1801235bb7a2594d5f29f576c900bf18cd13f320e6e0a","observation_id":"ea0d724d-f739-4df1-ac77-76e26f7f7d49","resolution":{"observed_at":"2026-08-07T15:29:22.736559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:22.446335Z","title":"Resizable retrieval","venue":null,"work_id":"37c2629b-2f79-4b4b-8947-b7a3a05472fe","year":2026},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.082603Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:e27201b5aa251a1d427d5b2816b6674c01bc49f370f6e32437509f80a7ebd5fe","observation_id":"9598927e-29e8-46b0-980a-77a39f26ae71","resolution":{"observed_at":"2026-08-07T15:29:22.558763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:22.317175Z","title":"A hash table without hash functions, and how to get the most out of your random bits","venue":null,"work_id":"74f3b8b3-8bce-42f7-b487-772f0633d01d","year":2022},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.151338Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:427c0260c7028544ecebb120ae73643a9f2b1e12073ae0bf1593d71d46eff34b","observation_id":"9d627aee-12d9-4f48-abde-d9d22c06d042","resolution":{"observed_at":"2026-08-07T15:29:22.380013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02318","last_updated":"2022-02-09T08:15:23Z","snapshot_observed_at":"2026-08-16T17:44:16.986320Z","submitted_at":"2021-11-03T16:11:22Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","version":2},"cited_work":{"arxiv_id":"2111.02318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.02318","snapshot_observed_at":"2026-08-07T15:29:18.578715Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","venue":"cs.DS","work_id":"e8a08123-8df5-4758-964a-3199f964d2c7","year":2021},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.222369Z"},"links":{"cited_paper":"/paper/2111.02318","citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:7e736807d07c64092f496ea15d55492dc962718088d47b1a1b429ba1fc68c454","observation_id":"c262ad02-0010-43fa-9b31-8157bc89cff9","resolution":{"observed_at":"2026-08-07T15:29:18.701022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:22.101779Z","title":"Tight cell-probe lower bounds for dynamic succinct dictionaries","venue":null,"work_id":"aa9d4d4b-b071-4888-9fe7-9b729fce07d4","year":2023},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.277465Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:aa7a8f4055cb689515b840a042525e2a1308b50d0f7e2c3b55ab1be9c9b6534f","observation_id":"6034486c-99d5-4f90-87e5-0ee6e403fc97","resolution":{"observed_at":"2026-08-07T15:29:22.217533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:21.972259Z","title":"Dynamic dictionary with subconstant wasted bits per key","venue":null,"work_id":"252be189-16a5-471c-942d-b7fe092944f7","year":2024},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.349577Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:c4acf298a1ff22811b1656375dc9065eabcac9a272cbb53f54360d675a86a926","observation_id":"3fe654f6-eb9f-45c6-b153-4ae40f2e2576","resolution":{"observed_at":"2026-08-07T15:29:22.030029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:21.770272Z","title":"Lower bound for succinct range minimum query","venue":null,"work_id":"3906f19b-e85f-4d5e-a10a-bbe102333b1a","year":2020},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.440079Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:513f9a36834a766dc24537e5dd06564d28a93ce0e6fbaef08d2a55db1cae2358","observation_id":"c1a5db6d-4634-41d5-8190-50bb384e3c1a","resolution":{"observed_at":"2026-08-07T15:29:21.892625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:21.506588Z","title":"Techniques for collision resolution in hash tables with open addressing","venue":null,"work_id":"cc19809e-05a5-4896-8938-f23716dea36f","year":1986},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.555565Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:2f2d0ca383ee8384e29c5c5fb707030f70e2aebe3552d3e0826630aad91cba5d","observation_id":"5f0e463f-e712-4bc8-ae78-d4801f1bf89d","resolution":{"observed_at":"2026-08-07T15:29:21.592191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:21.266675Z","title":"Low redundancy in static dictionaries with o (1) worst case lookup time","venue":null,"work_id":"7d89c195-60ec-46fb-83f8-4cd1c7001d9b","year":1999},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.663127Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:b41757fd152c236689756a6d14c1b601c9e227997e5a430424d239a69cb07bc8","observation_id":"c615088d-e18e-47af-8702-8fa68486a60e","resolution":{"observed_at":"2026-08-07T15:29:21.329955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:21.144479Z","title":"Addressing for random-access storage","venue":null,"work_id":"0172c777-a1ae-4b01-8744-8b7a8a491d67","year":1957},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.779485Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:6c980623a0fa05bf0cdff20cae242f7f16f125a3b60af955b74868def62538ab","observation_id":"c800c85a-03f3-403d-94fb-4e7095b849c2","resolution":{"observed_at":"2026-08-07T15:29:21.176482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:20.904052Z","title":"Dynamic integer sets with optimal rank, select, and predecessor search","venue":null,"work_id":"bd5d0ae9-29a5-4544-97ea-67738d14dce3","year":2014},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.899921Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:7cea67529ca9ea25875560217a1c8e13ba43006b12c18fb3965c9c5096d011f5","observation_id":"01d8051f-2dd3-4193-9b7e-5f347e300859","resolution":{"observed_at":"2026-08-07T15:29:21.029961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:20.563144Z","title":"Cell-probe lower bounds for succinct partial sums","venue":null,"work_id":"81596f52-d9b7-4863-a708-3ad1e5dbdcdc","year":2010},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:18.004642Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:5834322e91ba7bb0dcce4700de03b616108a4701c38f8905b28e60b1002f464a","observation_id":"52c7b9d6-e59f-4056-a4cc-5f9488c4317f","resolution":{"observed_at":"2026-08-07T15:29:20.704990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:20.264644Z","title":"Succinct dynamic dictionaries and trees","venue":null,"work_id":"c1d18915-40c3-4cd1-a099-620838fc7956","year":2003},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:18.128834Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:8bfe73cd7cf19b233b2e4e3ab5943acf29050f45d3a7b369c57e7f6973ee9ef4","observation_id":"933eacf6-80f3-43e8-8c18-75586fc8ccec","resolution":{"observed_at":"2026-08-07T15:29:20.412830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:19.934228Z","title":"Information sorting in the application of electronic digital computers to business operations","venue":null,"work_id":"e4f48959-4399-4540-a197-b6a33c67c7c5","year":1954},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:18.221954Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:ea6cb3381eb23614ab0067fb74c27e59770ee5f9138cce2a1863124e61898959","observation_id":"0c19fbc2-4f51-4767-ac18-1516a57a465e","resolution":{"observed_at":"2026-08-07T15:29:20.125803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:19.580451Z","title":"Kaas, and E","venue":null,"work_id":"e6ef0a97-8052-4b0a-9bea-12b8e1bd9c2a","year":1977},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:18.295372Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:26bae883e91240da0f25b3311c4ded0a0c103b63c777df85af8dc22fe912c977","observation_id":"368cf6c5-763a-4df4-88f4-93c1b716a79a","resolution":{"observed_at":"2026-08-07T15:29:19.779606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:19.166557Z","title":null,"venue":null,"work_id":"6504a0da-6d6d-45cb-a542-0d49a101cdf4","year":1983},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:18.395796Z"},"links":{"citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:23a42b78f70682b139ab93fce64b8cc9620cc2355f0518dd3ef5452def2c773e","observation_id":"10863489-ccb1-4642-974f-aa779e08da18","resolution":{"observed_at":"2026-08-07T15:29:19.412925Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":41},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2608.06077."}