{"as_of":"2026-08-01T17:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:058f77073cc02bf3e96ea3ac0af03993562306576bd57a72ee5d04aec091e7cb","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-06-28T08:30:35.893983Z","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-02T05:16:38.734218Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.15478","last_updated":"2024-03-04T14:07:14Z","snapshot_observed_at":"2026-07-06T12:13:42.924970Z","submitted_at":"2021-11-30T15:14:07Z","title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree","version":5},"cited_work":{"arxiv_id":"2111.15478","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.15478","snapshot_observed_at":"2026-07-02T05:16:38.734218Z","title":null,"venue":null,"work_id":"f10373c8-0619-409a-9648-07d3f158f226","year":2021},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-07-06T23:43:27.226603Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"cited_paper":"/paper/2111.15478","citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:e2775e95e17953a4817c5df36e733304c594201975a40d2e86326dd9cb238c9d","observation_id":"7d8b4361-2243-4bb8-8ab0-5a9ca48a97c2","resolution":{"observed_at":"2026-07-02T05:16:38.735696Z","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/2111.15478/citation-record","integrity":"/paper/2111.15478/integrity","json":"/paper/2111.15478/citation-record.json","paper":"/paper/2111.15478"},"outbound":[],"paper":{"arxiv_id":"2111.15478","last_updated":"2024-03-04T14:07:14Z","latest_version":5,"primary_category":"cs.CG","snapshot_observed_at":"2026-07-06T12:13:42.924970Z","submitted_at":"2021-11-30T15:14:07Z","title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree"},"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:2111.15478."}