{"as_of":"2026-08-08T22:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3bd48691a2e989115ac9d50c4e60957eb8be527c424379875868bed3bba0a7f8","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":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:24:56.978018Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":25,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-12T01:47:19.947054Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2401.08281"},"observation_digest":"sha256:153df3d53a2dae496c58aff854e337257204668c5db949d3020f9ee37f351d20","observation_id":"092bfd67-497d-4637-a3ea-f0b4f0baba1c","resolution":{"observed_at":"2026-05-12T01:47:20.094993Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2504.20018","last_updated":"2026-05-03T16:16:02Z","snapshot_observed_at":"2026-08-02T21:31:44.700892Z","submitted_at":"2025-04-28T17:36:06Z","title":"MINT: Multi-Vector Search Index Tuning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T17:46:53.722294Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2504.20018"},"observation_digest":"sha256:62c68485bf698bfb3eaba3ed89b821e7bb73048cdf8ad9a25e980d2c32383932","observation_id":"ec27fb43-d664-4de0-8c1f-fd087207fea1","resolution":{"observed_at":"2026-05-22T17:51:55.210560Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2505.17152","last_updated":"2026-05-16T05:33:49Z","snapshot_observed_at":"2026-08-02T21:40:51.187437Z","submitted_at":"2025-05-22T11:11:02Z","title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T02:34:44.721256Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2505.17152"},"observation_digest":"sha256:c721077eee77928b3e31d878345f7439cf47e3b1125e31c7de7a8069155dca2a","observation_id":"2be84879-9549-43c5-977a-5c9e1245b00b","resolution":{"observed_at":"2026-05-22T02:35:56.365935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-07T14:24:56.978018Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-08T20:25:15.394543Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.978018Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:22e885e220e2bd4f7e55fd30d4acc0004f5ad3b77a0648b032148c7dc907c173","observation_id":"95c2aede-d328-4d61-81e3-cbfc88860575","resolution":{"observed_at":"2026-08-07T14:24:56.978018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-06T17:05:28.111737Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.11907","last_updated":"2025-07-20T04:50:39Z","snapshot_observed_at":"2026-08-06T16:56:19.340216Z","submitted_at":"2025-07-16T04:46:28Z","title":"SIEVE: Effective Filtered Vector Search with Collection of Indexes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:05:28.111737Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2507.11907"},"observation_digest":"sha256:f025b4e4d963ba58f7235852f32d6ec765e580d1e60f0d2a281a5972c96a754b","observation_id":"7e1c185e-8ea9-430e-a666-02b84cc549e2","resolution":{"observed_at":"2026-08-06T17:05:28.111737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T23:31:56.792942Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05369","last_updated":"2025-08-07T13:15:49Z","snapshot_observed_at":"2026-08-05T23:31:55.784666Z","submitted_at":"2025-08-07T13:15:49Z","title":"Cross-View Localization via Redundant Sliced Observations and A-Contrario Validation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T23:31:56.792942Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2508.05369"},"observation_digest":"sha256:6d3d7e846d73de5ae0a1454a115ce8b879230ca96ff1cb847658f37dcf3001a3","observation_id":"bd8ed242-a9c6-4613-be1f-868b64611da2","resolution":{"observed_at":"2026-08-05T23:31:56.792942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-04T21:44:43.793939Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.793939Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:cdf367c30a0d8f1c65590ae9a26563758c9b311e7826cd686276919ff31ad140","observation_id":"91c23970-f6a2-44a2-98fe-3eb765010e86","resolution":{"observed_at":"2026-08-04T21:44:43.793939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-03T13:51:32.020328Z","title":"Fast approximate near- est neighbor search with the navigating spreading-out graph.arXiv preprint arXiv:1707.00143, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.22838","last_updated":"2026-07-07T09:01:40Z","snapshot_observed_at":"2026-08-03T13:51:30.167172Z","submitted_at":"2025-12-28T08:42:38Z","title":"OrchANN: Hierarchical Orchestration for Skewed Out-of-Core Vector Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T13:51:32.020328Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2512.22838"},"observation_digest":"sha256:a5b90641d486e76927899d64d90e712c31c28fffe3be81577c49c5eac72bf0d5","observation_id":"675626a3-707e-465b-9827-d897c0d84702","resolution":{"observed_at":"2026-08-03T13:51:32.020328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"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":19,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.239255Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2602.23342"},"observation_digest":"sha256:c6eb8042f0a79ccdd96a2f8fbf42b92a5b42056b1fbdc9faec4f84bb59d58569","observation_id":"4ae84768-11ca-4fcd-8be9-4c693889ebb5","resolution":{"observed_at":"2026-05-15T18:46:29.427471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-02T18:07:09.137397Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.16360","last_updated":"2026-07-23T01:55:36Z","snapshot_observed_at":"2026-08-06T10:25:42.442930Z","submitted_at":"2026-03-17T10:47:35Z","title":"Fast Approximate Vector Joins via Offline-Online Co-Design","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T18:07:09.137397Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2603.16360"},"observation_digest":"sha256:b505adddf59f2b2efd440faf86627012f177a7a035859b3daeb09fdae2605829","observation_id":"b4ba05d6-2ec1-4f77-91c1-83cc540bff18","resolution":{"observed_at":"2026-08-02T18:07:09.137397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"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":9,"source":"pdf_text","source_observed_at":"2026-05-12T04:53:42.872514Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2605.10135"},"observation_digest":"sha256:c6247614d7c094c17cc53a9099f37531b459340b213d000179972964020256df","observation_id":"c9326ceb-e9a1-4c16-8cd3-d5e284f25dd5","resolution":{"observed_at":"2026-05-12T05:51:24.693837Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2605.25522","last_updated":"2026-05-25T07:22:13Z","snapshot_observed_at":"2026-08-07T10:42:53.213259Z","submitted_at":"2026-05-25T07:22:13Z","title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T19:51:10.637303Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2605.25522"},"observation_digest":"sha256:d292fe584ea039d72f473fd65a2a1d0b0f1f37cfeea34869d7f1902225a7f7fb","observation_id":"3d0439bc-29d5-4abd-93f4-fd17a83b2d4e","resolution":{"observed_at":"2026-06-29T19:53:54.969427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2606.02784","last_updated":"2026-06-01T18:49:44Z","snapshot_observed_at":"2026-07-31T18:47:56.958921Z","submitted_at":"2026-06-01T18:49:44Z","title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T11:49:00.258724Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2606.02784"},"observation_digest":"sha256:7a5577a2bfb4f237b85a34c13677913c0d3a663eb7f6635c176ae9e8febcfd22","observation_id":"e6b4f74c-36a4-4e78-9f7c-6ce505d53170","resolution":{"observed_at":"2026-07-02T01:36:25.219230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"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":15,"source":"pdf_text","source_observed_at":"2026-06-28T08:44:13.310548Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2606.02992"},"observation_digest":"sha256:8f9a3fea3dd0fd467e2d62fb0417cf02dac7235c79213186f54fa450f6ecaaea","observation_id":"4392eb53-bd77-4db0-af0b-293aa8f70b24","resolution":{"observed_at":"2026-07-02T04:56:38.911540Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2606.11789","last_updated":"2026-06-10T08:21:52Z","snapshot_observed_at":"2026-08-06T05:47:55.997746Z","submitted_at":"2026-06-10T08:21:52Z","title":"Efficient Graph Indexing for Interval-Aware Vector Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:bb36f6c8a2f317cd6c6a5a94f606127f504073f97a1b35dbf96492106ff32647","observation_id":"294c0680-dab9-4f7d-ba81-7fe16b8c4a93","resolution":{"observed_at":"2026-07-03T13:38:18.627776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2606.29970","last_updated":"2026-06-29T08:47:17Z","snapshot_observed_at":"2026-07-07T00:03:51.213896Z","submitted_at":"2026-06-29T08:47:17Z","title":"From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T04:21:15.488470Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2606.29970"},"observation_digest":"sha256:11aecaf30c4082002429e877b81538a6e89389d3d38a919898e65dbad99924cf","observation_id":"664d07f7-be5b-4cbf-838e-e2b0e5a69fe4","resolution":{"observed_at":"2026-07-01T15:15:47.578684Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"citing_paper":{"arxiv_id":"2607.00768","last_updated":"2026-07-01T10:52:09Z","snapshot_observed_at":"2026-08-03T20:26:39.740621Z","submitted_at":"2026-07-01T10:52:09Z","title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T03:11:31.712329Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2607.00768"},"observation_digest":"sha256:f156babb8501dcdc5c308b564cc50af8944e5cdccaaca15da7ea6ab5d43231a5","observation_id":"16c2f00e-626b-4a77-ada3-d99228117d73","resolution":{"observed_at":"2026-07-02T03:16:33.331136Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-07-11T16:08:01.254231Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04630","last_updated":"2026-07-06T03:30:53Z","snapshot_observed_at":"2026-08-02T17:57:41.451674Z","submitted_at":"2026-07-06T03:30:53Z","title":"Exploiting Structural Properties for Efficient Constraint-Aware HNSW Hyperparameter Tuning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:01.254231Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2607.04630"},"observation_digest":"sha256:0bd88cd9a739d836583a7a89719929cea127beeac82df516a7129b71377f8415","observation_id":"20c69ceb-393c-460b-b240-3424a4216dec","resolution":{"observed_at":"2026-07-11T16:08:01.254231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1707.00143/citation-record","integrity":"/paper/1707.00143/integrity","json":"/paper/1707.00143/citation-record.json","paper":"/paper/1707.00143"},"outbound":[],"paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","latest_version":10,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:1707.00143."}