{"as_of":"2026-08-24T04:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f23d4a746e5ab21e6835fad394dc51f805b77aaec47245c0d4fa158638c1e4a","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:52:59.453459Z","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-02T03:16:33.319743Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","snapshot_observed_at":"2026-08-16T17:01:52.035525Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.03763","snapshot_observed_at":"2026-08-08T18:52:59.453459Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05575","last_updated":"2025-09-05T08:09:51Z","snapshot_observed_at":"2026-08-18T20:59:25.131937Z","submitted_at":"2025-02-08T14:03:43Z","title":"Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art","version":2},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-08-08T18:52:59.453459Z"},"links":{"cited_paper":"/paper/2205.03763","citing_paper":"/paper/2502.05575"},"observation_digest":"sha256:2ef56c60285c148a31436246863344de5d21f0dade7da44d625037219ba6daf4","observation_id":"37c4cafb-b472-4965-9736-a02c7db9f6ba","resolution":{"observed_at":"2026-08-08T18:52:59.453459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","snapshot_observed_at":"2026-08-16T17:01:52.035525Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.03763","snapshot_observed_at":"2026-08-05T05:11:48.303480Z","title":"V., Williams, G., Aum \\\" u ller, M., Douze, M., Babenko, A., Baranchuk, D., Chen, Q., Hosseini, L., Krishnaswamy, R., Srinivasa, G., Subramanya, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-18T21:04:05.777869Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.303480Z"},"links":{"cited_paper":"/paper/2205.03763","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:fa4a03d506f18fada575581b1085c05345ba7877666547415d37c60f17a95324","observation_id":"405b0bb1-fd75-4182-ba18-aba25ba4e061","resolution":{"observed_at":"2026-08-05T05:11:48.303480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","snapshot_observed_at":"2026-08-16T17:01:52.035525Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.03763","snapshot_observed_at":"2026-08-03T11:16:04.167580Z","title":"arXiv:2205.03763 [cs.LG] https://arxiv.org/abs/2205.03763","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.07048","last_updated":"2026-07-31T03:12:32Z","snapshot_observed_at":"2026-08-20T09:53:53.762408Z","submitted_at":"2026-01-11T19:51:54Z","title":"GPU-Accelerated ANNS: Quantized for Speed, Built for Change","version":5},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T11:16:04.167580Z"},"links":{"cited_paper":"/paper/2205.03763","citing_paper":"/paper/2601.07048"},"observation_digest":"sha256:aa8d4fb3b262e0039f82f3b158873b1c772d09f6858cae7bb383beeaab16725a","observation_id":"0e58ad5a-1411-4866-9c9a-b4a739e46b94","resolution":{"observed_at":"2026-08-03T11:16:04.167580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","snapshot_observed_at":"2026-08-16T17:01:52.035525Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2205.03763","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.03763","snapshot_observed_at":"2026-07-02T03:16:33.319743Z","title":null,"venue":null,"work_id":"42ae18fe-30d0-4028-84e4-46991acc42d3","year":2022},"citing_paper":{"arxiv_id":"2607.00768","last_updated":"2026-07-01T10:52:09Z","snapshot_observed_at":"2026-08-12T16:01:25.964838Z","submitted_at":"2026-07-01T10:52:09Z","title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-02T03:11:31.712329Z"},"links":{"cited_paper":"/paper/2205.03763","citing_paper":"/paper/2607.00768"},"observation_digest":"sha256:0e7d15916ba42ea9df02ccaf68301cee64e5b0bc3466adec0c1f6d7abc78c566","observation_id":"af55ca71-dfac-42b2-9b54-fcd2866bf12b","resolution":{"observed_at":"2026-07-02T03:16:33.322039Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.03763/citation-record","integrity":"/paper/2205.03763/integrity","json":"/paper/2205.03763/citation-record.json","paper":"/paper/2205.03763"},"outbound":[],"paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:01:52.035525Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2205.03763."}