{"as_of":"2026-08-08T09:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cef69ab1544cc08ca2fa937c3ce1d31fa6ba97b31ea2ce92bacce351480e28df","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:51:23.993543Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T23:51:25.166548Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.11083","last_updated":"2020-12-21T02:18:05Z","snapshot_observed_at":"2026-08-08T08:05:06.770191Z","submitted_at":"2020-12-21T02:18:05Z","title":"A Note on Graph-Based Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2012.11083","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.11083","snapshot_observed_at":"2026-08-06T23:51:25.166548Z","title":"A Note on Graph-Based Nearest Neighbor Search","venue":"cs.LG","work_id":"34c290aa-ed04-4df1-9f4f-c85902de9734","year":2020},"citing_paper":{"arxiv_id":"2506.15986","last_updated":"2025-06-19T03:07:12Z","snapshot_observed_at":"2026-08-06T23:42:15.336450Z","submitted_at":"2025-06-19T03:07:12Z","title":"Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T23:51:23.993543Z"},"links":{"cited_paper":"/paper/2012.11083","citing_paper":"/paper/2506.15986"},"observation_digest":"sha256:9f36b0cec25be95d914857467483876ef644514c920b263d66123fdf517ef26a","observation_id":"c7ce2a05-1f18-4d0f-aa5f-f80bf03677f2","resolution":{"observed_at":"2026-08-06T23:51:25.282422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.11083/citation-record","integrity":"/paper/2012.11083/integrity","json":"/paper/2012.11083/citation-record.json","paper":"/paper/2012.11083"},"outbound":[],"paper":{"arxiv_id":"2012.11083","last_updated":"2020-12-21T02:18:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T08:05:06.770191Z","submitted_at":"2020-12-21T02:18:05Z","title":"A Note on Graph-Based 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.11083."}