{"as_of":"2026-08-10T03:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b03504cbb522d2f7f84fd1a1a52ee35e23f5c47ff22bace6ffd4ba47bb62d37","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:47:00.451140Z","state":"measured"},{"denominator":73,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":73,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2508.14239/citation-record","integrity":"/paper/2508.14239/integrity","json":"/paper/2508.14239/citation-record.json","paper":"/paper/2508.14239"},"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-05T18:47:01.676709Z","title":"Towards efficient and reliable llm serving: A real- world workload study,","venue":null,"work_id":"19829f99-3bfd-4585-8c3b-951b9af6ce0a","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:53.906926Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:0c757cec08c75a2f5d7f7863e79ae6bdfe224bf24f98df7b2ec31509cf10d9a2","observation_id":"6187406a-5253-4110-90db-d69643451f39","resolution":{"observed_at":"2026-08-05T18:47:01.681629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.647009Z","title":"Sglang: Efficient execution of structured language model programs,","venue":null,"work_id":"a99f0f56-2a8b-4eb2-a80e-c106f2f5b392","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.065500Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:0e26d8d5da47ce7373b550f12cba1b06b9ff4798678c78a94a625edc3e7e3b01","observation_id":"85d0c61d-c9ff-4de3-ace0-49a8df8b2749","resolution":{"observed_at":"2026-08-05T18:47:01.652008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13761","last_updated":"2024-10-21T15:59:18Z","snapshot_observed_at":"2026-07-06T19:18:57.862380Z","submitted_at":"2024-09-16T18:46:24Z","title":"Do Large Language Models Need a Content Delivery Network?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13761","snapshot_observed_at":"2026-08-05T18:46:54.111082Z","title":"Do large language models need a content delivery network?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.111082Z"},"links":{"cited_paper":"/paper/2409.13761","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:41a4e76b0bb31405ba028466651845428c9f63388ddf1482959bcaea19282d43","observation_id":"2c3ba891-202d-4244-88e4-b620b63a9854","resolution":{"observed_at":"2026-08-05T18:46:54.111082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:01.632001Z","title":"Cachegen: Kv cache compression and streaming for fast large language model serving,","venue":null,"work_id":"88884034-7ca2-4b11-af3b-86c351e6c4b8","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.197267Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:31da290004bbd2b2de605d4909d285efc6939c7d7b9296dcbe781182c653240b","observation_id":"7a020c41-2527-406e-9934-1795ac5c8f31","resolution":{"observed_at":"2026-08-05T18:47:01.636579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.617855Z","title":"Chord: A scalable peer-to-peer lookup service for internet applications,","venue":null,"work_id":"024b3a62-6539-40cc-88eb-80f903b8974b","year":2001},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.347012Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:a9f641ed4273afd5a6d41d589680d22a990891d0eff231883c127b8f937177b2","observation_id":"21b3855f-a241-4e70-835c-69a837514210","resolution":{"observed_at":"2026-08-05T18:47:01.622178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.603104Z","title":"Resource discovery for distributed computing systems: A comprehensive survey,","venue":null,"work_id":"9ab27296-b28c-4052-b1e7-2fa035a7a7d5","year":2018},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.435487Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:d14be86b22ee100f2c87996511cffb4fd40023ea213328c9b7f0559b5285e1ea","observation_id":"0f48e08e-1af9-4334-b84d-89a70a2683c0","resolution":{"observed_at":"2026-08-05T18:47:01.607919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.588479Z","title":"A survey on content-centric technologies for the current internet: Cdn and p2p solutions,","venue":null,"work_id":"2a31bd1e-4739-439c-acdd-2107b063e879","year":2012},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.530134Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:2470b6b3c1f0be0b72e110cab8061d3f1798dcfdffc2518c0a14372f3ace7bb5","observation_id":"dfd79206-7a48-4874-bc00-22ae1ef6722d","resolution":{"observed_at":"2026-08-05T18:47:01.593189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.574567Z","title":"A survey and comparison of consistent hashing algorithms,","venue":null,"work_id":"c80d0981-e536-4d12-b5b0-6a98893ce9e1","year":2023},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.601321Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:6a67a72c8c2a47fd845a43906b252aba4bd78da2850af16a23af467e6ccfbbe6","observation_id":"9f56b153-fc29-40db-b728-bf2f400e257b","resolution":{"observed_at":"2026-08-05T18:47:01.578854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.559215Z","title":"Design and evaluation of ipfs: a storage layer for the decentralized web,","venue":null,"work_id":"51cf8e54-3062-4bdf-acc8-d3a87bc9e4db","year":2022},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.666032Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:b5e6f0d9db588b14619ecd8a322172672f8850db6c53276faafd04d99ec16ded","observation_id":"e99dfa4f-4835-440e-a7cf-5339aa6e8bc3","resolution":{"observed_at":"2026-08-05T18:47:01.564109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.544612Z","title":"Apache cassandra: Open source nosql database","venue":null,"work_id":"d9448e35-5884-4b81-ab1f-51339f0a030e","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.725190Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:fb01dd39c0baea947c80d428039752dd543177375ef8b5a2abd68fa796046442","observation_id":"43b13bc8-044a-44d5-aeea-00fe02791a3c","resolution":{"observed_at":"2026-08-05T18:47:01.549001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.529187Z","title":"Cassandra: a decentralized structured storage system,","venue":null,"work_id":"fa028199-0eb7-4199-8a81-fc0cdc098d15","year":2010},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.780302Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:8e42ce5be6ea43499e9f80a355e2e81ae646745fbd0009aabe7a0554f4eadd93","observation_id":"8a285020-436c-4788-a5e0-df5cdb109f36","resolution":{"observed_at":"2026-08-05T18:47:01.534259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.514185Z","title":"The Tor Project | Privacy & Freedom Online — torproject.org,","venue":null,"work_id":"931278fa-d4e8-42c3-86cc-c2110c026336","year":2025},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.860651Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:1dd65d0a63180131d622fd566a9cc17772c9052b7d5905a15f90c478cf01465a","observation_id":"ae59d0d4-73c8-4f7f-9c29-e82b33aa4edf","resolution":{"observed_at":"2026-08-05T18:47:01.518876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.499703Z","title":"Namecoin","venue":null,"work_id":"ea17fbf5-bc50-453d-b202-5cabecb13a7a","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:54.956782Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:4c123ae37630e58bead8d00de0a6b7cc740e71648d463aca563b5898cb72d3c6","observation_id":"38faed7e-95ef-4b86-a732-8c2fb46baa83","resolution":{"observed_at":"2026-08-05T18:47:01.504269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.484292Z","title":"Bittorrent: The world’s most popular torrent client","venue":null,"work_id":"8b371833-768d-4201-88fe-7dd09b951f63","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.025585Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:54d4cfe129e69af8aa2312e7bc40863d22d2f6e02441019b665053cfbb2bf6f4","observation_id":"69c80912-f078-4c25-8fcb-9696becefc05","resolution":{"observed_at":"2026-08-05T18:47:01.489083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-08-05T18:46:55.092252Z","title":"Preble: Ef- ficient distributed prompt scheduling for llm serving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.092252Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:5690f243a5dc512367c845d8de4fef16ef830bc4050c1b93d6fd63fab036fd79","observation_id":"1993b332-271a-4fe0-bffd-aa27d0248f65","resolution":{"observed_at":"2026-08-05T18:46:55.092252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:01.469343Z","title":"Fog and IoT: An Overview of Research Opportunities,","venue":null,"work_id":"36ed2c52-7a19-45e6-8195-50bdfbd7a8d5","year":2016},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.192821Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:4d43739858de26cb94b1787918fb77157518ad428d13266b1d1a62ad905ef4a1","observation_id":"98e86439-d100-4a1a-9458-2e060859a94d","resolution":{"observed_at":"2026-08-05T18:47:01.473999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.454031Z","title":"VERID: Towards Verifiable IoT Data Management,","venue":null,"work_id":"80078bb3-9c55-43b2-9e07-6ffa79b731ab","year":2019},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.282309Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:788a7030952e3fa3110d48cf423274c43cb4bf6c25011dc091c9a6a99f740fb7","observation_id":"64627dd1-4745-4f55-9bcd-a02b623a6f73","resolution":{"observed_at":"2026-08-05T18:47:01.458917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.437917Z","title":"Blockchain verification and validation: Tech- niques, challenges, and research directions,","venue":null,"work_id":"1b3c0223-8f04-4f0f-9232-6a33b42f4338","year":2022},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.395677Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:8b42756cf649680fff45697a5fde59f1b87ac64b84c657c970709782ce17095f","observation_id":"248b27a9-4487-4edb-8d10-17094cbd8c56","resolution":{"observed_at":"2026-08-05T18:47:01.442799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.423190Z","title":"A collaborative ledger storing model for lightweight blockchains based on chord ring,","venue":null,"work_id":"d68d866a-2bf5-43da-90d9-46642f182858","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.485057Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:86f9872f2da600a85614df2d93378fea2acda30a6fbea624465dccac3e8edf88","observation_id":"231e50c8-3d0f-44bd-8b2b-a83761a3bffe","resolution":{"observed_at":"2026-08-05T18:47:01.427808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.408116Z","title":"Efficient range query processing in peer-to-peer systems,","venue":null,"work_id":"0c440efe-adaf-49bc-a05f-f41d0180c53f","year":2009},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.553804Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:1294879aaf7b96b342708971e7fd1ec2f188252755c6c259865e9cc2e3044ff6","observation_id":"d5b39183-ca38-40c0-bae0-d3ac9f9d027b","resolution":{"observed_at":"2026-08-05T18:47:01.412907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.393082Z","title":"Fissione: a scalable constant degree and low congestion dht scheme based on kautz graphs,","venue":null,"work_id":"e410d3ed-de6c-423e-9be6-d6e9f30dbe6c","year":2005},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.639969Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:a2b60302a38acf29f40787be4af9a9ec6c16a3a811eb8aa42d677444ff0f884f","observation_id":"d082440a-0523-4a07-b747-24b926138549","resolution":{"observed_at":"2026-08-05T18:47:01.397724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.377939Z","title":"Dbst: A scalable peer-to-peer distributed information system supporting multi-attribute range query,","venue":null,"work_id":"f9367567-2f0d-4335-96f2-ca9f5dee27b0","year":2021},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.696766Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:be672a8f59560c173929073803a8649a7514a4aa4f9d126387112eb96fba0f25","observation_id":"6aa422de-4e48-4b36-b163-317023de18e4","resolution":{"observed_at":"2026-08-05T18:47:01.382836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.361752Z","title":"Marques: Distributed multi-attribute range query solution using space filling curve on dths,","venue":null,"work_id":"d8664db2-3dde-469e-8b44-76ee1c783770","year":2015},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.760701Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:e7261e1f8f8ae31567f90fcfde09ea10757e8fd8869d1457408fd1aa2018c5bb","observation_id":"d8bfa2b4-32b5-490c-9ac6-150996d30579","resolution":{"observed_at":"2026-08-05T18:47:01.367355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.347021Z","title":"Effective peer-to-peer design for supporting range query in internet of things applications,","venue":null,"work_id":"8370f0aa-f0d5-4636-b588-705b040e5a80","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.834403Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:a5d738608373e979bb9316a64475f57ab0e50a8ef02f41f9506f8cf6ca583460","observation_id":"0512bb2d-9035-4e85-a927-07cb01a23ae3","resolution":{"observed_at":"2026-08-05T18:47:01.351644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.331693Z","title":"The case for learned index structures,","venue":null,"work_id":"7148c1b3-8b6f-4a0d-aece-4be433783a9f","year":2018},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.903736Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:306a6737ad814d87c26eed5f22291af7052c4843baaedac99e92792c7e1d8552","observation_id":"0f8be40f-d7df-44ef-8ad5-9c82452c3c4d","resolution":{"observed_at":"2026-08-05T18:47:01.336508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.316963Z","title":"Cdfshop: Exploring and optimizing learned index structures,","venue":null,"work_id":"f4846004-00ff-4583-b6c7-b97a56d91419","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.984102Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:dbf8f72d0367a0e715ea9dfee90d145e1662eece063cf6516be9372348922a9b","observation_id":"ae9eb50b-8bfb-411c-9af8-395e22e72715","resolution":{"observed_at":"2026-08-05T18:47:01.321426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.302268Z","title":"p2psim, a simulator for peer-to-peer protocols,","venue":null,"work_id":"f82e065f-6be2-4587-996f-4aac5fdec95f","year":2003},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.050261Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:03327e3c9a182aacb52155b7c75ae2f6593c4d2ba8bb286866c24ecc53a8d881","observation_id":"6c8e108b-0744-4df3-8591-42a030a9dbac","resolution":{"observed_at":"2026-08-05T18:47:01.306795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.287585Z","title":"Survey of research towards robust peer-to-peer networks: Search methods,","venue":null,"work_id":"36c25819-d673-46fa-9653-e1bceac94a9e","year":2006},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.131442Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:389e0c65c35ac81f18049c42e7214c2715c5eeee1d9e3e64566a67800163ff10","observation_id":"42bff60d-5a9e-4d20-b778-904c1dfb236f","resolution":{"observed_at":"2026-08-05T18:47:01.292179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.13014","last_updated":"2019-11-29T09:35:04Z","snapshot_observed_at":"2026-08-05T20:01:06.134874Z","submitted_at":"2019-11-29T09:35:04Z","title":"SOSD: A Benchmark for Learned Indexes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.13014","snapshot_observed_at":"2026-08-05T18:46:56.206913Z","title":"Sosd: A benchmark for learned indexes,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.206913Z"},"links":{"cited_paper":"/paper/1911.13014","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:1be56ca8ac9ea22197b8b6c84e42afe3d8dc9519547f7235f209bf4a7b8e377c","observation_id":"61210c6b-4c55-410a-afca-271e829be8fd","resolution":{"observed_at":"2026-08-05T18:46:56.206913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:01.272522Z","title":"Network latency esti- mation for personal devices: A matrix completion approach,","venue":null,"work_id":"4cf8049b-e00d-47cd-bce2-5f26eedbcfec","year":2017},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.276893Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:ef3428301948277d997c7d7156a2339d1f04ae26621fdf063adb4860ad9e9ca8","observation_id":"103e8276-dcc5-4dcb-976b-e497e6229b7d","resolution":{"observed_at":"2026-08-05T18:47:01.277384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.257461Z","title":"Radixspline: a single-pass learned index,","venue":null,"work_id":"62ec38df-5cb1-443a-ae60-bf90b224bce7","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.392862Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:52c7e90c2838f55f6a726cf0c969cbf85ccdd0cfca9dd089a661014f6a9a62de","observation_id":"d9a69554-e7d1-4013-b242-16f35a39085a","resolution":{"observed_at":"2026-08-05T18:47:01.262361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.242189Z","title":"The pgm-index: a fully-dynamic com- pressed learned index with provable worst-case bounds,","venue":null,"work_id":"71bbbaed-aa93-49d3-a959-251def724572","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.503279Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:c0d5d188dc5f595ff1479c34b46ef7fcea55004776c12c7fd5152b2462f12daf","observation_id":"b1da1a31-bee2-43d7-9c94-9e6b3bc5b1b4","resolution":{"observed_at":"2026-08-05T18:47:01.247146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.661857Z","title":"Efficient memory management for large language model serving with pagedattention,","venue":null,"work_id":"32b54a4b-5ea9-47e4-9a70-f7251bfe8fc5","year":2023},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.525977Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:bb787022048898e4a2dac6e9394e00f66107ff91ebb8f667d047cc7ec5a855d5","observation_id":"761a42a3-553b-4351-a862-a1c77074d10b","resolution":{"observed_at":"2026-08-05T18:47:01.666291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04939","last_updated":"2024-09-06T05:06:51Z","snapshot_observed_at":"2026-08-08T11:14:21.904860Z","submitted_at":"2023-11-08T01:45:37Z","title":"LooGLE: Can Long-Context Language Models Understand Long Contexts?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.04939","snapshot_observed_at":"2026-08-05T18:46:56.553622Z","title":"Loogle: Can long- context language models understand long contexts?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.553622Z"},"links":{"cited_paper":"/paper/2311.04939","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:8aea51a7767e0ac6f97bb121f3323c95ab51d353c8c4508c8af70501da349791","observation_id":"f8f93946-ae3b-4794-b1b9-5d96e3f486ea","resolution":{"observed_at":"2026-08-05T18:46:56.553622Z","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":"2504.20101","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:00.699687Z","title":"Gen- torrent: Scaling large language model serving with an overley network,","venue":null,"work_id":"891b243b-6da8-4bb7-a0b0-d5429c04b160","year":2025},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.733323Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:20509f180a909d14d3bc3acba38d91afa3abd33ea264a54c31bcc20d11c84aa0","observation_id":"9e7e7d04-4a92-4e77-8841-1c3b224ded4a","resolution":{"observed_at":"2026-08-05T18:47:00.707354Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.226389Z","title":"Kademlia: A peer-to-peer information system based on the xor metric,","venue":null,"work_id":"01649b5b-4d62-499a-8427-d8aa55948caf","year":2002},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:56.882044Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:633f52ff522d79c42f994d3497e2970700ef8e98fc38a56a284c2d133e724f7b","observation_id":"82c9eff5-494c-4339-bc5c-640a91a1c76d","resolution":{"observed_at":"2026-08-05T18:47:01.231753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.211183Z","title":"Ipfs/kubo: An ipfs implementation in go","venue":null,"work_id":"9b1ce4e8-df9e-4de5-92f5-7c5c73e9270a","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.031235Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:70d712f9ce26572fec57c851524d4953e6f0be95410d1d7234697cb97caa1cc4","observation_id":"c7ea6771-45ab-44eb-9a85-d4e457382d5c","resolution":{"observed_at":"2026-08-05T18:47:01.215583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.196140Z","title":"Prefix hash tree: An indexing data structure over distributed hash tables,","venue":null,"work_id":"232fffc4-35cb-4520-ae92-6c359bc12c8a","year":2004},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.186084Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:4022fea9b6c4daaa85852d7c00d7f9e24bdb919a34d0249d08eb1aad32f14c10","observation_id":"ae01c86d-ec6b-401c-9851-ad051fbce0e2","resolution":{"observed_at":"2026-08-05T18:47:01.200889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.180409Z","title":"An adaptive protocol for efficient support of range queries in dht-based systems,","venue":null,"work_id":"195191a3-0ca6-45b3-8a62-abeb60d6943c","year":2004},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.366031Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:9db50bbbd2790dca0e68ccd5b156396be665b0f8182ff69dfdcc292a74889c5c","observation_id":"84999ab5-204a-4556-8256-86da6e9ef83c","resolution":{"observed_at":"2026-08-05T18:47:01.185606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.165585Z","title":"Alex: an updatable adaptive learned index,","venue":null,"work_id":"b29e6f6a-3b1b-4769-9425-5a3f1630d260","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.567104Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:ee81c1a5baed54af45abbdd16d6594bea327133fd047541f6d564845b7b10f30","observation_id":"48c41a25-ee6b-49d5-a344-c01a0328d842","resolution":{"observed_at":"2026-08-05T18:47:01.170201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.00683","last_updated":"2021-12-06T09:52:51Z","snapshot_observed_at":"2026-08-04T10:45:29.969273Z","submitted_at":"2021-05-03T08:36:44Z","title":"APEX: A High-Performance Learned Index on Persistent Memory","version":3},"cited_work":{"arxiv_id":"2105.00683","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.00683","snapshot_observed_at":"2026-08-05T18:47:00.565891Z","title":"APEX: A High-Performance Learned Index on Persistent Memory","venue":"cs.DB","work_id":"6e8e1762-fb1d-4d91-a317-020c27681361","year":2021},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.772969Z"},"links":{"cited_paper":"/paper/2105.00683","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:6792973217178e40ced5e4fb6da1ccdee3cc1b2e5c9335c3e07206ec836f2837","observation_id":"d0019fb3-885b-43e9-9088-347e827fbed4","resolution":{"observed_at":"2026-08-05T18:47:00.571314Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.05520","last_updated":"2021-04-13T15:49:29Z","snapshot_observed_at":"2026-08-09T13:29:04.391162Z","submitted_at":"2021-04-12T14:46:07Z","title":"Updatable Learned Index with Precise Positions","version":2},"cited_work":{"arxiv_id":"2104.05520","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.05520","snapshot_observed_at":"2026-08-05T18:47:00.541525Z","title":"Updatable Learned Index with Precise Positions","venue":"cs.DB","work_id":"3f945255-877a-4e35-886f-c7d97462fa1e","year":2021},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:57.985436Z"},"links":{"cited_paper":"/paper/2104.05520","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:5db1e74defafd3cfa3af0e9a94520dc2fcaa9bd035d27c2178b6ba3a7e51dbbd","observation_id":"c19dc41b-63a0-48d6-b9e6-dfc6401650ed","resolution":{"observed_at":"2026-08-05T18:47:00.548567Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.149945Z","title":"Xindex: a scalable learned index for multicore data storage,","venue":null,"work_id":"3e2e95f1-eb85-45b5-85c3-dd59b01e5ca3","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.129158Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:46374a0915ca43dfc19ee0ac5c03972a79f776df5f209b05883a9d0452c28b5d","observation_id":"e549c5c6-1604-4c5f-9df8-9e137d207ae1","resolution":{"observed_at":"2026-08-05T18:47:01.154993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.133780Z","title":"Finedex: a fine-grained learned index scheme for scalable and concurrent memory systems,","venue":null,"work_id":"21421d41-6890-4b81-8831-387790c17440","year":2021},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.255219Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:b301bc8f2703c45449d41fbe2020cfb4d2aaad87c093d125c9a94e11627dd790","observation_id":"84f7ffc2-3240-433b-9902-6569f79a4224","resolution":{"observed_at":"2026-08-05T18:47:01.139817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.118986Z","title":"A survey on learning to hash,","venue":null,"work_id":"0cd6b314-65d4-43db-9fb8-f2ba72cca0ba","year":2017},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.404022Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:77b3000ff0cfc6e553d16162b75968f67df3776d055b12b7cbec126dca2c1e2b","observation_id":"4c4a1a87-5e51-44e5-9b32-e6a82d530a29","resolution":{"observed_at":"2026-08-05T18:47:01.123696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.104140Z","title":"Hash function generation by neural network,","venue":null,"work_id":"6eb30cef-7782-4062-9f00-c300d69280db","year":2016},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.463246Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:f1f5811a9e39f11cd60a376ef005355c32fc8a9940f4f64485691ac99aa8b91b","observation_id":"8a9db75b-ca57-4843-9719-da0242f638b9","resolution":{"observed_at":"2026-08-05T18:47:01.108802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.089502Z","title":"Order preserving hashing for approximate nearest neighbor search,","venue":null,"work_id":"aa7b7381-ea20-412a-aa75-3b2e55e92bfd","year":2013},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.598072Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:b7de330caedccef9af5b69d6c763363d715e5fb6b1e5567b34f0a6475afc2f64","observation_id":"6c2b772a-b0e7-4022-aba6-8ac10568c825","resolution":{"observed_at":"2026-08-05T18:47:01.094085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.074104Z","title":"Can learned models replace hash functions?","venue":null,"work_id":"565feb6a-3932-4b4f-9408-4014c2e2c2f6","year":2022},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.754703Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:ddb5f1ecfeda462b2a259b28ddb0230a91e25a827a6c6168a2409092c7cfe6a3","observation_id":"919c1aa3-4cbb-4f78-a69c-7af4249c256b","resolution":{"observed_at":"2026-08-05T18:47:01.078771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.058608Z","title":"A seven-dimensional analysis of hashing methods and its implications on query processing,","venue":null,"work_id":"9bc96cde-5707-4fbd-9214-c1956486e201","year":2015},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:58.901602Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:e03c9142f384e3715685f0743416260fbf4797f74ae9caab64f80477e4e7c8d5","observation_id":"9cd2d732-08ff-4ff0-8ad4-df08193e56ad","resolution":{"observed_at":"2026-08-05T18:47:01.063498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18003","last_updated":"2024-11-20T02:04:10Z","snapshot_observed_at":"2026-07-06T18:51:49.871551Z","submitted_at":"2024-07-25T12:56:22Z","title":"Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18003","snapshot_observed_at":"2026-08-05T18:46:59.019444Z","title":"Keep the cost down: A review on methods to optimize llm’s kv-cache consumption,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.019444Z"},"links":{"cited_paper":"/paper/2407.18003","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:00b1cd32326347f85c0d9e9135fcad342dd2c3b9dcb987e8c9a852a93695b95a","observation_id":"eafe9d99-b0e2-4280-91ad-76196c72b741","resolution":{"observed_at":"2026-08-05T18:46:59.019444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:01.042067Z","title":"Cacheblend: Fast large language model serving for rag with cached knowledge fusion,","venue":null,"work_id":"14c312e1-f5a9-4fe6-9273-4ca042e19708","year":2025},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.169123Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:5ad320bd10f6f7e5a23c4ec9d9010c64dfd98969f429b9b4ff2a298c2156db15","observation_id":"3a631c83-233c-4ba6-a6a1-ce2a1b309ef0","resolution":{"observed_at":"2026-08-05T18:47:01.047864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.026151Z","title":"Milvus: A purpose-built vector data management system,","venue":null,"work_id":"49ed4d5c-1531-4a7f-aab6-68d8b6e9e984","year":2021},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.321136Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:0df94361d7a24d2d433947f3a6d4d33ad32b8e90a7fb16f9b8d8c5e618410dda","observation_id":"230a576c-3342-4b87-9f38-66c1f8ba7284","resolution":{"observed_at":"2026-08-05T18:47:01.030535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:01.011672Z","title":"Pinecone","venue":null,"work_id":"265a59a2-f334-4e32-9e97-74996d41c367","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.441233Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:2f581b00d5630d00a7e9e30153c3635d81e76b6994856c09347b47bf36490c3e","observation_id":"2174f5ad-821c-4ffa-b7c5-8207def82257","resolution":{"observed_at":"2026-08-05T18:47:01.015980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.997414Z","title":"Available: https://ai.meta.com/tools/faiss/","venue":null,"work_id":"241c3ff7-6191-4273-82af-837bfa1a9bdb","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.611415Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:cb3236e9ac268f3fafefc9e8c6a87c1ab130b4882848e10fbf99a60022584ef6","observation_id":"416ae95b-dcfa-4452-879d-46413595de24","resolution":{"observed_at":"2026-08-05T18:47:01.001901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.982877Z","title":"Retrieval- augmented generation for knowledge-intensive nlp tasks,","venue":null,"work_id":"47a5f604-5c95-4eb2-b2b9-8d9a26bea34b","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.785672Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:42c9000846296cb04f7a0be355e8699390764841d0e38249b29038016e87fc21","observation_id":"149aafad-95dc-4c0b-9f69-519862d57c8b","resolution":{"observed_at":"2026-08-05T18:47:00.987308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.968187Z","title":"Vector database management techniques and systems,","venue":null,"work_id":"ff991edd-b012-409e-bb69-c6bdcec2773e","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.943684Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:35e244db9529439ea75c79a0346521bf1480d48ce75a38cea571ee1620ca32fc","observation_id":"3b2ff263-4c5d-4742-a23c-76ad244ddad1","resolution":{"observed_at":"2026-08-05T18:47:00.972772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02669","last_updated":"2024-07-04T15:12:54Z","snapshot_observed_at":"2026-07-06T17:11:55.112404Z","submitted_at":"2024-01-05T06:53:00Z","title":"Infinite-LLM: Efficient LLM Service for Long Context with DistAttention and Distributed KVCache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02669","snapshot_observed_at":"2026-08-05T18:46:59.973133Z","title":"Infinite-llm: Efficient llm service for long context with distattention and distributed kvcache,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:59.973133Z"},"links":{"cited_paper":"/paper/2401.02669","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:4dc60d9a58dd1162a1269fb26fbf4b38c104436fd62e93164652d3f50d7c9dc5","observation_id":"ed2d8fec-9b06-4bf3-9a06-6b3beb397a16","resolution":{"observed_at":"2026-08-05T18:46:59.973133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:00.951606Z","title":"Kv-runahead: Scalable causal llm inference by parallel key-value cache generation,","venue":null,"work_id":"c2db54cf-9c05-47f8-892a-27fe9732c82e","year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.092197Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:f98aab0c3c65aaf67066a8c26198048d6ff24b39083a7996bb659efa20bb0b85","observation_id":"aaffc8e5-f9a0-49fa-b4f7-77135047595f","resolution":{"observed_at":"2026-08-05T18:47:00.956936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08192","last_updated":"2025-05-26T07:30:17Z","snapshot_observed_at":"2026-08-09T20:12:38.117416Z","submitted_at":"2025-01-14T15:14:10Z","title":"PRESERVE: Prefetching Model Weights and KV-Cache in Distributed LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08192","snapshot_observed_at":"2026-08-05T18:47:00.194227Z","title":"Preserve: Prefetching model weights and kv-cache in distributed llm serving,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.194227Z"},"links":{"cited_paper":"/paper/2501.08192","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:7e0f1f6fee259891d2461de84e579651c5ba376c715637dc08445c3985c0513e","observation_id":"f90df7e1-61a0-43f2-843e-15becc29b3a5","resolution":{"observed_at":"2026-08-05T18:47:00.194227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:47:00.936262Z","title":"Edge ai: a survey,","venue":null,"work_id":"5850eeb2-b3ac-4e39-ae4d-ce9b5441c044","year":2023},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.332664Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:174fdbf31d5cc8261aae4ad7b0a6a4b044f56693efbe5a643b9a06d9d1b287b6","observation_id":"36f01d1d-e60a-455d-a806-1ed4df29b67a","resolution":{"observed_at":"2026-08-05T18:47:00.940703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.921745Z","title":"Communication- efficient edge ai: Algorithms and systems,","venue":null,"work_id":"314f2790-05ea-47fe-940c-a2ce0795df8e","year":2020},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.394827Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:6011b951eceb36e71dbba49f536889404681da379f31c04bc678b4928b120aa8","observation_id":"5339abd6-4574-4a81-b286-e56d12289a71","resolution":{"observed_at":"2026-08-05T18:47:00.926403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.906733Z","title":"Algorithmic Nuggets in Content Delivery,","venue":null,"work_id":"3df47847-5707-48e5-b90e-1cb7cbe90227","year":2015},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.399835Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:23c3e4db28c204ac5a0ffa1880bc3bca17e04673736b873e1eafdc7b57f4a45f","observation_id":"833678c0-1e65-44db-84f0-bb4a1d0848ba","resolution":{"observed_at":"2026-08-05T18:47:00.911281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.891694Z","title":"Blockchain challenges and opportunities: A survey,","venue":null,"work_id":"1bceb704-2bad-45aa-b2de-8a9ac1d6b7ea","year":2018},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.404237Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:e42c146efa89940cb547dc23ef0dbdeb1425f8d789b07d69ee148337bde1292d","observation_id":"72e4ffd6-811a-46e6-91d0-12badb6754b8","resolution":{"observed_at":"2026-08-05T18:47:00.896422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.876266Z","title":"A survey of blockchain from the perspectives of applications, challenges, and opportunities,","venue":null,"work_id":"4ec10146-34db-4866-8363-2e3335eb86d8","year":2019},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.408333Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:abcbf599691a3da4291ac668d75784e4bc7af546f269ecb76d934ad9c78c679f","observation_id":"13f2b604-4559-4211-b34b-32db568d5b82","resolution":{"observed_at":"2026-08-05T18:47:00.881463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.860782Z","title":"Specifi- cally, we apply LEAD on a distributed collaborative ledger sys- tem [21]","venue":null,"work_id":"57b1a850-d5ff-4968-8496-41a1db7577f8","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.413695Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:4aa7056f71b4103d561cac5d12cc48c03ba32d265a7f2c010710a07d8fb5374c","observation_id":"cd2d922e-6b8d-4a23-b3fd-9891f48128bf","resolution":{"observed_at":"2026-08-05T18:47:00.865788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.845275Z","title":"Learned Hash Function","venue":null,"work_id":"a277cef2-c198-48f1-b53e-360a780d4ba2","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.420167Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:a47f45a7fa8d167a23160caa5c2a8b6633d55f3140d3a8f945d78e8f2ebbe236","observation_id":"7e21ddd7-663b-4fdd-b1ba-502892452c59","resolution":{"observed_at":"2026-08-05T18:47:00.849673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.830162Z","title":"It indicates that learned models produce a similar or reduced number of hash collisions compared to traditional hash functions","venue":null,"work_id":"4bf68820-50a4-4dd0-bb19-9d26eee8c5c7","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.424808Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:ff336b95f55d445749ae1fe61d21defa31d83fb2d53b20862a3fb61baaef7b8f","observation_id":"392b08e7-53b8-4615-93be-a70d58c829f4","resolution":{"observed_at":"2026-08-05T18:47:00.834668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.814346Z","title":null,"venue":null,"work_id":"4aaf1048-b094-48bd-a81d-dbdcc470a524","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.429234Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:6dcadde21b70e3327648e0bc05554a3963ac32cf8d4a605b64d31d3e2e00da21","observation_id":"1ea6cf2e-1f6e-4d04-982f-4ab69581266c","resolution":{"observed_at":"2026-08-05T18:47:00.819148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.797536Z","title":null,"venue":null,"work_id":"111b135f-85c7-4249-a5e3-a1f1db7cbe85","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.433593Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:17e86f3225cf14be6e8cfc667f847d06366edbbdfb6675814d93cc786479c451","observation_id":"f3d025a0-03dc-4ee2-a4a0-e6d36dcfcb29","resolution":{"observed_at":"2026-08-05T18:47:00.802123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.781895Z","title":"LEAD can hash composite keys 〈device-ID, timestamp 〉 so that adjacent time ranges map to adjacent roadside or gateway peers","venue":null,"work_id":"e5360283-2ef2-4a8a-87dc-909d3ed50229","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.437835Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:913ccef6a98bd173ad919e03eda0f0a408da8021bf92708b52e0a751719c5e8b","observation_id":"265e183c-074e-4997-84b1-b9bb35446e67","resolution":{"observed_at":"2026-08-05T18:47:00.786935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.767167Z","title":"demand-responsive","venue":null,"work_id":"16142e7b-35f9-417d-bad2-9e20e024d93b","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.442111Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:b4d84b188b4752b109c9aab171ae1bf705765f0c41c74d136c4cbf34e6852a25","observation_id":"4b5efd99-8bc1-4228-a98a-ffad88800f12","resolution":{"observed_at":"2026-08-05T18:47:00.771502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.751986Z","title":null,"venue":null,"work_id":"d02fc57d-38ea-4da4-9b84-0959e38a5d31","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.446306Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:b22adcd42a8a55b60e909d25830c7362b1e725ef1a99ea677e2851171a6179dd","observation_id":"956f2d36-5a9b-4176-82d8-8629d4d4ed5e","resolution":{"observed_at":"2026-08-05T18:47:00.756659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:47:00.737165Z","title":null,"venue":null,"work_id":"474b2e69-21dd-44ed-9f8b-2258da2141b0","year":null},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T18:47:00.451140Z"},"links":{"citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:057e7b124701e58477c9e4bf00bd3d91e3a53fd21bdc384f39fd71e2161caba2","observation_id":"cdc8f3e0-0a98-45c9-ab20-64efb6e1094f","resolution":{"observed_at":"2026-08-05T18:47:00.741544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-08T22:52:46.811293Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":59},"total_outbound_references":73},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 0 inbound Pith citation observations for arXiv:2508.14239."}