Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-01T06:32:01.292127+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-28T08:30:35.893983Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T05:16:38.734218Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 7d8b4361-2243-4bb8-8ab0-5a9ca48a97c2 · inbound
Parallel Metric Skiplists and Nearest Neighbor Search cites this paper.
Parallel Metric Skiplists and Nearest Neighbor Search A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
Reference 18
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T05:16:38.735696Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-01T06:32:01.292127+00:00.