{"as_of":"2026-08-11T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23c93284576f77850229631634c871007ff8ab320784d1424655974b0d9e2111","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:57:04.155330Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T01:12:03.533368Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T01:13:54.422505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"cited_work":{"arxiv_id":"2602.21247","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.21247","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3556133c-8eef-47f1-84f7-9abc51958025","year":2026},"citing_paper":{"arxiv_id":"2605.02171","last_updated":"2026-05-17T16:31:28Z","snapshot_observed_at":"2026-08-02T11:42:52.472108Z","submitted_at":"2026-05-04T03:04:12Z","title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-21T01:12:03.533368Z"},"links":{"cited_paper":"/paper/2602.21247","citing_paper":"/paper/2605.02171"},"observation_digest":"sha256:150c277219dc52282674cf5e1b511033981e1da17e2feb10ccd999e3c1604706","observation_id":"a8912e65-ee11-4244-abc2-87f32ab244bf","resolution":{"observed_at":"2026-05-26T02:03:10.247123Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.21247/citation-record","integrity":"/paper/2602.21247/integrity","json":"/paper/2602.21247/citation-record.json","paper":"/paper/2602.21247"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:00.419414Z","title":"Razenshteyn, and Ludwig Schmidt","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:00.419414Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:10f043c61f9ae033f89fc908fa69a6c1cc143944ce9fb12ec55149aa56d5c43f","observation_id":"b2644b17-5a33-4f87-925c-85fe2f9606d1","resolution":{"observed_at":"2026-08-02T22:57:00.419414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:00.556047Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:00.556047Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:d16e0955e3c78c08d25fbdbaffeb00622750849bb1d091c4462fe09153a32858","observation_id":"93983c8d-54d7-4469-a498-6d06c46819d1","resolution":{"observed_at":"2026-08-02T22:57:00.556047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:00.671516Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:00.671516Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:e266273b32d13f44d0df296e147bea141528e17b2ea5426e07df3d5baf08d84c","observation_id":"a4e877a1-b203-4e45-b0d4-5a86f66859e1","resolution":{"observed_at":"2026-08-02T22:57:00.671516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:00.841364Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:00.841364Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:73435dba21545623a0f77b102f5e3c509443780ad7e99bb13c79bedd52ac583f","observation_id":"1f6e9320-c7f8-49be-8e50-7ab116129e0c","resolution":{"observed_at":"2026-08-02T22:57:00.841364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:00.907434Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:00.907434Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:3f2e98e80b1da54451a7ff869edb4f82861799c8db2a9b03ce7bb68b557dd91c","observation_id":"8d541b85-1d0c-4a91-8e8c-798e115b8a6c","resolution":{"observed_at":"2026-08-02T22:57:00.907434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.022363Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.022363Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:5d20ae4ddbd2482cd3281791f0ad4773242df645506e2d6b7cf41624ed2ab8b8","observation_id":"b729326a-d7ac-4757-b882-5ded4bfb41d6","resolution":{"observed_at":"2026-08-02T22:57:01.022363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.172310Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.172310Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:9e6ffcfdd488c64a1c7d996eb218a5779c0eb68cdfb1208da2b77fe947beb5b2","observation_id":"51715219-afb9-490e-9695-f0866a9092e7","resolution":{"observed_at":"2026-08-02T22:57:01.172310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.235682Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.235682Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:45f138c8249a55089936589852662a4ccceafd2da772273e7935abee1c49c1e3","observation_id":"ac80d629-1b8e-413d-890d-da645ca4a7b0","resolution":{"observed_at":"2026-08-02T22:57:01.235682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.350562Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.350562Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:491a9febb2a098580d71ef075a6e5f19b00a432c389a84de4cc5d55e2fd3816f","observation_id":"d3c5e496-7963-40b2-8b66-4a70e61656f9","resolution":{"observed_at":"2026-08-02T22:57:01.350562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.504051Z","title":"Kakade, and John Langford","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.504051Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:67fdab2b06538b35a2d439c83000eb0599edbc6f41fb50e043628fc68deb0fbf","observation_id":"6c8b6f42-b377-4159-a720-54f0c30a4605","resolution":{"observed_at":"2026-08-02T22:57:01.504051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.564740Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.564740Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:bc136575e5f67743dcdd94c05bc2a27e75481918e6b5071f934d98e440bba521","observation_id":"3263ab02-9fd3-4ee4-adb3-8b3d01b9b05f","resolution":{"observed_at":"2026-08-02T22:57:01.564740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.609784Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.609784Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:2f04c8daddf8746d75a61a09f6675c5c6f3a0ed38e03e0ac2cf30504ebda8813","observation_id":"beaa9978-5e36-4cf2-8505-fcc1f2a80564","resolution":{"observed_at":"2026-08-02T22:57:01.609784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.666118Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.666118Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:c7ff2e138775a6b5d6ded112633c14a4211d0f09a05545380bce1f17a59bdc3b","observation_id":"4a2d794d-0db1-4e1c-94a6-99c39ebdb358","resolution":{"observed_at":"2026-08-02T22:57:01.666118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.724950Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.724950Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:413fe6db2789c6e563e8e500d5b25c2d0c44b08609af0ba2b7129bc1100004bf","observation_id":"f14abb36-6223-441e-9b73-6c834a55ffbd","resolution":{"observed_at":"2026-08-02T22:57:01.724950Z","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":"10.14778/3303753","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the VLDB Endowment","work_id":"f25d9701-8cba-47a2-b827-6cc85fdfc71a","year":2019},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.773427Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:29af0bcce6031e1b6891522060a63337cd2cf0d090ece7f87faadb7da4fad4a2","observation_id":"39184cf1-db2c-4c18-b1db-79570d6390be","resolution":{"observed_at":"2026-08-02T22:58:27.526295Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-02T22:57:01.852345Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.852345Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:6634c845707011d7610fe4d9777928fe58534d9cd89442203e98ce069fc14163","observation_id":"c892d750-6cf0-4872-8c8f-dd82599b44e9","resolution":{"observed_at":"2026-08-02T22:57:01.852345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.938306Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.938306Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:927002e80f08bb59a863c13f1329b880f9d0f66bb2298e07c7ab6f101e574e25","observation_id":"6ddc4a90-1576-43f6-81a7-8d11ea1009e9","resolution":{"observed_at":"2026-08-02T22:57:01.938306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.000010Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.000010Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:f128b7e1adeaee77cfbe75ed6b4886937f6f409ba253278d775c3ceb376ca245","observation_id":"79cb36db-35a0-49e2-995c-4df237779e8a","resolution":{"observed_at":"2026-08-02T22:57:02.000010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.052438Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.052438Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:c6ebd62ddcffc71b12bcb137af079492f5d0e1386d8d72255133cdf43c9ed513","observation_id":"0640bd6d-1d6f-4cbf-aa3a-2f8867aff03a","resolution":{"observed_at":"2026-08-02T22:57:02.052438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.103362Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.103362Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:18db4e0e06e29d5bf7c3dee223e5db3e6a088d6c1dfbd53a2ecebff099b1ea04","observation_id":"9dd8c046-9f4f-4431-a598-9800c31ddb7b","resolution":{"observed_at":"2026-08-02T22:57:02.103362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.153190Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.153190Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:54c5387b5de6f15644cc6c56e30c0040ac7d9fe1c2928753cb2ceaf1e97fed89","observation_id":"c565430b-7b00-4a4b-8f17-09be87d3c07a","resolution":{"observed_at":"2026-08-02T22:57:02.153190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.209169Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.209169Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:12b636a55679fe56ca589d8c9e8cd4b088bfa37c447cef244fc334e42230b8e4","observation_id":"b40622bd-05fe-41e3-a423-353d3af884c5","resolution":{"observed_at":"2026-08-02T22:57:02.209169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.261133Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.261133Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:2158e2d80af123be0a0b6a0147c82dc1e1d5dbe9a299e287a1864a460b5a19ad","observation_id":"506a633b-43da-40d0-8f92-3e9e4560de12","resolution":{"observed_at":"2026-08-02T22:57:02.261133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.323524Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.323524Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:8cfac729de3e3d71412e06947dc757f3ba02a75bb8df466c9bc57f326a846a82","observation_id":"bf0819f4-1bb8-44fc-8cb8-950b1be6ce3c","resolution":{"observed_at":"2026-08-02T22:57:02.323524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.358320Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.358320Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:76b80200c18a87666896ea69f470d39c892d653fe3fb8ae6ad8a9235439119d8","observation_id":"81d8e6cf-2030-4575-8398-1b7a919dcfd0","resolution":{"observed_at":"2026-08-02T22:57:02.358320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.411409Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.411409Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:f86cab8bdfd4be44bc1e492633d49d03f83707e4a064e86aa5a4c271b6d4e36c","observation_id":"b45ebee7-0bd2-4d57-b7ae-3992a132749d","resolution":{"observed_at":"2026-08-02T22:57:02.411409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.510174Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.510174Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:94debfaac3f8da32093450395260b66d78c26870c7ef99fcac970b4cd7973976","observation_id":"fc169cf4-2625-44ef-8aad-c1893eff4d91","resolution":{"observed_at":"2026-08-02T22:57:02.510174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.567093Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.567093Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:60441ce4e41ec8bbed72bdca632b4610ce7ad09b8c0bdd0b22e5d400c82c5379","observation_id":"3ec2718a-6faa-42d8-99d8-11e79c0135aa","resolution":{"observed_at":"2026-08-02T22:57:02.567093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.632670Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.632670Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:07761b782ac922bf65bc277cf79d32f244ce154f21cad2151d26ded71fb15e33","observation_id":"b4e8aebe-e055-44c5-bf85-161eb0a27fa7","resolution":{"observed_at":"2026-08-02T22:57:02.632670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.690824Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.690824Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:027fe45e145d023fb0a5c57a1021d5e4e8900dd303b570e58f1f65b236b81cc4","observation_id":"f8326d52-0cbc-4086-bec1-c28f79c13413","resolution":{"observed_at":"2026-08-02T22:57:02.690824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.801980Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.801980Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:fa5fc0164b7ea0cc0d9af68d8485818b7701b2d6738b86dde037ed6721fc5ad8","observation_id":"fba475dd-b1b1-4b66-8f1d-117ca2c05d7e","resolution":{"observed_at":"2026-08-02T22:57:02.801980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01382","last_updated":"2022-10-22T08:45:28Z","snapshot_observed_at":"2026-07-06T13:17:01.373088Z","submitted_at":"2022-06-03T04:02:02Z","title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.01382","snapshot_observed_at":"2026-08-02T22:57:02.928265Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.928265Z"},"links":{"cited_paper":"/paper/2206.01382","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:294388c70e171500129c6fdc781cd9b889665807fe2422c2a87094128b781ccc","observation_id":"8e6bbb2f-f7c7-43cc-87cf-499b0ef2f5ca","resolution":{"observed_at":"2026-08-02T22:57:02.928265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.974013Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.974013Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:f080d86cd95dd929323304f4dd1d5a647e7a8d46c147c7f29c73dbf968889b98","observation_id":"745799fe-a2bb-4b78-ac2c-f6099ed33cd5","resolution":{"observed_at":"2026-08-02T22:57:02.974013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.109225Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.109225Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:3947d68130a936b6e3741bb6b3f571d96ee33d6686b3276d9147e01476b17d28","observation_id":"acfd2147-9c69-4ae7-bcc7-78222b83957f","resolution":{"observed_at":"2026-08-02T22:57:03.109225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.241268Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.241268Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:3ed5fe730ef8f5cca030e1daf9084ffc4700a8b947249a104cf49548fef6860b","observation_id":"3c6551b4-6724-4c3e-8f79-d0a9398f2ae4","resolution":{"observed_at":"2026-08-02T22:57:03.241268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17424","last_updated":"2024-09-25T23:24:56Z","snapshot_observed_at":"2026-08-10T18:40:27.613428Z","submitted_at":"2024-09-25T23:24:56Z","title":"Results of the Big ANN: NeurIPS'23 competition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17424","snapshot_observed_at":"2026-08-02T22:57:03.336443Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.336443Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:49f37ac31b55c871bff9677ae9672d5587eb409f7ac51540fbdf0ef08f464718","observation_id":"13062cf2-815d-4de7-9fe8-81a1bb2375e4","resolution":{"observed_at":"2026-08-02T22:57:03.336443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.454808Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.454808Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:aded55430ce88f9eca67d0f04eaae41c69ea66d2773e8ed35aab891f32d9fa10","observation_id":"d39dc7dc-39e0-4b63-b383-672ed7c24976","resolution":{"observed_at":"2026-08-02T22:57:03.454808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-11T17:00:01.403481Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06163","snapshot_observed_at":"2026-08-02T22:57:03.523760Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.523760Z"},"links":{"cited_paper":"/paper/2502.06163","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:1cf0f5ade6bed3e36eda47f9a87e8fd63d742e6c76da07ad1498bdbced2d1dcd","observation_id":"a8e6f14f-0c1f-4b7a-9d4e-45bf5eb5416d","resolution":{"observed_at":"2026-08-02T22:57:03.523760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.594905Z","title":"Tamer Özsu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.594905Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:fbd8b6e4a5c91090982552953424b243a9e6e7f217431d2dff4f5b313766a82a","observation_id":"7eaf24e4-7770-4804-84fb-6cde52f9730f","resolution":{"observed_at":"2026-08-02T22:57:03.594905Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.707277Z","title":"Bennett, Junaid Ahmed, and Arnold Overwijk","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.707277Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:2a4469771105d8df17105609e8880490603dac6428ae3ffcfbe05eeb6924dd64","observation_id":"69c4c418-3109-46f7-9c5d-cbb6c018e0fb","resolution":{"observed_at":"2026-08-02T22:57:03.707277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01231","last_updated":"2025-02-17T07:29:18Z","snapshot_observed_at":"2026-08-05T05:08:24.835680Z","submitted_at":"2024-10-02T04:29:08Z","title":"Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01231","snapshot_observed_at":"2026-08-02T22:57:03.833739Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.833739Z"},"links":{"cited_paper":"/paper/2410.01231","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:8679cbfc602d127ade10bd25c3446a9a063c54f0c482a9b4a5851ce7fd78135b","observation_id":"785c4982-c11a-43cf-8b8d-7107147cddd3","resolution":{"observed_at":"2026-08-02T22:57:03.833739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.882755Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.882755Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:39ef259fa581788dd0031b31f06cdadc43c786417e88bec764a2db1ec7121d05","observation_id":"1fc08602-c337-46f1-935d-35b2354c3743","resolution":{"observed_at":"2026-08-02T22:57:03.882755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:03.951898Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.951898Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:372bbd50c0dce5ea3d17657dde69bec8164c0423f80feedecfd219b74acc4163","observation_id":"c2b9d297-bcb5-48d9-8e95-e3121af9a574","resolution":{"observed_at":"2026-08-02T22:57:03.951898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:04.070392Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:04.070392Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:36330d96e47a7cba14e8e509b12387e78389a4275e95ee02c8292af09ae33a2e","observation_id":"435927ee-4961-4cfe-b56e-ef11e6d82a7c","resolution":{"observed_at":"2026-08-02T22:57:04.070392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:04.155330Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:04.155330Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:8eca16f6f5a0e0e510eaa41b11dd9963eb6e2ca10e7b08a8c55aa84a3c4b8630","observation_id":"43d52494-37d3-4c8e-9f55-1305f41a5dab","resolution":{"observed_at":"2026-08-02T22:57:04.155330Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:01.297909Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.297909Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:1d586ea3cd809af189e018edf4791cf40e4bc3389afd7b08b369c8dde99ee7f5","observation_id":"9f044667-1154-4934-a863-a1d2a4d0d882","resolution":{"observed_at":"2026-08-02T22:57:01.297909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.749533Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.749533Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:fdcd681c8b9bfa6ae4aa61a782e04bbed71fbe531e3fcf8c0819b0e15556ac02","observation_id":"e7335bdc-5972-4399-a27f-5940b645df95","resolution":{"observed_at":"2026-08-02T22:57:02.749533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:57:02.462685Z","title":"VLDB Endow.14, 1 (2020), 50–60","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.462685Z"},"links":{"citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:66fc512ed58526550733b3217f96b59b54d987c4b8883de2ade4904a08e31b46","observation_id":"73d6bc86-82f4-4083-b552-5efa7cfddb41","resolution":{"observed_at":"2026-08-02T22:57:02.462685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10005","last_updated":"2022-01-24T23:36:20Z","snapshot_observed_at":"2026-07-06T12:30:51.934079Z","submitted_at":"2022-01-24T23:36:20Z","title":"Text and Code Embeddings by Contrastive Pre-Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10005","snapshot_observed_at":"2026-08-02T22:57:02.857296Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:02.857296Z"},"links":{"cited_paper":"/paper/2201.10005","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:248d0e289cc52bb88d3bf38f148d00da82942fd93ad87a8ce5ee5d15d9642bfa","observation_id":"4c2479a9-ef27-496e-8a30-125d46302b28","resolution":{"observed_at":"2026-08-02T22:57:02.857296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06774","snapshot_observed_at":"2026-08-02T22:57:01.410942Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.410942Z"},"links":{"cited_paper":"/paper/2508.06774","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:55921f4ad400c78ea1e60b6383cbaf2b072643b01a79f295fb24fd9eeb2b3141","observation_id":"e60b578e-9d8c-4264-8cb4-f132d168e926","resolution":{"observed_at":"2026-08-02T22:57:01.410942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","latest_version":3,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 1 inbound Pith citation observation for arXiv:2602.21247."}