{"as_of":"2026-08-16T02:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:785e60ef9636282537f18c21abf753eb8c913a08f069fe6c8c13512c1d456d0e","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-14T15:37:36.654678Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/1908.00814/citation-record","integrity":"/paper/1908.00814/integrity","json":"/paper/1908.00814/citation-record.json","paper":"/paper/1908.00814"},"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-14T15:37:37.291419Z","title":"A global geometric framework for nonlinear dimensionality reduction,","venue":null,"work_id":"b080f842-8387-4612-b758-bcfa11927307","year":2000},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.459412Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:d15a667b7f21f840e14fad295e33564d62c1c8d58266d5dc40698743f852516c","observation_id":"510d8946-7e30-49ad-8315-c61533e9af8e","resolution":{"observed_at":"2026-08-14T15:37:37.295662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.278994Z","title":"Report nonlinear dimensionality re- duction by locally linear embedding,","venue":null,"work_id":"2b438f52-9647-4b0e-99f0-1cea7e079a5b","year":2000},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.464762Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:e73f025a4fb84ca1baa50fa300cb9abc9e53b38e09976f4a1a86e51a35bead70","observation_id":"f43ca80b-d49a-4688-b2b6-22c41fb24f79","resolution":{"observed_at":"2026-08-14T15:37:37.283252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.266457Z","title":"A survey on large- scale machine learning,","venue":null,"work_id":"0d24e61b-61d2-4d12-a6ef-f5e807360fdb","year":2020},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.470196Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:8b2c0e75a6584f088428f4952ffec5a7bb470a09a0cf86f5db89a4389e1dd890","observation_id":"ee8488ca-ed2b-4fa3-8c79-347874fd07cb","resolution":{"observed_at":"2026-08-14T15:37:37.270351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.253607Z","title":"Fast graph construction using auction algo- rithm,","venue":null,"work_id":"e18bc127-5962-40d4-a195-239f893da380","year":2012},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.475389Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:8744890ae9928debecfda2ce61188ff4479c50aea0dcc5a14adbbc9322248e76","observation_id":"098a2d41-8f7d-48e7-9073-0c3dec6f1352","resolution":{"observed_at":"2026-08-14T15:37:37.257967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.240579Z","title":"Efficient k-nearest neighbor graph construction for generic similarity measures,","venue":null,"work_id":"a3a76951-d2c9-4a87-8ee1-e9e7dbff8817","year":2011},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.480672Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:855567e79e80f0bc873acf3cc728dfe9c6c7f17df79fa99383a4de8310a41840","observation_id":"6cea0fce-60d9-4f10-a1af-57aa938bd7a3","resolution":{"observed_at":"2026-08-14T15:37:37.245293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.227449Z","title":"EFANNA : An extremely fast approximate nearest neighbor search algorithm based on knn graph,","venue":null,"work_id":"03752640-18ab-4547-bd40-002fadb35b25","year":null},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.485104Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:9a623a1602d3ccfc336496fa94b52a9df40940e36f6cd9068a7d1a4237619488","observation_id":"2cf9d88d-ad45-42dc-b61a-8b4c6b7d088e","resolution":{"observed_at":"2026-08-14T15:37:37.232286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.214164Z","title":"Fast approximate knn graph construction for high dimensional data via recursive lanczos bisec- tion,","venue":null,"work_id":"32b12b86-a834-4465-a750-df2df815cbb3","year":1989},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.490449Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:b0763651146dc2b8a4754c1362038eac0d68346ff714c2d88fe4cf69a88de7c3","observation_id":"68e390e5-b15f-4dc9-8cbc-29f2b5682015","resolution":{"observed_at":"2026-08-14T15:37:37.218852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.201232Z","title":"Scalable k-nn graph construction for visual descriptors,","venue":null,"work_id":"32982e58-5c40-4c0a-90b5-31dfe1e0cb16","year":2012},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.495073Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:5f8186948435c4761b23070f3be370b9f0066b1f38674fa4f3d649cbcdeb2b16","observation_id":"3cfcc367-7b4a-40da-a5cd-1f1ab4864f3b","resolution":{"observed_at":"2026-08-14T15:37:37.205872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.188771Z","title":"Fast knn graph construction with locality sensitive hashing,","venue":null,"work_id":"ff65ae3d-4521-433a-b82b-dbff114eecd6","year":2013},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.498983Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:3a7d0589aee96e2f2713579e3e0a96aa24e368d742ca904b21ecd1f6ab47df43","observation_id":"4b0730f3-60f5-4a0d-9649-c3ef7cbf8239","resolution":{"observed_at":"2026-08-14T15:37:37.193140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.174800Z","title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph,","venue":null,"work_id":"26bd7473-7691-48c1-8831-5e40c00a34f5","year":2011},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.503000Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:a5dacf3ef1f04cffbf37e4a10568c822b89a6c3957983fa68de7664a4de08dfc","observation_id":"6efcdb7e-9785-4629-ba01-345214fcac07","resolution":{"observed_at":"2026-08-14T15:37:37.180126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.162254Z","title":"Being prepared in a sparse world: the case of KNN graph construction,","venue":null,"work_id":"287b2143-6fea-44fc-84eb-9cb3d3c7142e","year":2016},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.506926Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:456cae108a6cf974c2f4373269b32921f1a20886050d3628f5c4c893c6a0d751","observation_id":"cf923946-ab1a-449a-a66a-4f5ec64e5b53","resolution":{"observed_at":"2026-08-14T15:37:37.166724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.149279Z","title":"Ap- proximate nearest neighbor algorithm based on navigable small world graphs,","venue":null,"work_id":"53190ac8-6200-4715-9040-24ee98c3bafb","year":2013},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.510752Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:53893f9fb2fb9fa0d302fdea0f48930098103d0c100010e9c333f94ba5225c27","observation_id":"a7c84887-2232-4c38-b5ae-7a80cc5828c4","resolution":{"observed_at":"2026-08-14T15:37:37.154071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.135150Z","title":"Efficient and robust approx- imate nearest neighbor search using hierarchical navigable small world graphs,","venue":null,"work_id":"5072038b-7ca3-4fbe-a39e-f29345488be3","year":2018},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.515063Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:eb5f5eb7dcac46217efde6e8c77057f87c5b914e981ba6640937bc4ec897e92f","observation_id":"d3e0bc94-46fd-43e8-b808-409ebb36da78","resolution":{"observed_at":"2026-08-14T15:37:37.139888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.122992Z","title":"Multidimensional binary search trees used for as- sociative searching,","venue":null,"work_id":"6ce40d43-4212-4aae-a078-4489c4d6e683","year":1975},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.519136Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:d65096f676d736ba02117f64d0d4861cf54599e2ae9a40ce2228bbc4cd79256b","observation_id":"ab3cc796-fad7-459a-9e13-2255e02096d6","resolution":{"observed_at":"2026-08-14T15:37:37.127011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.107685Z","title":"R-trees: A dynamic index structure for spatial searching,","venue":null,"work_id":"7f1ec05d-21ec-40fe-bda8-8cac4ef39ea2","year":1984},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.523409Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:914757acf462c8dd35871cc2becbb279aaeb6af4bf6469d9e46d1e3d78932389","observation_id":"ce32faae-dd2a-4c6e-9dfe-d7e3d90d4103","resolution":{"observed_at":"2026-08-14T15:37:37.114187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.093807Z","title":"The x-tree : An index structure for high-dimensional data,","venue":null,"work_id":"94e90b94-01e3-40a0-a096-ca178c71b25f","year":1996},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.527386Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:0150f4091b01b8f4cc968a324fdc778576eca192383acc77cb63f128225d1c19","observation_id":"91a6bca8-dd12-4958-bdc4-f2fd4ea9d4f6","resolution":{"observed_at":"2026-08-14T15:37:37.098705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.081256Z","title":"NV- tree: An efficient disk-based index for approximate search in very large high-dimensional collections,","venue":null,"work_id":"5c3375d5-db46-4b16-87d0-2f26caf9a1a4","year":2009},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.531354Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:8739aad6902bfb56c4c5658fce6d6d4c7826ed8829230cb7c81da6f0b4d4b599","observation_id":"e1d5155f-c86b-4fcd-9319-b94f1707bd54","resolution":{"observed_at":"2026-08-14T15:37:37.085746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.068732Z","title":"Trinary-projection trees for approximate nearest neighbor search,","venue":null,"work_id":"f0015949-401b-42c2-a6a2-bfdeca159cf0","year":2014},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.535359Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:5738d77fa3a7904517e6a10dc572fd41cf25c7ff9e4d0c752cb5793b7baa83a1","observation_id":"bf29ffc0-1378-48eb-a45e-ea67d4d4d8d3","resolution":{"observed_at":"2026-08-14T15:37:37.073014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.054912Z","title":"Scalable nearest neighbor algorithms for high dimensional data,","venue":null,"work_id":"1d31a723-a288-445b-9431-6af04aa6b739","year":2014},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.539335Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:6db6fa8e1304efb91c1fa6571aea034d417110e53d4634f6e020f3bfaf415a08","observation_id":"8c1ecf3a-621f-4686-9e9d-da556eed1dcd","resolution":{"observed_at":"2026-08-14T15:37:37.059031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.042837Z","title":"Optimised kd-trees for fast image descriptor matching,","venue":null,"work_id":"827344dd-be04-469f-8804-d7a27d45c5f2","year":2008},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.543686Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:0a85eda9ed9dacf7cf553b5e34525c54dd88c9fe02ba460a6670441d514b9a92","observation_id":"507006d6-951f-41dd-ac7b-75daa045f8a4","resolution":{"observed_at":"2026-08-14T15:37:37.047034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.029057Z","title":"Approximate nearest neighbor search by residual vector quantization,","venue":null,"work_id":"92cf77e5-cea5-4ad6-9a1d-40db3a36ffd6","year":2010},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.547659Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:9a18a7a4ed9e5180e2d9ae2067d4ced981d7cb0c545d37d60a8df96b76f53be8","observation_id":"ad141412-78f6-4b1a-9677-6a68aceb81e7","resolution":{"observed_at":"2026-08-14T15:37:37.033850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.015769Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":"f1d2bff2-e19e-4a8e-a3fe-2061a53f4887","year":2011},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.551587Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:727ee9d862af016b666a0fe17f3f57e4df2121d3188b740027c5d5299465241c","observation_id":"f182148f-8c5e-45a2-b49b-d9314bffdeea","resolution":{"observed_at":"2026-08-14T15:37:37.020226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:37.003612Z","title":"Efficient indexing of billion-scale datasets of deep descriptors,","venue":null,"work_id":"93176d3d-034b-4fc4-b471-b14a82dfa275","year":2016},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.555897Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:7a2c769f0aadd6bcb670784a7cc278f59a1285c89fdf0dc3229b493e64e15a2c","observation_id":"2121bb96-6e44-4544-b767-4745e422c05e","resolution":{"observed_at":"2026-08-14T15:37:37.007992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.990956Z","title":"Composite quantization for ap- proximate nearest neighbor search,","venue":null,"work_id":"23033e13-d184-4d6e-99b0-2cfa5f4dc8a1","year":2014},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.560282Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:fddbaa24788868f14157d940d16161165691e3ff8a1206f749b3d95f59390fa8","observation_id":"094597bf-583c-47f2-a11b-12cbebc6294e","resolution":{"observed_at":"2026-08-14T15:37:36.995673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.978446Z","title":"Locality- sensitive hashing scheme based on p-stable distributions,","venue":null,"work_id":"cf4ef605-d1c9-49c0-bdc4-587615c085ea","year":2004},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.564535Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:4138f27d89761dd9d5dcdd54cbc9b3b259d832e8db5feba156fe4a826fd5e398","observation_id":"7cd37fc5-e10c-4a1d-8868-7c7552fbedfd","resolution":{"observed_at":"2026-08-14T15:37:36.982676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.965356Z","title":"Multi-probe lsh: Efficient indexing for high-dimensional similarity search,","venue":null,"work_id":"4b6cf1de-c286-4c34-8f7f-b98c4d8b5214","year":2007},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.568615Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:72614915f659f38a8cd6becc86dbc9c50266ce6d7bebf886c1dc1f838d209704","observation_id":"e0b04bef-68ff-434b-8c63-8c0bc4a64786","resolution":{"observed_at":"2026-08-14T15:37:36.969776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.952778Z","title":"Supervised hashing with kernels,","venue":null,"work_id":"42abe25d-91a5-4cde-b521-8ca049fc7231","year":2012},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.572650Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:545350e497733dea718856e4f54173c365e68acf04d4c841bb535c56849ff179","observation_id":"e9b08152-cf6f-4c75-bd5f-71ae944fd59a","resolution":{"observed_at":"2026-08-14T15:37:36.956669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.940515Z","title":"Locality- sensitive hashing scheme based on p-stable distributions,","venue":null,"work_id":"a24edd45-fe7f-423b-a213-9354aee9f114","year":2004},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.576945Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:2680869372c6304700fb4634b6725395377f8d6c05ead1c9c9d0bc1d94dc0959","observation_id":"b2e371a7-9aa3-451e-acef-3168bd91e9b2","resolution":{"observed_at":"2026-08-14T15:37:36.944751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.927886Z","title":"A survey on learning to hash,","venue":null,"work_id":"1cd60327-c408-4785-8b0f-56176a39155c","year":2018},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.580604Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:ce3758bd999987c48f000a1d57ca51655297dff9bfb4fab9af55e6ad7139d76d","observation_id":"7e455ab8-989d-40a8-a7fc-967207aaee56","resolution":{"observed_at":"2026-08-14T15:37:36.932064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.914493Z","title":"Query-driven iterated neighborhood graph search for large scale indexing,","venue":null,"work_id":"1cccb889-6d18-4eee-b864-3daad2a6fa63","year":2012},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.584476Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:f5b10e2578dd6f198a93bbca336e402c2cc68bd4a3dfb58e4af0908c62d8fe28","observation_id":"544f9a4b-75b2-438f-9a69-e26324288e2d","resolution":{"observed_at":"2026-08-14T15:37:36.918995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.902203Z","title":"Ap- proximate nearest neighbor search on high dimensional data- experiments, analysis and improvement,","venue":null,"work_id":"0d4e3f51-a4ef-4995-8033-7f483470edad","year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.588391Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:8e0871c94307ab318c3b2da99b590f15de8623b9bc63ae36a7891d11cd78ef84","observation_id":"c992c9d1-3f4b-4be7-9ed8-5996f071296a","resolution":{"observed_at":"2026-08-14T15:37:36.906540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.03032","last_updated":"2020-09-17T06:08:09Z","snapshot_observed_at":"2026-08-14T19:27:52.578780Z","submitted_at":"2018-04-09T14:49:19Z","title":"Approximate k-NN Graph Construction: a Generic Online Approach","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.03032","snapshot_observed_at":"2026-08-14T15:37:36.592435Z","title":"k-NN graph construction: a generic online approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.592435Z"},"links":{"cited_paper":"/paper/1804.03032","citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:7bf2dc8f1921f18150c004a0ffd56a47da9fc3777b15081c5f9463bd8a65bb1d","observation_id":"4730bee3-ee79-43bd-a5f2-69f1a2ec0c49","resolution":{"observed_at":"2026-08-14T15:37:36.592435Z","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-14T15:37:36.889215Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph,","venue":null,"work_id":"740c1f9c-e073-410d-ae95-c8dcd080bfee","year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.596739Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:5006a5f6746bb61d11df5f0a6cf8aeb3556f80b2686202c95ad2a76cab233189","observation_id":"d8ad37b0-5ad3-43e6-bbd0-56cab3a9ad86","resolution":{"observed_at":"2026-08-14T15:37:36.893738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.876692Z","title":"Hierarchical clustering-based graphs for large scale approximate 15 nearest neighbor search,","venue":null,"work_id":"0f4a14d5-6202-4fc4-bb50-2b435ad9a360","year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.600754Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:3867c4b5776eebe03aacbf2313f3d8b3cb3eec0e2344a417795905defdc63553","observation_id":"e56856cf-5f90-4e6e-9429-ff4a93392a8f","resolution":{"observed_at":"2026-08-14T15:37:36.881098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.863097Z","title":"FANNG: Fast approximate near- est neighbour graphs,","venue":null,"work_id":"5532d745-cada-42e5-a78c-7dc296d10cf7","year":2016},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.604629Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:dddd99dd430ac65f8b36a4d51422169d99503c88fe73d33e4222e14da04b0a2d","observation_id":"dbd7b118-601f-4113-9ad5-9ad8ed065688","resolution":{"observed_at":"2026-08-14T15:37:36.867484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.849011Z","title":"Maximum likelihood estimation of intrinsic dimension,","venue":null,"work_id":"ad4e500e-03d6-485f-a84b-e6f350f9a527","year":2005},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.608937Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:d9ed2129f75f96721a38d393cf0fe98915644723a5386fa6054e62824b288e61","observation_id":"99cfcf38-4a03-48aa-9899-01eca48ba056","resolution":{"observed_at":"2026-08-14T15:37:36.853293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.835800Z","title":"Distinctive image features from scale-invariant key- points,","venue":null,"work_id":"2b584573-06fc-47aa-b770-beefed0ebd67","year":2004},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.612894Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:c6e8327fa5dfe3cc63b8bd03fa47af835a780b1e675517df165a693a8baf7a62","observation_id":"7b827475-903a-40cb-a303-390af454d7ac","resolution":{"observed_at":"2026-08-14T15:37:36.840213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.820225Z","title":"ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms,","venue":null,"work_id":"18c7d47b-d1c9-4b6e-9abe-ea8769a994da","year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.616946Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:875d83c6003ca35ef04d09d2e6e12aa761b7cc886d8d5244a7f9d3415b294aa9","observation_id":"3e5768ea-f62f-44d4-9cb6-71c3b01bfd00","resolution":{"observed_at":"2026-08-14T15:37:36.824396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.807096Z","title":"Video google: A text retrieval approach to object matching in videos,","venue":null,"work_id":"5004ccbd-9abe-4c97-b0aa-dc7572ed1b74","year":2003},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.621401Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:85f22113892dea99cbd6a13d48cb3d1827dceaaebbd03c849040d4883e8505ca","observation_id":"5c238d26-fd6f-4939-a44c-3cf293708ea1","resolution":{"observed_at":"2026-08-14T15:37:36.811477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.794152Z","title":"Evaluation of GIST descriptors for web-scale image search,","venue":null,"work_id":"5be63ce0-2bc7-4ef5-9fa1-e2df4484cd8a","year":2009},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.625281Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:4e2fdb85c2ca78477b7d5ba5f92a578ea04998ed551a052c027b22a96b915b2c","observation_id":"21ebcb3c-5956-4c59-b474-608cc0370496","resolution":{"observed_at":"2026-08-14T15:37:36.798693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.781023Z","title":"Glove: Global vectors for word representation,","venue":null,"work_id":"05ad0674-eb5f-4838-8e4c-280f3a112421","year":2014},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.629767Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:080af87cdd25211996278815499aaef62baa3c702315efdc5918b12164d1576a","observation_id":"e36fd424-918b-4694-8258-ec1eafad286b","resolution":{"observed_at":"2026-08-14T15:37:36.785387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.767241Z","title":"YFCC100M hybridnet fc6 deep features for content-based image retrieval,","venue":null,"work_id":"2008ae88-f262-4707-a4f1-5fd1e8f10018","year":2016},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.633676Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:845c41c02a1f6cf9744750f188c0ccbd6f66d7a7187c7473aef08c506b8264a2","observation_id":"770cd3f0-8fd6-4aef-8fb7-2bd771da1078","resolution":{"observed_at":"2026-08-14T15:37:36.772025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.754172Z","title":null,"venue":null,"work_id":"ee3239a1-4100-40d1-87d2-87b313b4e431","year":2018},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.637525Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:bc455466ed475e92dee134a51d9affd7fb9a8104384a73a5f133789f142acbb0","observation_id":"2bb89d54-aca2-4080-9999-0e619030f70c","resolution":{"observed_at":"2026-08-14T15:37:36.758482Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.739834Z","title":"SRS: solving c-approximate nearest neighbor queries in high dimensional eu- clidean space with a tiny,","venue":null,"work_id":"65b60fd2-0595-4c01-8522-6c24cd3f0815","year":2014},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.641802Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:4934855b90105860d5476868b10d5f581e1bee8e656f9c576d1118ac5fd700ae","observation_id":"399f8e90-1f2d-4e09-b951-8a1fa26dafb9","resolution":{"observed_at":"2026-08-14T15:37:36.745473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.726064Z","title":"Annoy: approximate nearest neighbors in C++/Python optimized for memory usage and loading/saving to disk,","venue":null,"work_id":"4e85e1a0-deac-42bc-b12b-f59fecbe4909","year":2016},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.646392Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:40cd2336feb378ca1a5f46f9363298b17ce3c3068bd4c2e120007c4d46b5cef9","observation_id":"11c27117-357f-4243-82bf-6a0e298ff196","resolution":{"observed_at":"2026-08-14T15:37:36.731304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:37:36.710885Z","title":"OpenMP: open multiprocessing","venue":null,"work_id":"c7791692-8a91-4f51-b642-e3e6dbcfb34b","year":null},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.650677Z"},"links":{"citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:68298479e9a25505d4a1b3081e9c05a667dda51f385280bf0980577ce003ef26","observation_id":"bf2f371b-1b91-4409-b85f-b4e6f8825eec","resolution":{"observed_at":"2026-08-14T15:37:36.716968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-14T16:52:14.974071Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-14T15:37:36.654678Z","title":"Graph based nearest neighbor search: Promises and failures,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.654678Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:d0a8b3037fbb4dcfdc1be1bbe53c702f21c4d0790f3d9a5edd5b06982f8bf5b0","observation_id":"e6bb3429-524b-4877-995f-f5451db44eb8","resolution":{"observed_at":"2026-08-14T15:37:36.654678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","latest_version":6,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":44},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:1908.00814."}