{"as_of":"2026-08-11T12:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9b15034d2d2c0c4f949b0a2b396c1d2ed0a2e02a7df34c668de824fa35a8088","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:47:23.180173Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T02:20:14.230656Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.14905","last_updated":"2021-11-29T19:23:58Z","snapshot_observed_at":"2026-07-06T12:13:20.920994Z","submitted_at":"2021-11-29T19:23:58Z","title":"Bounding the Last Mile: Efficient Learned String Indexing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14905","snapshot_observed_at":"2026-08-08T19:47:23.180173Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.180173Z"},"links":{"cited_paper":"/paper/2111.14905","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:51d49fab56409a7324c46254b19bf1a955e312046bebf504350f8b0bd54ffdba","observation_id":"81b0c82f-33df-47fc-916a-1484739a52d3","resolution":{"observed_at":"2026-08-08T19:47:23.180173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14905","last_updated":"2021-11-29T19:23:58Z","snapshot_observed_at":"2026-07-06T12:13:20.920994Z","submitted_at":"2021-11-29T19:23:58Z","title":"Bounding the Last Mile: Efficient Learned String Indexing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14905","snapshot_observed_at":"2026-08-07T05:11:17.709471Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08671","last_updated":"2025-06-10T10:31:09Z","snapshot_observed_at":"2026-08-10T20:59:21.798004Z","submitted_at":"2025-06-10T10:31:09Z","title":"Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:11:17.709471Z"},"links":{"cited_paper":"/paper/2111.14905","citing_paper":"/paper/2506.08671"},"observation_digest":"sha256:c1f9f1722eb1f9915315ef4b55f823d19436c3d8cb87a993908f6aceddd98c56","observation_id":"faa3cfe7-f9bb-43d6-a60d-2fc52fdac215","resolution":{"observed_at":"2026-08-07T05:11:17.709471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14905","last_updated":"2021-11-29T19:23:58Z","snapshot_observed_at":"2026-07-06T12:13:20.920994Z","submitted_at":"2021-11-29T19:23:58Z","title":"Bounding the Last Mile: Efficient Learned String Indexing","version":1},"cited_work":{"arxiv_id":"2111.14905","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.14905","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"970ffeed-de84-4f40-ba4f-96b99075133d","year":2021},"citing_paper":{"arxiv_id":"2605.23815","last_updated":"2026-05-22T16:16:52Z","snapshot_observed_at":"2026-07-06T23:33:59.210165Z","submitted_at":"2026-05-22T16:16:52Z","title":"A Pragmatic Approach to Learned Indexing in RocksDB: Targeted Optimizations with Minimal System Modification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T02:19:28.733547Z"},"links":{"cited_paper":"/paper/2111.14905","citing_paper":"/paper/2605.23815"},"observation_digest":"sha256:7f9548c9d03a62cbf43cca6c39fe9776b73174acb2097853d4665f14245b42cf","observation_id":"a8b75c3d-5df9-4557-949a-63bac719ecb4","resolution":{"observed_at":"2026-05-25T02:20:14.233140Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.14905/citation-record","integrity":"/paper/2111.14905/integrity","json":"/paper/2111.14905/citation-record.json","paper":"/paper/2111.14905"},"outbound":[],"paper":{"arxiv_id":"2111.14905","last_updated":"2021-11-29T19:23:58Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-07-06T12:13:20.920994Z","submitted_at":"2021-11-29T19:23:58Z","title":"Bounding the Last Mile: Efficient Learned String Indexing"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2111.14905."}