{"as_of":"2026-08-10T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:deb2adcc78e9d7210cea4a5249be2546b341bcedb41c6cc4625d3c2bb01ada9e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:52:58.987870Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T04:56:38.898020Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-08T18:52:58.987870Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05575","last_updated":"2025-09-05T08:09:51Z","snapshot_observed_at":"2026-08-10T06:58:55.502595Z","submitted_at":"2025-02-08T14:03:43Z","title":"Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T18:52:58.987870Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2502.05575"},"observation_digest":"sha256:de3cabfb3c37f21c7148356210bc688c7c648930747a1b09a37e6983d17371b2","observation_id":"ebff0a0e-b196-46eb-a472-9e68366c6daa","resolution":{"observed_at":"2026-08-08T18:52:58.987870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-07T15:23:37.997614Z","title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on kNN graph.arXiv:1609.07228, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.997614Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:6d4b152b5b6c819cc8f894051faa674dc35005302012298e3f8cf4117b529176","observation_id":"3fa0206c-90c3-4658-a5b2-23deb6296c74","resolution":{"observed_at":"2026-08-07T15:23:37.997614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-06T23:51:21.484962Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.15986","last_updated":"2025-06-19T03:07:12Z","snapshot_observed_at":"2026-08-09T22:48:01.655389Z","submitted_at":"2025-06-19T03:07:12Z","title":"Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:51:21.484962Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2506.15986"},"observation_digest":"sha256:79c0b4cd45b8fe14bac5b03b8cc10a4ab256ca0f1b50921a22a7e0b3b32ad984","observation_id":"565fff02-8932-44b7-bd5d-fa4e17b6313a","resolution":{"observed_at":"2026-08-06T23:51:21.484962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-06T21:11:18.308334Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.01079","last_updated":"2025-07-01T15:12:14Z","snapshot_observed_at":"2026-08-10T01:01:27.245436Z","submitted_at":"2025-07-01T15:12:14Z","title":"MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:11:18.308334Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2507.01079"},"observation_digest":"sha256:22d6e4962fce1ca1b8564db7a9fa8d05822914d80cbe9553878b3d38335f15be","observation_id":"6644880e-a188-4b4a-9360-0d8bab5114fe","resolution":{"observed_at":"2026-08-06T21:11:18.308334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-06T15:01:17.103229Z","title":"Efanna : An extremely fast approximate nearest neighbor search algorithm based on knn graph.arXiv:1609.07228, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.17094","last_updated":"2025-07-23T00:19:27Z","snapshot_observed_at":"2026-08-08T11:06:13.689212Z","submitted_at":"2025-07-23T00:19:27Z","title":"PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.103229Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:9fae61c2ad5aa327f76a5304a80d62fa5e7ca24214c4d54fb9a5ba6d34436be7","observation_id":"07a182e9-55ed-470a-9caa-e50125bf0d2b","resolution":{"observed_at":"2026-08-06T15:01:17.103229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-05T05:11:48.198060Z","title":"and Cai, D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.198060Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:3f3f8441e97c4e89cd92ff04dd74ae2ecb731c36c235c5d2e25fc9ca4c077ab8","observation_id":"975c73cd-094c-4ffb-aba9-4b5dc07218b5","resolution":{"observed_at":"2026-08-05T05:11:48.198060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":"1609.07228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-07-02T04:56:38.898020Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","venue":"cs.CV","work_id":"5f8cdbcc-ba17-428e-a498-6e39546e8d62","year":2016},"citing_paper":{"arxiv_id":"2602.23342","last_updated":"2026-05-14T05:09:37Z","snapshot_observed_at":"2026-08-08T11:17:45.876126Z","submitted_at":"2026-02-26T18:48:29Z","title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.239255Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2602.23342"},"observation_digest":"sha256:e695b2cd585bf93f3ee74f04b1c717932af2c5964a6ce51ff5ca5bd83bbef6b8","observation_id":"938c4c2d-4745-43d0-a0cb-e88c7aea7ea7","resolution":{"observed_at":"2026-05-15T18:46:29.430974Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":"1609.07228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-07-02T04:56:38.898020Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","venue":"cs.CV","work_id":"5f8cdbcc-ba17-428e-a498-6e39546e8d62","year":2016},"citing_paper":{"arxiv_id":"2604.22171","last_updated":"2026-04-24T02:48:20Z","snapshot_observed_at":"2026-07-06T23:08:37.811548Z","submitted_at":"2026-04-24T02:48:20Z","title":"MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T09:24:12.922167Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2604.22171"},"observation_digest":"sha256:a482106c13ae637ab8dd3ea4ca3bc109629d7f6351b65dd0dc7ab0c077a1eda0","observation_id":"7238e014-9941-49ee-b592-72d6b1a34726","resolution":{"observed_at":"2026-05-11T20:21:11.215613Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":"1609.07228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-07-02T04:56:38.898020Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","venue":"cs.CV","work_id":"5f8cdbcc-ba17-428e-a498-6e39546e8d62","year":2016},"citing_paper":{"arxiv_id":"2605.10135","last_updated":"2026-05-11T07:46:07Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T07:46:07Z","title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-12T04:53:42.872514Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2605.10135"},"observation_digest":"sha256:03ff72fc2acfe89dcb0077c5bd4c4a43d82408c144ea6b04bcbb45bf001b9c73","observation_id":"552a2fc0-fe8f-4d04-846e-f656f9009bf0","resolution":{"observed_at":"2026-05-12T05:51:24.662351Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":"1609.07228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-07-02T04:56:38.898020Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","venue":"cs.CV","work_id":"5f8cdbcc-ba17-428e-a498-6e39546e8d62","year":2016},"citing_paper":{"arxiv_id":"2606.02992","last_updated":"2026-06-02T00:59:39Z","snapshot_observed_at":"2026-08-06T19:36:50.731451Z","submitted_at":"2026-06-02T00:59:39Z","title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T08:44:13.310548Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2606.02992"},"observation_digest":"sha256:9620414a606226b3aba08ce1eaae12ccb2de7430a39c26e4e2d7bd3c34d00336","observation_id":"b1b4db57-475b-4cdf-b99a-b93d65a76036","resolution":{"observed_at":"2026-07-02T04:56:38.899612Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-07-12T12:20:47.711381Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.02543","last_updated":"2026-06-24T00:28:10Z","snapshot_observed_at":"2026-08-05T01:36:34.703262Z","submitted_at":"2026-06-24T00:28:10Z","title":"ETALE: Evolving Topology with Accelerated Lock-free Execution for Dynamic Graph ANN Search on GPUs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T12:20:47.711381Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2607.02543"},"observation_digest":"sha256:2c6c9a95e0a0ce2b3a7a82d538126a37f5d68b38c1cb8a8855edcffe9680d2b6","observation_id":"321b4910-11f6-4085-a438-fafc4ae3def3","resolution":{"observed_at":"2026-07-12T12:20:47.711381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-02T01:57:40.418386Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.14564","last_updated":"2026-07-16T04:44:16Z","snapshot_observed_at":"2026-08-10T11:02:48.843000Z","submitted_at":"2026-07-16T04:44:16Z","title":"Almost Navigable Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T01:57:40.418386Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2607.14564"},"observation_digest":"sha256:68247dff72d283ffaf8f021691e1f046d9d50a76ddab31e72893a29f03038605","observation_id":"4f0411e8-f5db-47da-88c9-8004d3ed203c","resolution":{"observed_at":"2026-08-02T01:57:40.418386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-01T04:31:20.302127Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.302127Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:1146f420f3b757c37d9d367c91ce9475f01909e1ce1d078c167f0a90d414d94c","observation_id":"d8fbcbc5-37d9-44ad-ad98-21076f860d41","resolution":{"observed_at":"2026-08-01T04:31:20.302127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1609.07228/citation-record","integrity":"/paper/1609.07228/integrity","json":"/paper/1609.07228/citation-record.json","paper":"/paper/1609.07228"},"outbound":[],"paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:1609.07228."}