{"as_of":"2026-08-11T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46e6bf45bd4dee9b1c83dff453f84fc335256c146b7c0573391b7146ec5b16bc","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T05:36:52.807593Z","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-07-03T01:37:31.223088Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-08-08T05:36:52.807593Z","title":"Spann: Highly-efficient billion-scale approximate nearest neighbor search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08331","last_updated":"2025-02-12T11:54:15Z","snapshot_observed_at":"2026-08-10T14:24:16.889562Z","submitted_at":"2025-02-12T11:54:15Z","title":"Brame: Hierarchical Data Management Framework for Cloud-Edge-Device Collaboration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T05:36:52.807593Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2502.08331"},"observation_digest":"sha256:e4d9a5aadbde258dc73d7bd8dc435bd3c92883563939b5c89f53eaad3fc744f3","observation_id":"04e693a9-cd6c-441b-bbfd-26b7da74fd52","resolution":{"observed_at":"2026-08-08T05:36:52.807593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-08-06T14:03:49.283567Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.283567Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:324393b62310a1af32bb4df99f2acbdf56512ef4429648c7471bec52dd67bc2a","observation_id":"be31ce9f-7539-4ad9-b06d-35687bac0417","resolution":{"observed_at":"2026-08-06T14:03:49.283567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2111.08566","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-07-03T01:37:31.223088Z","title":null,"venue":null,"work_id":"1ea9cf51-0fb5-432f-b3e0-83b205185473","year":2021},"citing_paper":{"arxiv_id":"2606.09441","last_updated":"2026-06-08T12:50:13Z","snapshot_observed_at":"2026-08-03T04:43:09.780812Z","submitted_at":"2026-06-08T12:50:13Z","title":"SIFT: Selective-Index For Fast Compute of RAG Prefill by Exploiting Attention Invariance","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T16:24:31.109508Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2606.09441"},"observation_digest":"sha256:c9aced59086ed157196a3c22e5cc5d9891e705c477de69217220945083cb6939","observation_id":"b46911aa-4e47-40ad-84b4-3ed79d03b226","resolution":{"observed_at":"2026-07-03T01:37:31.224456Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2111.08566","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-07-03T01:37:31.223088Z","title":null,"venue":null,"work_id":"1ea9cf51-0fb5-432f-b3e0-83b205185473","year":2021},"citing_paper":{"arxiv_id":"2607.00768","last_updated":"2026-07-01T10:52:09Z","snapshot_observed_at":"2026-08-03T20:26:39.740621Z","submitted_at":"2026-07-01T10:52:09Z","title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T03:11:31.712329Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2607.00768"},"observation_digest":"sha256:fbfda86b43dec955370ecb1cf549eb5dcd7a9241dfdc3e3a5ca3ec84e776c1c2","observation_id":"651ae147-20c8-4981-939e-fb0c0a223078","resolution":{"observed_at":"2026-07-02T03:16:33.272919Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-08-04T01:22:26.739375Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00650","last_updated":"2026-08-01T13:09:51Z","snapshot_observed_at":"2026-08-08T11:48:20.923413Z","submitted_at":"2026-08-01T13:09:51Z","title":"TEngineDB-V: An OLAP-Native Vector Search System for Large-$k$ Workloads at Tencent","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T01:22:26.739375Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2608.00650"},"observation_digest":"sha256:3e8dbe6ea6c871f011bc1c8650ce4ef3629a655671b41678f29f353266ecf8f9","observation_id":"d6d1746a-f4c4-4056-909b-657ea9ee9336","resolution":{"observed_at":"2026-08-04T01:22:26.739375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.08566/citation-record","integrity":"/paper/2111.08566/integrity","json":"/paper/2111.08566/citation-record.json","paper":"/paper/2111.08566"},"outbound":[],"paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search"},"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 5 inbound Pith citation observations for arXiv:2111.08566."}