{"as_of":"2026-08-10T00:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96cc893bc7f5be68c7c46986782bb1c1a33876b00b482b41d0ca17df7fbf77fa","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:57:08.398402Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T02:38:26.167721Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T03:10:53.317405Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2505.17368","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17368","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ed3f7cbb-22f6-4799-849b-267308952310","year":2025},"citing_paper":{"arxiv_id":"2605.07770","last_updated":"2026-05-08T14:11:49Z","snapshot_observed_at":"2026-08-08T02:10:34.428275Z","submitted_at":"2026-05-08T14:11:49Z","title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-11T02:38:26.167721Z"},"links":{"cited_paper":"/paper/2505.17368","citing_paper":"/paper/2605.07770"},"observation_digest":"sha256:2072963f5bfd8b8fe7cc62b7d5997d3226ea183895f760ea267a2fe3d1e6e19b","observation_id":"f7b102fe-be3d-4561-b109-5ded4528f206","resolution":{"observed_at":"2026-05-11T03:10:53.318699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.17368/citation-record","integrity":"/paper/2505.17368/integrity","json":"/paper/2505.17368/citation-record.json","paper":"/paper/2505.17368"},"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-07T14:57:15.027359Z","title":"Ann-benchmarks: A bench- marking tool for approximate nearest neighbor algorithms","venue":null,"work_id":"7d9897c0-2f9e-419b-906e-53b8cfd363b0","year":2020},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:03.879735Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:a34927d39b59478e7b379b7abfacf57388cc9788985d26d8f1811f5074f00335","observation_id":"d5d89a0d-2066-442e-9881-29565fedc7db","resolution":{"observed_at":"2026-08-07T14:57:15.073252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:14.923178Z","title":"Multidimensional binary search trees used for associative searching","venue":null,"work_id":"e32b75ec-8a57-4bbe-aa6b-0993307e1921","year":1975},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:03.961471Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:bf89d729461162f25b59332f6099cc5bb49773e6757c6207361ef93d1f5d6ebc","observation_id":"23e46d2c-ef2a-41e2-825f-12062fca3915","resolution":{"observed_at":"2026-08-07T14:57:14.959739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:14.816376Z","title":"Cover trees for nearest neighbor","venue":null,"work_id":"c360b23d-a14e-4ffa-bc4e-7d53ffc87588","year":2006},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.072189Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:4d5ccde1668711e712564660e6ebf1f723febe4461a212b5182d7d56c4d2ad4a","observation_id":"6c099349-455f-4d6c-90f5-a7a593df1ab6","resolution":{"observed_at":"2026-08-07T14:57:14.860769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:04.222806Z","title":"The Discrepancy Method: Randomness and Complexity","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.222806Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:3e32fff2ee4113d78a2936cf788a1e7e105fd9dc4be936b0ebf9e5618d966550","observation_id":"388052d1-0c3e-4b6d-8f3a-a0b0ec855c65","resolution":{"observed_at":"2026-08-07T14:57:04.222806Z","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-07T14:57:14.734694Z","title":"Locality-sensitive hashing scheme based on p-stable distributions","venue":null,"work_id":"e0d5e327-6b2f-45e1-92cf-23b2d8389807","year":2004},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.393533Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:8c2b04cf437d3b73faf013d33f315dbd7362174daa5f2f528755a616f99ab680","observation_id":"9e12aecc-b4ce-47a3-ab47-d0cfe3b1cb29","resolution":{"observed_at":"2026-08-07T14:57:14.776350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:14.632913Z","title":"Computational Geometry: Algorithms and Applications","venue":null,"work_id":"c6832404-1573-4350-a037-722b34398f49","year":2008},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.522506Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:63b693e584a5beba26f3d704bbee0f1c17fdde11b8282cc6b3c092ae2decc0cd","observation_id":"3ef1578d-35d8-4042-8070-4fb050fd5de5","resolution":{"observed_at":"2026-08-07T14:57:14.689987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:04.642330Z","title":"A survey on rag meeting llms: Towards retrieval-augmented large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.642330Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:73459f32225588c6d5c0bb1345ea2d489eab4def8ca6dd76eaa5e3daa2392649","observation_id":"defc02b4-a66f-4d41-a914-6af5478a6e14","resolution":{"observed_at":"2026-08-07T14:57:04.642330Z","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-07T14:57:14.507221Z","title":"Optimized product quantization","venue":null,"work_id":"38199d44-8d18-4b44-ac76-2bd45ab11893","year":2013},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.740647Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:88227a7bf92db97bd5005502fa05634460acfb99e2f5b31bfaccc13ae46c0098","observation_id":"978e2acc-48b3-4dd9-ae1f-8265e9056cb2","resolution":{"observed_at":"2026-08-07T14:57:14.571775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:14.367855Z","title":"Fast incremental maintenance of approximate histograms","venue":null,"work_id":"ba8211bb-794d-4fbe-96d0-21b766e3013c","year":2002},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:04.890481Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:477587df8aeedd0dfcf9e7231a907e187ea97b56a82b9a1204d53ed33da12608","observation_id":"cdc36206-8f74-4cdd-81c4-a2ad9aa53f63","resolution":{"observed_at":"2026-08-07T14:57:14.422676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:05.052142Z","title":"A comprehensive survey on vector database: Storage and retrieval technique, challenge","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.052142Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:0d0eb0be5a8994ce278f40b9dfd5c88cbf747f961af0e36093643977ef5c8772","observation_id":"847a11f5-7685-4ae1-90c5-828d734be0b7","resolution":{"observed_at":"2026-08-07T14:57:05.052142Z","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-07T14:57:14.218035Z","title":"Geometric Approximation Algorithms, volume 173 of Mathematical Surveys and Monographs","venue":null,"work_id":"5f213b64-8ea1-4f6c-afe7-99cb37d1e0e2","year":2011},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.178806Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:28bf492eae6a5e05a962dd5477bdbc3207b56f99d69153d11b2e2b26ba2ca053","observation_id":"b8c109ff-7393-427c-abec-1f409d279747","resolution":{"observed_at":"2026-08-07T14:57:14.284513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:05.318859Z","title":"Approximate nearest neighbor: Towards removing the curse of dimensionality","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.318859Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:b1b589a537a70d2925674da0c5986377dc913b2d5607cf2a10c615659218f8a9","observation_id":"2b9182e7-95c6-42a5-8a19-3e1e4bea200a","resolution":{"observed_at":"2026-08-07T14:57:05.318859Z","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-07T14:57:14.036104Z","title":"Epsilon-nets and simplex range queries","venue":null,"work_id":"8ea2fb79-0b52-42ba-9378-2340eb51279d","year":1986},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.456839Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:288bd5354eedeb58bcb7c881dd417b167fed40abb979d22116838ede43cf1f02","observation_id":"c2ea447d-a808-42b7-aad8-edc0a4b3ab5a","resolution":{"observed_at":"2026-08-07T14:57:14.142528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:13.875603Z","title":"Uniform manifold approximation and projection","venue":null,"work_id":"cc0bbb99-cde1-4ec2-89ba-147b0c0faca2","year":2024},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.597045Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:02b7aea06971d6292ad6f06f3c854f63d187376674ff0dc205674a2fd6a98fde","observation_id":"2aea05e4-79e5-4260-a7d3-4bcc59e12d60","resolution":{"observed_at":"2026-08-07T14:57:13.948082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:05.738931Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.738931Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:bfefba0504a07842451b6684f365f0c11372c3d5d5366fa2440362dde0d27ee9","observation_id":"540f2c43-f375-4267-8f3c-563c98a2be6a","resolution":{"observed_at":"2026-08-07T14:57:05.738931Z","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-07T14:57:13.733476Z","title":"Worst-case performance of popular approximate nearest neigh- bor search implementations: Guarantees and limitations","venue":null,"work_id":"c9734fae-4913-4802-bb0d-7824631e0480","year":2023},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:05.851763Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:e512b4c737c33ad2ceb90c01d86c6b057a7277dc700c8cf7876c229af0faa449","observation_id":"99496455-4a04-4bfa-b11a-16ae37a30856","resolution":{"observed_at":"2026-08-07T14:57:13.788334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:06.003983Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.003983Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:3eee9f1caf2438828e77ab328e4b763e322e6a40cd4259a28e3200dadb05947b","observation_id":"fe79c4c7-fc75-4b0d-b9dc-9b5111bb019a","resolution":{"observed_at":"2026-08-07T14:57:06.003983Z","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-07T14:57:13.592995Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":"795697a1-eff1-45a6-8570-a516c0b02f3f","year":2010},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.136003Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:218e39c5025749f77fe0f236f0df9d6fbfaaa08e653bcfa215c5358035cd2bba","observation_id":"b54cee6a-88c7-4848-9fc6-9087c96e4312","resolution":{"observed_at":"2026-08-07T14:57:13.648527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:13.468970Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":"2e26e8f6-1c7c-4c94-9e83-19cbcea3138b","year":2011},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.260510Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:a63cbbe96c43781da3e5df6ca2fed8ebed9361a542a23ca54f5bc1ecb37fb46e","observation_id":"b74ec89c-633a-4d68-9c90-0bc7aee980f2","resolution":{"observed_at":"2026-08-07T14:57:13.526160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01763","last_updated":"2025-06-23T04:05:15Z","snapshot_observed_at":"2026-07-06T17:24:33.169277Z","submitted_at":"2024-01-30T23:35:28Z","title":"When Large Language Models Meet Vector Databases: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01763","snapshot_observed_at":"2026-08-07T14:57:06.369833Z","title":"When large language models meet vector databases: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.369833Z"},"links":{"cited_paper":"/paper/2402.01763","citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:f92a46eba1ad2bed26e3d9d89552ca6f38e76ee99f42f5b418fbdcca64d69da6","observation_id":"7dfd1c87-bd5b-42c1-9ef9-1f03c45640f8","resolution":{"observed_at":"2026-08-07T14:57:06.369833Z","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-07T14:57:13.308050Z","title":"Extensions of lipschitz mappings into a hilbert space","venue":null,"work_id":"5776beb6-9e23-44d4-8aa4-0275fca5601f","year":1984},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.495416Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:1ca61201c82c4aa923656282b2e87409a55bd5c60be160b365aa378367d1d170","observation_id":"d87dbf2a-9ed1-4731-b298-d2c48ca1fe27","resolution":{"observed_at":"2026-08-07T14:57:13.380669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:13.075258Z","title":"Navigating nets: Simple algorithms for proximity search","venue":null,"work_id":"93dea794-e962-439b-84ed-26dba3a100c5","year":2004},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.589431Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:8971724b9b92c00c5a23b90c2a515f77427fbb58deb57dfc8958ab3bc4d63627","observation_id":"28dd7260-a276-459e-9e7b-84f22c7afd16","resolution":{"observed_at":"2026-08-07T14:57:13.191065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:12.913253Z","title":"Correlations in topological models of 2d random cellular structures","venue":null,"work_id":"76699bfc-343a-4c7b-ac5e-4432ac307de4","year":1993},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.661492Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:2a8a70f4d81cd47915d98ef1837ee591f67002a62cc8acc783eac6ea48168bbb","observation_id":"0827228a-dc3b-4c70-be9c-4a1a438aae55","resolution":{"observed_at":"2026-08-07T14:57:12.988122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:06.717873Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.717873Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:e83bd35601f0b660c2b3de554774737a34dbd0f5313828499078dc60b018214c","observation_id":"fc480c38-f4b4-443e-9b05-5021355cd0cf","resolution":{"observed_at":"2026-08-07T14:57:06.717873Z","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-07T14:57:06.786035Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.786035Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:57ed63289167f67e986650fc86d426d0165fc913fe2b351e9732647b8aed8ac3","observation_id":"8283ac0a-fd9e-402c-98f8-db83bee5cec8","resolution":{"observed_at":"2026-08-07T14:57:06.786035Z","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-07T14:57:12.749021Z","title":"Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement","venue":null,"work_id":"969bee56-c066-425c-a9c2-48e2c44e660c","year":2019},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.841539Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:539a8bc5c2485900cdf41dc593293bf2ad8457bb06455286136eb7b544d9569a","observation_id":"5ca5afe2-4ec0-4820-9b54-28f8e838636b","resolution":{"observed_at":"2026-08-07T14:57:12.827939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02234","last_updated":"2021-12-04T04:07:27Z","snapshot_observed_at":"2026-08-06T18:03:12.858842Z","submitted_at":"2021-12-04T04:07:27Z","title":"Revisiting $k$-Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses","version":1},"cited_work":{"arxiv_id":"2112.02234","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.02234","snapshot_observed_at":"2026-08-07T14:57:08.576008Z","title":"Revisiting $k$-Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses","venue":"cs.DS","work_id":"c24af067-9db2-46e3-a5ce-a5adb5a81745","year":2021},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.895653Z"},"links":{"cited_paper":"/paper/2112.02234","citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:c0c36ffa9f2ac2c4fdfa5afeb5be30f7ed9085b953ed54171e9211fb80672f52","observation_id":"932cc5b2-9d66-4331-ad67-396f650b726d","resolution":{"observed_at":"2026-08-07T14:57:08.637615Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:12.570949Z","title":"Hvs: hierarchical graph struc- ture based on voronoi diagrams for solving approximate nearest neighbor search","venue":null,"work_id":"ad5a403a-de19-4cd1-a2dc-e374df7069ff","year":2021},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:06.946581Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:70f7536da7786ec8ef044a4dadd93685064899f9889c9ff86646e40ac5a371df","observation_id":"4a4af237-4393-49f5-bf60-d0191872620c","resolution":{"observed_at":"2026-08-07T14:57:12.656254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:07.015825Z","title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.015825Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:c84578d41c7bc0f0a5a975659035ce92d1b2ae3fd6dc1842cfffd881d5677550","observation_id":"a38be660-8a4c-4b2e-9747-fe704777c561","resolution":{"observed_at":"2026-08-07T14:57:07.015825Z","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-07T14:57:07.066759Z","title":"Approximate nearest neighbor algorithm based on navigable small world graphs","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.066759Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:616be9de10deca53977560aba9eed7685897494b09563a4e227385402da20e55","observation_id":"b168be33-2982-4605-8e0a-90ed356c0245","resolution":{"observed_at":"2026-08-07T14:57:07.066759Z","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-07T14:57:12.309913Z","title":"Hierar- chical clustering-based graphs for large scale approximate nearest neighbor search","venue":null,"work_id":"10b1cf66-c734-4f6f-abb3-bf50891f4c40","year":2019},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.149507Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:3aa512fbf3b407be25cd64ef6846e828982261b485f913cf422b21c5b3791145","observation_id":"52ad0f9b-6aee-4f5b-9aa8-92d66aae435c","resolution":{"observed_at":"2026-08-07T14:57:12.445182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:12.135358Z","title":"Five balltree construction algorithms","venue":null,"work_id":"72d30c1c-45ca-4c37-85e9-3721d3727222","year":1989},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.234920Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:40662166748b1559c975b623ba2f8a3d877b98eb51e966b0d1de46600aefaab1","observation_id":"f284fafa-a4dc-4078-adff-bcf9ce04b05e","resolution":{"observed_at":"2026-08-07T14:57:12.235899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:11.949485Z","title":"Competitive quantization for ap- proximate nearest neighbor search","venue":null,"work_id":"51743672-8a55-470c-948d-c777ffea300c","year":2016},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.283806Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:fa5b119f8d593b6787095c413fa4b5009d7b046c74575807d2c387b15d17695b","observation_id":"0860be68-77dd-4762-bf1c-e05080b5c660","resolution":{"observed_at":"2026-08-07T14:57:12.049247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:11.714368Z","title":"Survey of vector database management systems","venue":null,"work_id":"54039e41-f7fc-4f11-8463-39f76f81636f","year":2024},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.343661Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:a1a8edc65afc4d787059c449a1b5eccce28626f82e39a05aaec97b6bb7e0be54","observation_id":"8dae8c29-836b-4230-ae43-819661f3aefc","resolution":{"observed_at":"2026-08-07T14:57:11.836114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:11.461395Z","title":"Glove: Global vectors for word representation","venue":null,"work_id":"8dfacf13-2d8a-42ef-88b2-f9dfa15896f8","year":2014},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.426581Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:7e0a80b174062fd3089a35ad6bd1115cd2b11a078058b572989fb5d36dc090a3","observation_id":"5f8b8e4d-732c-4b9f-b6cb-73edcbc7eac2","resolution":{"observed_at":"2026-08-07T14:57:11.590497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:11.224994Z","title":"Falconn++: A locality-sensitive filtering approach for approximate nearest neighbor search","venue":null,"work_id":"d102e789-ac5e-4288-89cc-523ff3d71a5c","year":2022},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.477524Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:2c7be281055f18179075a361c7d1973ad3854d071ec8394f76c156e447a578e6","observation_id":"69c1b0f1-7893-4178-b4e0-c6e368c15d56","resolution":{"observed_at":"2026-08-07T14:57:11.335824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:10.988215Z","title":"Graph-based nearest neighbor search: From practice to theory","venue":null,"work_id":"ff96eeb7-89f4-4e51-bc59-6bc245114716","year":2020},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.570294Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:640df1f71761963b37f7c6ded5ecba10d62e423c1d56ff2763ab2a703d26bd06","observation_id":"e71a6130-15c8-4ee9-a756-2ec09671b604","resolution":{"observed_at":"2026-08-07T14:57:11.086035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:07.644210Z","title":"Visualizing data using t-sne","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.644210Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:d03cfaa0ccc657133cf6097776b1f39e4705d5a06fa2b8fec6724ff76228fdae","observation_id":"7a58da83-b42f-4c13-a679-ccec552cc607","resolution":{"observed_at":"2026-08-07T14:57:07.644210Z","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-07T14:57:10.670004Z","title":"Random sampling with a reservoir","venue":null,"work_id":"e2397940-2a24-49d2-b339-9b1ba346a93c","year":1985},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.712546Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:e016d533048663091af8c3ab9e30b17aec6d29a520630a5aa322730d2867ba78","observation_id":"8a07ebf4-5e40-48c2-a9e5-848018afd3dc","resolution":{"observed_at":"2026-08-07T14:57:10.828393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-07-06T10:36:50.762036Z","submitted_at":"2021-01-29T15:12:35Z","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-08-07T14:57:07.783210Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.783210Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:96fb3f3dd7a6cd28030e696d21e974f9993c8b103fc249d20cadcf3ad4b5c418","observation_id":"f02727ec-0c7a-4397-9b63-efe57681eff5","resolution":{"observed_at":"2026-08-07T14:57:07.783210Z","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-07T14:57:10.366726Z","title":null,"venue":null,"work_id":"28019f02-0186-4b11-84f0-75c8905cb812","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.853368Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:ac7d5f84fa6309fad1dbf8c52655225e56cd46a22ba3f5176cbf260373f7a936","observation_id":"0735ce8c-7738-469f-afce-c598fb96f5c7","resolution":{"observed_at":"2026-08-07T14:57:10.542327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:10.131684Z","title":null,"venue":null,"work_id":"ba3ac103-e202-4313-8331-a46665ed6219","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.921604Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:6da1a7b7f0ad53a2713723f0a031c0b31d039101d6ca9936a0fdb2801b88bc91","observation_id":"319f20c8-ae95-4857-84d1-15ac438c0f31","resolution":{"observed_at":"2026-08-07T14:57:10.244937Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:09.836738Z","title":null,"venue":null,"work_id":"f3e12782-077f-4a03-978a-b06b939c63ee","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.998498Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:6f08970dbdbf303cab828be911df9197cb9aba7be7c4648901fa2cde615ca48c","observation_id":"b14b54c4-771e-443a-9422-1b49fa452575","resolution":{"observed_at":"2026-08-07T14:57:09.957289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:09.584044Z","title":null,"venue":null,"work_id":"0d0349eb-116f-441f-8a3f-09a682099c51","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:08.091520Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:9116af7a6293b987ab69651c0388aeb1438681466bb46f3bbbaf6822713ef121","observation_id":"74b20e6f-e635-454f-a6da-24debce8a3eb","resolution":{"observed_at":"2026-08-07T14:57:09.706227Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:09.293796Z","title":null,"venue":null,"work_id":"39c79f54-49fe-41bb-ae71-e4a24644118f","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:08.133395Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:e68e569cf8c3e6801259f49a5568f0531b9824164d1255b730a3964068540bae","observation_id":"c6f5cc8e-6ba3-42a1-8839-6504ec6e509d","resolution":{"observed_at":"2026-08-07T14:57:09.414162Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:09.026731Z","title":null,"venue":null,"work_id":"c2fb2151-da78-4c05-a902-7f811897c66e","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:08.297835Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:c80c191025296a2112e67d006a3689d79d9ff8cb065e884d87615a3bb3768b78","observation_id":"3feaa22e-f0b3-4d25-ad18-6f2862b279c0","resolution":{"observed_at":"2026-08-07T14:57:09.167420Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:57:08.833592Z","title":"G A Related Work In this section, we review the literature most relevant to our work","venue":null,"work_id":"1936ad4a-5bd9-48b8-8f97-1feaab8462fb","year":null},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:08.398402Z"},"links":{"citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:4a44214f6c2543dc73a39e477177fdc573b95f0f5cd64fc352f747601db66c30","observation_id":"cc763b36-9351-4ed0-9048-3032900d5b63","resolution":{"observed_at":"2026-08-07T14:57:08.910171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":47},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2505.17368."}