Pith. sign in

Paper Citation Record · LEDGER

On the Difficulty of Nearest Neighbor Search

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1206.6411.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1206.6411 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T18:52:59.037682Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T05:11:48.550580Z

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 b6d6ba54-8cdc-4855-b66a-75bae3c25071 · inbound

Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art cites this paper.

Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art On the Difficulty of Nearest Neighbor Search

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-08T18:52:59.037682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T18:52:59.037682Z digest=sha256:c40756be70eec876fbe6c811219de91776e08c3c71c7bdefbff5ac3b53ca6bb1

Observation 42e51b16-8b21-4cf8-be55-576dfc79840c · inbound

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search cites this paper.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search On the Difficulty of Nearest Neighbor Search

Reference 43

Resolution
verified exact
local_arxiv, observed 2026-08-05T05:11:48.554087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.215810Z digest=sha256:f5086e2c18cee7378cbd9984e2f7d5b90abb4c2fbb4730010ecf235cfba805c3