Paper Citation Record · LEDGER

Three Algorithms for Merging Hierarchical Navigable Small World Graphs

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

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

pith.paper-citation-record.v1
2505.16064 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:10:32.357299Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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

33 of 33 outbound references displayed

verified exact1
verified fuzzy28
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6f8e7482-a429-4fe3-a849-3c2a0acd0534 · outbound

This paper cites K-d trees for semidynamic point sets.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs K-d trees for semidynamic point sets

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:42.269840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ab07cac1-5468-4c7d-8c67-09b1d0a9760f · outbound

This paper cites R-trees: A dynamic index structure for spatial search- ing.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs R-trees: A dynamic index structure for spatial search- ing

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:42.049967Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 01efea28-e971-44b4-a9e2-592324557af3 · outbound

This paper cites Data structures and algorithms for nearest neighbor search in general metric spaces.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Data structures and algorithms for nearest neighbor search in general metric spaces

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:41.813187Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 944b55df-daac-4543-95b4-7a1e7edf4972 · outbound

This paper cites M-tree: An e cient access method for similarity search in metric spaces.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs M-tree: An e cient access method for similarity search in metric spaces

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:41.670514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e7715ba9-c1ff-42a4-8f4d-f224bdd2da81 · outbound

This paper cites Cover trees for nearest neighbor.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Cover trees for nearest neighbor

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T15:10:30.140194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef918cb6-6a20-4cf2-bd72-6e751ebf0405 · outbound

This paper cites Sim- ilarity search: the metric space approach, volume 32.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Sim- ilarity search: the metric space approach, volume 32

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:41.471934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation fccb60c8-23ae-4111-abeb-2899f37ce5af · outbound

This paper cites Local-descriptor matching for image identification.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Local-descriptor matching for image identification

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:41.299484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ed2d3158-cd6c-4628-9b76-665646df200f · outbound

This paper cites Similarity search in high dimensions via hashing.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Similarity search in high dimensions via hashing

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:41.121878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 89696683-65f0-4e43-ac68-5ed4fb08e45e · outbound

This paper cites Locality-sensitive hashing scheme based on p-stable distributions.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Locality-sensitive hashing scheme based on p-stable distributions

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.967972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 26cd23ec-a2d7-4407-b0f5-b8278399f57c · outbound

This paper cites Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.822353Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f8656955-01a2-46b6-8bc3-84a1cfac81af · outbound

This paper cites Optimal data-dependent hashing for approximate near neighbors.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Optimal data-dependent hashing for approximate near neighbors

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.648200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ea1a4a78-53f1-4d73-b1d9-4895c87f7543 · outbound

This paper cites Product quantization for nearest neighbor search.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Product quantization for nearest neighbor search

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.552733Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 49867fa4-edfa-4cc1-83b4-6b3d421d1296 · outbound

This paper cites Optimized product quantization for approximate nearest neighbor search.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Optimized product quantization for approximate nearest neighbor search

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.439943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e0ae07de-cec4-452c-852b-ca6948ce1503 · outbound

This paper cites an unresolved cited work.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Unresolved cited work

Reference 14

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:10:40.325893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation acb68a6d-08bc-4dd5-a488-5ce5024bc279 · outbound

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

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:40.035391Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 0b0a42fe-d879-46a4-a2ba-82f1580657db · outbound

This paper cites Ann- benchmarks: A benchmarking tool for approximate nearest neighbor al- gorithms.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Ann- benchmarks: A benchmarking tool for approximate nearest neighbor al- gorithms

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:39.582734Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 00c9c7a2-615e-4f82-acdc-71dcbb732273 · outbound

This paper cites The faiss library.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs The faiss library

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:39.323146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b41a9da2-2ad7-49ca-91e9-64861693b475 · outbound

This paper cites Engineering efficient and effec- tive non-metric space library.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Engineering efficient and effec- tive non-metric space library

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:39.094301Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation a257cf42-5d10-4547-901e-5b58de42981f · outbound

This paper cites Understanding Hierarchical Navigable Small World Indexes, 2023.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Understanding Hierarchical Navigable Small World Indexes, 2023

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:38.894053Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 62364555-18bc-4ede-9b70-beed30ef443e · outbound

This paper cites https://milvus.io/docs/hnsw.md, 2024.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs https://milvus.io/docs/hnsw.md, 2024

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:38.712653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation a7557877-95b6-4047-a366-b5ee4884e8c2 · outbound

This paper cites https://zilliz.com/blog/ hnsw, 2022.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs https://zilliz.com/blog/ hnsw, 2022

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:38.537714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b90457bc-41ed-443a-ae8f-d305efd3ec00 · outbound

This paper cites Vector Index.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Vector Index

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:37.257179Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 35498447-8e3f-412c-a6aa-32d3df41e125 · outbound

This paper cites Approximate nearest neighbor search small world approach.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Approximate nearest neighbor search small world approach

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:34.897707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b31fd162-7953-455c-971d-6915beaadcb8 · outbound

This paper cites Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:34.517711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 918e0a9b-3ba3-4687-896c-82442585d6bc · outbound

This paper cites Approximate nearest neighbor algorithm based on navigable small world graphs.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Approximate nearest neighbor algorithm based on navigable small world graphs

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-07T15:10:31.696877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51fd2391-e7e1-4ddd-b1c1-0b5f110b7e17 · outbound

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

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Graph-based nearest neighbor search: From practice to theory

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-07T15:10:31.863345Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e182a37f-af03-41ee-9996-2c1a84c54cfd · outbound

This paper cites Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:10:32.593084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f4bbd58d-acae-466a-97a7-596cc567e5d1 · outbound

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

Three Algorithms for Merging Hierarchical Navigable Small World Graphs Diskann: Fast accurate billion-point nearest neighbor search on a single node

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:34.276492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation c4df9a67-467d-4e9f-b117-dd4db1dd2016 · outbound

This paper cites A com- prehensive survey and experimental comparison of graph-based approx- imate nearest neighbor search.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs A com- prehensive survey and experimental comparison of graph-based approx- imate nearest neighbor search

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:33.865481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 409351fd-d562-4b77-86fd-44c7a848a244 · outbound

This paper cites USearch by Unum Cloud.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs USearch by Unum Cloud

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:33.602147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 77e08103-58b7-4e13-944a-4da7f595b0d6 · outbound

This paper cites hnswlib: Hierarchical navigable small world graphs library.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs hnswlib: Hierarchical navigable small world graphs library

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:33.323727Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 37a2bd8a-271d-4d8e-bba6-e18f42197362 · outbound

This paper cites https://www.elastic.co/blog/ introducing-hnsw-graphs, 2023.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs https://www.elastic.co/blog/ introducing-hnsw-graphs, 2023

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:33.050698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2891eec9-ab87-4da1-b3b2-af64205fd234 · outbound

This paper cites On the merge of k-nn graph.

Three Algorithms for Merging Hierarchical Navigable Small World Graphs On the merge of k-nn graph

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:10:32.792354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

No inbound Pith citation observations are available.