Paper Citation Record · LEDGER

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness

As of 16 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2507.14060.

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

pith.paper-citation-record.v1
2507.14060 v1

Coverage vector

measured 23 of 23 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:23:30.617105Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

23 of 23 outbound references displayed

verified exact0
verified fuzzy17
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 99f3d122-1160-47c9-9c41-2a3410948dd6 · outbound

This paper cites Raykar, Kirankumar Shiragur, and Haike Xu.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Raykar, Kirankumar Shiragur, and Haike Xu

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.858879Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 1dd9da83-726d-4af4-813c-b8918cdd2a73 · outbound

This paper cites Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T16:23:28.808922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 085de39c-927a-4cb2-bd6f-90bd7dfbd56b · outbound

This paper cites Cover trees for nearest neighbor.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Cover trees for nearest neighbor

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-06T16:23:28.923821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5be74378-1d57-4ceb-97d5-9465635ff85d · outbound

This paper cites Efficiently constructing sparse navigable graphs, 2025.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Efficiently constructing sparse navigable graphs, 2025

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.752665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 96bd0df0-e7f9-4cab-95ee-9c05e221cc94 · outbound

This paper cites Clarkson.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Clarkson

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.590758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 3dab7f35-fdb0-4c87-879c-5e07b59cba92 · outbound

This paper cites Navigable graphs for high-dimensional nearest neighbor search: Constructions and limits.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Navigable graphs for high-dimensional nearest neighbor search: Constructions and limits

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.440796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 6b927733-6639-4381-8e3c-b2ff9a592385 · outbound

This paper cites Beyond the Worst-Case Analysis of Algorithms , chapter Nearest Neighbor Classification and Search.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Beyond the Worst-Case Analysis of Algorithms , chapter Nearest Neighbor Classification and Search

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.273115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation a9a723aa-1371-4945-8904-b24ab588dd44 · outbound

This paper cites Analytical approach to parallel repetition.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Analytical approach to parallel repetition

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.144507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 6af91fb4-c8c9-47bc-8824-02d8177020ae · outbound

This paper cites Fast approximate nearest neighbor search with the navigating spreading-out graph.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Fast approximate nearest neighbor search with the navigating spreading-out graph

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:33.007146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5bd037a6-6398-42ef-8ea2-7ad416cb6bdd · outbound

This paper cites Gupta, R.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Gupta, R

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:32.810373Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 818a9545-aabd-4cd0-acab-f7f3f14b61d3 · outbound

This paper cites Sort before you prune: Improved worst-case guarantees of the disk ANN family of graphs.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Sort before you prune: Improved worst-case guarantees of the disk ANN family of graphs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:32.617942Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 7da4fcbe-ab94-4ca6-b027-cc944df89c66 · outbound

This paper cites Set Cover in Sub-linear Time.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Set Cover in Sub-linear Time

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:32.476817Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation a3bfaf76-b0aa-45dd-ad01-e20c3ea00c6f · outbound

This paper cites Worst-case performance of popular approximate nearest neighbor search implementations: Guarantees and limitations.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Worst-case performance of popular approximate nearest neighbor search implementations: Guarantees and limitations

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:32.314898Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c0b7d52f-d8b3-4b94-aa56-c2c5bb8a441a · outbound

This paper cites an unresolved cited work.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Unresolved cited work

Reference 14

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:23:32.188556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 367c4ac4-1f3b-4f4a-b417-eb6c66a2cb9c · outbound

This paper cites Diskann: Fast accurate billion-point nearest neighbor search on a single node.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Diskann: Fast accurate billion-point nearest neighbor search on a single node

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:32.033927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 92862936-58c5-4284-9927-ecb5aaf6d266 · outbound

This paper cites an unresolved cited work.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Unresolved cited work

Reference 16

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:23:31.841068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation ac609635-d673-45ac-af68-72a309716974 · outbound

This paper cites an unresolved cited work.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:23:31.700281Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c69cd5fd-4e9d-4174-b3ef-12d3d979a378 · outbound

This paper cites Graph-based time-space trade-offs for approximate near neighbors.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Graph-based time-space trade-offs for approximate near neighbors

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:31.503757Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 9214f825-5596-447e-9b7b-34223786c64e · outbound

This paper cites Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:31.351836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 34400c9c-2619-469c-bc92-6a3ea43ef561 · outbound

This paper cites Graph-based nearest neighbor search: From practice to theory.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Graph-based nearest neighbor search: From practice to theory

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:31.178624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 256c9ea2-c08d-4674-8737-9662dc47225b · outbound

This paper cites Results of the big ann: Neurips'23 competition, 2024.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Results of the big ann: Neurips'23 competition, 2024

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:31.032003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation d062ba19-f5df-4403-b356-f4ffd9ad3bc9 · outbound

This paper cites Results of the NeurIPS'21 challenge on billion-scale approximate nearest neighbor search.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness Results of the NeurIPS'21 challenge on billion-scale approximate nearest neighbor search

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:23:30.817662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b90574ad-1c11-436d-aa30-332d36d88d5c · outbound

This paper cites A Bi-metric Framework for Fast Similarity Search.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness A Bi-metric Framework for Fast Similarity Search

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-06T16:23:30.617105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.