{"as_of":"2026-08-01T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:43951907f99ea3499b17cfb3053f2e5d5a92ea5e4ee07da499b5b75d697e983e","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-01T06:32:01.292127+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-05-11T02:38:26.167721Z","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-11T03:10:53.309788Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.06553","last_updated":"2022-01-20T15:19:24Z","snapshot_observed_at":"2026-07-06T12:28:03.630719Z","submitted_at":"2022-01-17T18:12:38Z","title":"Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space","version":2},"cited_work":{"arxiv_id":"2201.06553","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.06553","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f7bfbb6b-8bfa-4529-9ada-0a36fa313595","year":2022},"citing_paper":{"arxiv_id":"2605.07770","last_updated":"2026-05-08T14:11:49Z","snapshot_observed_at":"2026-07-06T23:20:06.574823Z","submitted_at":"2026-05-08T14:11:49Z","title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-11T02:38:26.167721Z"},"links":{"cited_paper":"/paper/2201.06553","citing_paper":"/paper/2605.07770"},"observation_digest":"sha256:ef8a67a3af864fd90e9b234d170e9413d123dd5623a1d0b26b46805a96dc8cf8","observation_id":"63fce088-2c23-4cf5-beec-d0b6135b4bb5","resolution":{"observed_at":"2026-05-11T03:10:53.311144Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-01T06:32:01.292127+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-01T06:32:01.292127+00:00","source":"crossref"},{"observed_at":"2026-08-01T06:31:58.492377+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.06553/citation-record","integrity":"/paper/2201.06553/integrity","json":"/paper/2201.06553/citation-record.json","paper":"/paper/2201.06553"},"outbound":[],"paper":{"arxiv_id":"2201.06553","last_updated":"2022-01-20T15:19:24Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-07-06T12:28:03.630719Z","submitted_at":"2022-01-17T18:12:38Z","title":"Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space"},"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-01T06:32:01.292127+00:00","source":"crossref"},{"observed_at":"2026-08-01T06:31:58.492377+00:00","source":"retraction_watch"}],"thesis":"As of 1 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2201.06553."}