{"as_of":"2026-08-12T04:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd026a58d91e8b550e63da41007d520f08e7e2e678c49b19b58d3dd698fec83e","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:10:32.357299Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.16064/citation-record","integrity":"/paper/2505.16064/integrity","json":"/paper/2505.16064/citation-record.json","paper":"/paper/2505.16064"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:42.154608Z","title":"K-d trees for semidynamic point sets","venue":null,"work_id":"e063600c-9495-4eba-86b6-bc2085fd9c3d","year":1990},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:29.886318Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:a081b64da203b1fba1a779ec5a9d54e81d1f46f3d2557e18b49309cb4ba46804","observation_id":"6f8e7482-a429-4fe3-a849-3c2a0acd0534","resolution":{"observed_at":"2026-08-07T15:10:42.269840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.936481Z","title":"R-trees: A dynamic index structure for spatial search- ing","venue":null,"work_id":"0a9d6564-11b8-44be-98cc-3ec614951d1e","year":1984},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:29.916002Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:0071cef5293d75f659f2f4f3b4b1e3ee74f8eff448eed2f5f59987355aec5648","observation_id":"ab07cac1-5468-4c7d-8c67-09b1d0a9760f","resolution":{"observed_at":"2026-08-07T15:10:42.049967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.744310Z","title":"Data structures and algorithms for nearest neighbor search in general metric spaces","venue":null,"work_id":"97abf80c-56e7-43a5-bb2b-c82fc528f68b","year":1993},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:29.984585Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:b703e89c4116294484922cdcbfe11ba8f03a3a92d1a58e23cb01408b85c92705","observation_id":"01efea28-e971-44b4-a9e2-592324557af3","resolution":{"observed_at":"2026-08-07T15:10:41.813187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.603591Z","title":"M-tree: An e cient access method for similarity search in metric spaces","venue":null,"work_id":"bd459227-fbb0-4ea5-86c0-fbe164abcee6","year":1997},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.054215Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:c028a3219320a5b57bca826163d7c728158bdb09d77171e01fe4d9efc515d0ee","observation_id":"944b55df-daac-4543-95b4-7a1e7edf4972","resolution":{"observed_at":"2026-08-07T15:10:41.670514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:30.140194Z","title":"Cover trees for nearest neighbor","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.140194Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:50c29af29e2d5f91feaaa6413edead66c0a7141a6fe944766ee7c8a11c44e401","observation_id":"e7715ba9-c1ff-42a4-8f4d-f224bdd2da81","resolution":{"observed_at":"2026-08-07T15:10:30.140194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.398843Z","title":"Sim- ilarity search: the metric space approach, volume 32","venue":null,"work_id":"f43f490e-7ebf-4b2b-9cfe-8b3d90301af7","year":2006},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.164854Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:e0e9670880bb88759d114b2109aadf71472a6e10e910d1715154a6ddd4cb8174","observation_id":"ef918cb6-6a20-4cf2-bd72-6e751ebf0405","resolution":{"observed_at":"2026-08-07T15:10:41.471934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.209372Z","title":"Local-descriptor matching for image identification","venue":null,"work_id":"d030a9bb-fb84-4f79-ad8f-a6ac7e56a49b","year":1998},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.277907Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:4db950e047c3c2bd5a6f9e55facbd85addf65f938fda29c42923ce7f64733a20","observation_id":"fccb60c8-23ae-4111-abeb-2899f37ce5af","resolution":{"observed_at":"2026-08-07T15:10:41.299484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:41.065635Z","title":"Similarity search in high dimensions via hashing","venue":null,"work_id":"e599acb7-6e59-4e4a-a88f-a29ceed0a532","year":1999},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.409987Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:dfec964d42a1b1d6a3ab01f717906dc8ddf53c4f987173c4125aea44127ee500","observation_id":"ed2d3158-cd6c-4628-9b76-665646df200f","resolution":{"observed_at":"2026-08-07T15:10:41.121878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.892961Z","title":"Locality-sensitive hashing scheme based on p-stable distributions","venue":null,"work_id":"004f295a-8e8a-4bfd-92b8-fec5695b1087","year":2004},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.507765Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:9d1ec6a67b703a6057e467df7da23ba23fc1981433b8fc3cadd8aad8c4a847ef","observation_id":"89696683-65f0-4e43-ac68-5ed4fb08e45e","resolution":{"observed_at":"2026-08-07T15:10:40.967972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.723197Z","title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","venue":null,"work_id":"1d0ec2be-2071-415f-aca7-d4da01a5b1b6","year":2008},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.571717Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:34d284705e902fdcdf558655e6ec9ae7a3ad9613294b55ed4cc07ff0dfa42a42","observation_id":"26cd23ec-a2d7-4407-b0f5-b8278399f57c","resolution":{"observed_at":"2026-08-07T15:10:40.822353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.597954Z","title":"Optimal data-dependent hashing for approximate near neighbors","venue":null,"work_id":"859d353c-ba95-439f-9eb7-9bd5bf78b48c","year":2015},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.690572Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:047f381e009df2d399640969102306c9b4980118ce85fd57e7bca0f898e0c515","observation_id":"f8656955-01a2-46b6-8bc3-84a1cfac81af","resolution":{"observed_at":"2026-08-07T15:10:40.648200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.486992Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":"734b5968-afd3-4553-8df5-ba1168611f6f","year":2011},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.821648Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:fd5a2958b89f30cbb4105fafc943e0357a50a02612c1ef502a988a76d225405a","observation_id":"ea1a4a78-53f1-4d73-b1d9-4895c87f7543","resolution":{"observed_at":"2026-08-07T15:10:40.552733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.389852Z","title":"Optimized product quantization for approximate nearest neighbor search","venue":null,"work_id":"240a6690-ebab-462a-bfdc-e5f47c194ebc","year":2013},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.859154Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:1f674018d1d1632bdcf6ebafd9db0eb8c2f2b1e848b3454ae04fd7e11932d4c0","observation_id":"49867fa4-edfa-4cc1-83b4-6b3d421d1296","resolution":{"observed_at":"2026-08-07T15:10:40.439943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:40.271821Z","title":null,"venue":null,"work_id":"abdf8150-2f82-4676-9de0-ea525d098908","year":2013},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.891547Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:62fdb7948cd547e59840cd1fb5207b5941aa9e5923b6b85d0a34d789e1282ee0","observation_id":"e0ae07de-cec4-452c-852b-ca6948ce1503","resolution":{"observed_at":"2026-08-07T15:10:40.325893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:39.741937Z","title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","venue":null,"work_id":"7485393a-b6bb-4a4d-84c6-9282cf08562f","year":2018},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:30.955504Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:6a05378a4e02c8cd0b637261c52f8722aa8348a247dc227b577b1b8e8a3fbd9e","observation_id":"acb68a6d-08bc-4dd5-a488-5ce5024bc279","resolution":{"observed_at":"2026-08-07T15:10:40.035391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:39.448860Z","title":"Ann- benchmarks: A benchmarking tool for approximate nearest neighbor al- gorithms","venue":null,"work_id":"4c1dbafe-c6ca-494b-b28c-a54e6b7a2df7","year":2020},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.045335Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:1477e315f356d713b80c2c3f2fb8fcc2af1cb97bd869e4cd347c14806b3e2685","observation_id":"0b0a42fe-d879-46a4-a2ba-82f1580657db","resolution":{"observed_at":"2026-08-07T15:10:39.582734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:39.227446Z","title":"The faiss library","venue":null,"work_id":"28b54e0e-0c5b-4f7b-87c2-54598761854d","year":2024},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.119134Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:61adacd955454aaf5c720ab37a020f2e9b075adc68d2076332b44e9167b85e30","observation_id":"00c9c7a2-615e-4f82-acdc-71dcbb732273","resolution":{"observed_at":"2026-08-07T15:10:39.323146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:38.993482Z","title":"Engineering efficient and effec- tive non-metric space library","venue":null,"work_id":"732dbd9e-9c8c-45ad-b72c-9a15616f7726","year":2013},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.200473Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:163b99c8b2c912d09632334109aabc049ed12544ae4cecde6b737466bc74a10b","observation_id":"b41a9da2-2ad7-49ca-91e9-64861693b475","resolution":{"observed_at":"2026-08-07T15:10:39.094301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:38.775769Z","title":"Understanding Hierarchical Navigable Small World Indexes, 2023","venue":null,"work_id":"f7763820-9bc8-4f83-9719-02dcd4c8c236","year":2023},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.232661Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:8ba1ca75cba2d87e3d1760bacf0cf97533acb478ce2bdd31f8948f62a9821ea9","observation_id":"a257cf42-5d10-4547-901e-5b58de42981f","resolution":{"observed_at":"2026-08-07T15:10:38.894053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:38.644065Z","title":"https://milvus.io/docs/hnsw.md, 2024","venue":null,"work_id":"db17e839-dfa7-46ac-83c8-bf4470df5aa9","year":2024},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.340946Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:2d3068e8a3b4b02c69358ee7325053299211d81cfa63f633585bffc75d3c5d0d","observation_id":"62364555-18bc-4ede-9b70-beed30ef443e","resolution":{"observed_at":"2026-08-07T15:10:38.712653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:38.460651Z","title":"https://zilliz.com/blog/ hnsw, 2022","venue":null,"work_id":"8edae4b4-67fe-4e48-a5a5-fe7bc3b49758","year":2022},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.424990Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:3fafc58534e9ad2d869c063dbb668a4b3aaf47da41da61494e9e047c2c08c9fc","observation_id":"a7557877-95b6-4047-a366-b5ee4884e8c2","resolution":{"observed_at":"2026-08-07T15:10:38.537714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:35.975481Z","title":"Vector Index","venue":null,"work_id":"d501481a-2d81-41db-b3ba-cc9da1445e19","year":2024},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.454688Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:bbce6699284691fe150b47419acee9339fb9b243dc0564470430bb5ffb9fe7fb","observation_id":"b90457bc-41ed-443a-ae8f-d305efd3ec00","resolution":{"observed_at":"2026-08-07T15:10:37.257179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:34.603376Z","title":"Approximate nearest neighbor search small world approach","venue":null,"work_id":"8c9925b7-c577-422b-86e9-538a6784162a","year":2011},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.515850Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:9a43411b1ca25eac765b9a3b43cd63f86aeec162084dabb18909d3a0f3f6103c","observation_id":"35498447-8e3f-412c-a6aa-32d3df41e125","resolution":{"observed_at":"2026-08-07T15:10:34.897707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:34.450161Z","title":"Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces","venue":null,"work_id":"29b162e5-c6a0-4e39-b443-ac2d4be28acf","year":2012},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.564957Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:bb782fa7b70da4c851a8669c24a7aab48b214425084a7123408bfafd47998832","observation_id":"b31fd162-7953-455c-971d-6915beaadcb8","resolution":{"observed_at":"2026-08-07T15:10:34.517711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:31.696877Z","title":"Approximate nearest neighbor algorithm based on navigable small world graphs","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.696877Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:dc02d2f21b37cf926f77025b7b331b61023fe4473612665a9cc1f8f44e05b611","observation_id":"918e0a9b-3ba3-4687-896c-82442585d6bc","resolution":{"observed_at":"2026-08-07T15:10:31.696877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:31.863345Z","title":"Graph-based nearest neighbor search: From practice to theory","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.863345Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:34c6a4b0432c1b7e862f3c2d4eec67e5b8f9e4205b1fb604f0a463a4511d949d","observation_id":"51fd2391-e7e1-4ddd-b1c1-0b5f110b7e17","resolution":{"observed_at":"2026-08-07T15:10:31.863345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01231","last_updated":"2025-02-17T07:29:18Z","snapshot_observed_at":"2026-08-11T19:43:40.411661Z","submitted_at":"2024-10-02T04:29:08Z","title":"Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2410.01231","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.01231","snapshot_observed_at":"2026-08-07T15:10:32.437780Z","title":"Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search","venue":"cs.DB","work_id":"ac4011e1-e4bb-46ab-b906-d225f58a8c14","year":2024},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:31.982210Z"},"links":{"cited_paper":"/paper/2410.01231","citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:024cf42476deb705675863512a7fd3bbf6cd0540a545e3224b1ca269c81bba45","observation_id":"e182a37f-af03-41ee-9996-2c1a84c54cfd","resolution":{"observed_at":"2026-08-07T15:10:32.593084Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:34.084257Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"234fd2aa-f0b4-4129-92a4-c83aa2b3b29f","year":2019},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.054593Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:ffa63ae44a5f8bdada32ddba728aea6e49dae18f951cc3dd4cb33ba6295d80f5","observation_id":"f4bbd58d-acae-466a-97a7-596cc567e5d1","resolution":{"observed_at":"2026-08-07T15:10:34.276492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:33.711914Z","title":"A com- prehensive survey and experimental comparison of graph-based approx- imate nearest neighbor search","venue":null,"work_id":"484e5a93-dc89-4bc1-893f-567c6ebc14fc","year":1964},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.086299Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:8d05b6ca04ea7383caaf975ccd5e50a523c9ac934a11ca5e09cbf337f6f996e1","observation_id":"c4df9a67-467d-4e9f-b117-dd4db1dd2016","resolution":{"observed_at":"2026-08-07T15:10:33.865481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:33.436806Z","title":"USearch by Unum Cloud","venue":null,"work_id":"3b1b5323-c5ff-48b1-82a0-5e1d6d32a531","year":2025},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.122101Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:49941326723f5942676237b79dca5888e6aacb3bd450515b9d6aa5af0b02cfd4","observation_id":"409351fd-d562-4b77-86fd-44c7a848a244","resolution":{"observed_at":"2026-08-07T15:10:33.602147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:33.161192Z","title":"hnswlib: Hierarchical navigable small world graphs library","venue":null,"work_id":"3320a0aa-82f5-4282-a841-a2b5540a38b5","year":2025},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.195986Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:eb347225205ac176fc5c9f9544b39f4d4614c1516e198e64c33954df320b61fb","observation_id":"77e08103-58b7-4e13-944a-4da7f595b0d6","resolution":{"observed_at":"2026-08-07T15:10:33.323727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:32.922130Z","title":"https://www.elastic.co/blog/ introducing-hnsw-graphs, 2023","venue":null,"work_id":"0612e231-6e68-4872-8352-4c31248b65a5","year":2023},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.313517Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:5b359626c7ec403f15169ea5e5b0dac1b98025458be1f7755596034111761073","observation_id":"37a2bd8a-271d-4d8e-bba6-e18f42197362","resolution":{"observed_at":"2026-08-07T15:10:33.050698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:10:32.706116Z","title":"On the merge of k-nn graph","venue":null,"work_id":"e7bc32a7-f196-41e7-a0a7-736889b582a1","year":2021},"citing_paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.357299Z"},"links":{"citing_paper":"/paper/2505.16064"},"observation_digest":"sha256:d78351dd993e3932e4555f2c3dcc953c76bb427e1be3b9d962fce21a0d995e6d","observation_id":"2891eec9-ab87-4da1-b3b2-af64205fd234","resolution":{"observed_at":"2026-08-07T15:10:32.792354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.16064","last_updated":"2025-05-21T22:33:27Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T15:05:30.081634Z","submitted_at":"2025-05-21T22:33:27Z","title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":33},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2505.16064."}