{"as_of":"2026-08-09T13:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19f9272bbbfb32ddd95d375b1146d726478efd65ee2d7a367fe11bfc34f3a80b","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:01:17.606605Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.17094/citation-record","integrity":"/paper/2507.17094/integrity","json":"/paper/2507.17094/citation-record.json","paper":"/paper/2507.17094"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.647054Z","title":"https:// big-ann-benchmarks.com/neurips21.html","venue":null,"work_id":"9fd8bc0b-93ae-4cc5-abee-a8d716afa59f","year":null},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.957763Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:134175bcd8abf0106c1486c5c223bf8e7cb987cb8a595fab7d416eb08727df9b","observation_id":"fc5989f9-7f51-4bb9-b909-dd3b6b542615","resolution":{"observed_at":"2026-08-06T15:01:19.654215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.625845Z","title":null,"venue":null,"work_id":"6c2e81fb-2e97-4307-ad2d-dc6be65644c2","year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.964452Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:3a0c7999d17ee050d5de36820757133c7eb897a3d6f4661e5a6a976ee541e5ef","observation_id":"db81d71e-9289-4992-b32c-9f2b48761314","resolution":{"observed_at":"2026-08-06T15:01:19.633080Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.602256Z","title":null,"venue":null,"work_id":"7287a333-ab36-45c7-8de8-b6d6fbf0a04d","year":null},"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":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.969901Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:998152a2e14fddd3adda0e5c26d7d0a9c4d423a4d9b9d3b0b9fa63b862a56c15","observation_id":"94e3becc-bed8-4db9-95fb-f54f84d184a9","resolution":{"observed_at":"2026-08-06T15:01:19.610671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.577311Z","title":"https://www","venue":null,"work_id":"9647b8ca-115f-46e8-8ef4-f8d36865b8a5","year":null},"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":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.977451Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:d7e828c54e436b0c482cd2e4b16747ad9a0b9c3aceca2f1601540efa33d4cad3","observation_id":"127c7fd5-c5c1-48fa-a856-22d117a18940","resolution":{"observed_at":"2026-08-06T15:01:19.582900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.549109Z","title":null,"venue":null,"work_id":"822c8f62-a4b0-4192-a46b-930c3795ef6c","year":null},"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":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.985108Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:34002f3f361a4c69d73b96f95bbcacf1dfb598bbb71bb567b9533a0665f57df1","observation_id":"a93fccbc-5e97-461d-8d2a-6c031d159984","resolution":{"observed_at":"2026-08-06T15:01:19.555603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.526038Z","title":null,"venue":null,"work_id":"beee808e-68e7-4cb1-9281-5746abea0690","year":null},"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":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.994431Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:39f9aec897b3d6f3be4ca932ed76d388b28d8d4083834b852dedeca92ddf7275","observation_id":"b273c756-c2d5-42a6-a4f1-8bc832159fea","resolution":{"observed_at":"2026-08-06T15:01:19.532064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.499799Z","title":"https://docs.rapids.ai/api/ cuvs/stable/cuvs_bench/wiki_all_dataset/","venue":null,"work_id":"a89a3ec6-fad2-4a10-b717-1c89344bd40e","year":null},"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":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:16.999802Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:790d81052c3949c1feb95626d612fb77f245cbda8ee3b5d52f323c5954f0063b","observation_id":"fc48e62a-1099-4fd8-9206-290fa5635f57","resolution":{"observed_at":"2026-08-06T15:01:19.509083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.468047Z","title":"Amsaleg and H","venue":null,"work_id":"ce625e8c-aaba-4b28-94b4-66800b79abd2","year":null},"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":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.007969Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e773fb7c4b8db2ade4b14798c549019e602a48bd13907650ba70489e830f59ef","observation_id":"c298c31b-af08-4d6b-9c13-e87156d785b9","resolution":{"observed_at":"2026-08-06T15:01:19.473796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.443268Z","title":"Accelerated Nearest Neighbor Search with Quick ADC","venue":null,"work_id":"ee6ddf7f-b30f-4fdd-a662-d721cd39e8d6","year":2017},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.014304Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:6577e16841dc1981a986e2738cc607e159923d19f7ace934ef5e0ee5bd202234","observation_id":"d9ae2cdd-b450-46c3-a61c-70c9815704ab","resolution":{"observed_at":"2026-08-06T15:01:19.450518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:17.022987Z","title":"Efficient index- ing of billion-scale datasets of deep descriptors","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":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.022987Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:114132b16e5d432e6ca13e8dae17caadb6ecd5069862da7ed53273270a4f6651","observation_id":"0ef5ee74-afad-49c4-8e6d-60247fe00a95","resolution":{"observed_at":"2026-08-06T15:01:17.022987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.401131Z","title":"Connolly, Dimitri Lisin, Jimmy Briggs, and Mario E","venue":null,"work_id":"eaa06c8b-48db-442a-800b-185facdb18ab","year":2019},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.034755Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:faeb36f1393136a63d91c84552b3445738b6bbfe07ea063c5914e57f904cb855","observation_id":"88bde843-6294-41c4-a850-643959b8cb0a","resolution":{"observed_at":"2026-08-06T15:01:19.406785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.371405Z","title":"Finger: Fast inference for graph-based approximate nearest neighbor search","venue":null,"work_id":"0decbf2b-7d08-448c-83b1-16307f1a46a1","year":2023},"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":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.041763Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:194444622f23dd37919dfffdea73567e52cc477681584158eb72f29031157cfb","observation_id":"fd765dde-4cb8-4710-8142-6e7b28bd1c87","resolution":{"observed_at":"2026-08-06T15:01:19.381468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.342568Z","title":"Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation","venue":null,"work_id":"e0ae2cc0-5099-4f7a-a8da-a31656ab58d7","year":2022},"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":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.047837Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:ea1b5e6901ca779de719b5918e5fb46bd299e536b7c4f3bc3a2200aff8a20af2","observation_id":"e631581b-4d0f-4081-b90f-8e4642f1684d","resolution":{"observed_at":"2026-08-06T15:01:19.351078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.315079Z","title":"Vector and line quanti- zation for billion-scale similarity search on GPUs.Fu- ture Generation Computer Systems, 2019","venue":null,"work_id":"6f540e18-2cf2-4480-9741-736d2617eb5e","year":2019},"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":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.056179Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:a78d693819f55155bc8c3ea96170cc97d1695c3d2265539b9fe29eaf1631abee","observation_id":"9a91007f-1eeb-4a5f-8200-29bb67e23934","resolution":{"observed_at":"2026-08-06T15:01:19.323824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.285681Z","title":"Clarkson","venue":null,"work_id":"3a9cdcfd-d8bb-427c-8dc3-06186efdee3a","year":1994},"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":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.063591Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:6c95c28d69a8937411dd4703b1ea28db1ccde718ebd3e633a74ce4820956a944","observation_id":"da191e15-454e-43b1-b1d9-6023dc0a64de","resolution":{"observed_at":"2026-08-06T15:01:19.295137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.256926Z","title":"Graph reordering for cache- efficient near neighbor search","venue":null,"work_id":"6c4a3b9b-9740-4533-9212-64c60459e2d1","year":2022},"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":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.074757Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:8114bff10a49755720c7c834321b8c150080ccb0945feeaa170d7f317af81ea9","observation_id":"7f9e78ba-2553-4427-a411-5c692a983166","resolution":{"observed_at":"2026-08-06T15:01:19.262058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.234082Z","title":"Indexing by latent semantic analysis.Journal of the American society for information science, 1990","venue":null,"work_id":"9612b291-32d6-4435-9f4f-0b74870ff23d","year":1990},"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":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.081837Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:28e0068028c2fec284140f3a553e7a254559c1941f24ce53764282945317fd15","observation_id":"3b994ed6-f6df-4cd7-a29f-a164cee7bad5","resolution":{"observed_at":"2026-08-06T15:01:19.241669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-06T15:01:17.086637Z","title":"The Faiss library.arXiv:2401.08281, 2024","venue":null,"work_id":null,"year":2024},"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":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.086637Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:f60d0e406179d5bb23c849ff927824366f554b1fd5cf1a0eb610c598ea4fe013","observation_id":"ada44958-261d-40fb-a83d-13e21b329036","resolution":{"observed_at":"2026-08-06T15:01:17.086637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.207197Z","title":null,"venue":null,"work_id":"c453d99a-cd9b-4cfe-8e8a-8d609221b42c","year":1997},"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":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.094472Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:7b6e90e6dacd11a2e3c5939941c9f3061d68b79194df08f38bad90047f1e7bf4","observation_id":"2abede9c-024f-4671-bbad-34d282effac1","resolution":{"observed_at":"2026-08-06T15:01:19.214260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-07-06T05:11:54.219180Z","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:a83d2e3b401b0aab6c5d2e4cc60993e3d9d330ba7f18fbb5174279d978ee7fb9","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.183206Z","title":"Fast approximate nearest neighbor search with the navi- gating spreading-out graph.Proceedings of the VLDB Endowment (VLDB), 2019","venue":null,"work_id":"eb7cd457-3dd5-41a5-88fb-7e78a93b71f5","year":2019},"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":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.108829Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:cf4d8b5237c8e1db9efc5fc9369247328a24be97bfcb07e59e1944071f1fb8ab","observation_id":"9fb04a40-d837-42c8-8fe1-ef4d15d12bc9","resolution":{"observed_at":"2026-08-06T15:01:19.189722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.157442Z","title":"High-Dimensional Ap- proximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations.Proceed- ings of the ACM on Management of Data (PACMMOD), 2023","venue":null,"work_id":"a6e1e83f-0d25-4077-933f-3b3da03b3917","year":2023},"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":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.113899Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:2e0df43636ce2e84253c9273b863b3a5df1b0a9e383fd4967b8727362ee53f2d","observation_id":"d3a3937d-ec85-4ca0-8237-d0f38dc15863","resolution":{"observed_at":"2026-08-06T15:01:19.165404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.132962Z","title":"Opti- mized Product Quantization for Approximate Nearest Neighbor Search","venue":null,"work_id":"b75cb135-cbf3-4bcb-8efc-8e7517df48a1","year":2013},"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":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.119224Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:0eea0b7365cff2f03075301a3e37eb903e3f1775e59f69b24b5ea005953cf165","observation_id":"44f45db4-5090-4a15-992b-9bafb1ceb459","resolution":{"observed_at":"2026-08-06T15:01:19.140025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.102320Z","title":"Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters","venue":null,"work_id":"38b69326-3831-4873-a820-b2dd58ee8f22","year":2023},"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":24,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.124207Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:8563e695bc291ba57483a44afd1aec0f0294c32b28439d9b4b26cb55fbf788a5","observation_id":"5c4024d1-bc02-4384-8eda-15c58536829d","resolution":{"observed_at":"2026-08-06T15:01:19.108581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.080187Z","title":null,"venue":null,"work_id":"db1656af-356a-4c49-aadb-e594a38eb6ca","year":2023},"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":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.131573Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:bedc647d0eae7e302f9c8c41ba60fc303512031bc9fe5de61e4a0a9d689942b6","observation_id":"f26c0578-3432-4504-9b12-4b52e29f3838","resolution":{"observed_at":"2026-08-06T15:01:19.086773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:17.137959Z","title":"Ac- celerating large-scale inference with anisotropic vector quantization","venue":null,"work_id":null,"year":2020},"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":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.137959Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:aada592c177ccd6f6488e77934ce497ab48ed32cd4ff1ea345379ac4b051096f","observation_id":"15ef906b-6d19-427b-adbe-36b877c91834","resolution":{"observed_at":"2026-08-06T15:01:17.137959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.043226Z","title":"Query-aware locality-sensitive hashing for approximate nearest neighbor search.Proceedings of the VLDB Endowment (VLDB), 2015","venue":null,"work_id":"83289a76-d7b5-4904-9f95-fa087343c35c","year":2015},"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":27,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.145124Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:31ea51225ed05ed85ec666808316bdaf8e96c08a2390f87879f4586e0fbec81f","observation_id":"d63b1b93-cb14-4734-b530-53c24347fb6c","resolution":{"observed_at":"2026-08-06T15:01:19.049263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:19.021117Z","title":"Approximate nearest neighbors: towards removing the curse of dimension- ality","venue":null,"work_id":"4ca5e327-6054-40d5-abff-eaba368ac61f","year":1998},"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":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.150354Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:11fc0afff92f2a043c1683b0592a227a1878447c87ff64edb434ef47c745f5f6","observation_id":"3160b833-c4d0-4172-a554-5caefccc375d","resolution":{"observed_at":"2026-08-06T15:01:19.027808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12850","last_updated":"2022-11-30T11:14:07Z","snapshot_observed_at":"2026-07-31T18:00:43.513660Z","submitted_at":"2022-10-22T21:22:50Z","title":"OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12850","snapshot_observed_at":"2026-08-06T15:01:17.157335Z","title":"OOD-DiskANN: Efficient and Scal- able Graph ANNS for Out-of-Distribution Queries","venue":null,"work_id":null,"year":2022},"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":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.157335Z"},"links":{"cited_paper":"/paper/2211.12850","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:3ee46a436df743d63cb06fd21edf8596e1616217d83ecb93ef86e313c09a30aa","observation_id":"cab3ff37-5d99-4159-bc7e-e45ec000d696","resolution":{"observed_at":"2026-08-06T15:01:17.157335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.995708Z","title":"CXL-ANNS: Software-Hardware Collaborative Mem- ory Disaggregation and Computation for Billion-Scale Approximate Nearest Neighbor Search","venue":null,"work_id":"c9ab7ec3-258a-45dd-b367-e74b95b88028","year":2023},"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":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.175771Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:0ab491fea2aabd0e5472a195915ed9a1120b6192532b01e3a4b3dcab81046c04","observation_id":"b998a924-afdb-4454-aa22-77b3bc0fc9f7","resolution":{"observed_at":"2026-08-06T15:01:19.003456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.975349Z","title":"Billion- Scale Similarity Search with GPUs.IEEE Transactions on Big Data, 2021","venue":null,"work_id":"a291ed16-205e-411b-8285-8b0097ec894a","year":2021},"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":31,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.185401Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:6e5857bf6cd5328490929bc82285cddab0017a1685ce591410ee96554f605688","observation_id":"be563b8a-ef75-4b40-86be-3199c8d593c5","resolution":{"observed_at":"2026-08-06T15:01:18.981298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.953568Z","title":"Product quantization for nearest neighbor search.IEEE Transactions on Pattern Analysis and Machine Intelli- gence, 2011","venue":null,"work_id":"f8e1da4f-ecbe-4b34-8adc-3b9d57a2a69b","year":2011},"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":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.190594Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:419224476d176526e07b9f54a07de232ff446353a2c598dc6ac6257ca8efc18f","observation_id":"151837f6-d441-4f92-841b-fd98bf0ac3a9","resolution":{"observed_at":"2026-08-06T15:01:18.959041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.936246Z","title":"Locally Opti- mized Product Quantization for Approximate Nearest Neighbor Search","venue":null,"work_id":"7f624edf-eb82-42ab-b93f-0bbfe7bc413d","year":2014},"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":33,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.196735Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:95ca2683325d2af0a0fb566a48dd55e0ab6cba15ba0ab5f40b1b59ecca434096","observation_id":"d73178af-e88c-4d12-82f3-aafd15f2c232","resolution":{"observed_at":"2026-08-06T15:01:18.941799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.916927Z","title":"Mining visual phrases for long-term visual SLAM","venue":null,"work_id":"3517e040-c8fb-48e8-9788-2b2b3af757c0","year":2014},"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":34,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.203042Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:a7be69d18163a93684f3f2184dee5871db1de793708849aaaf14547881152a7b","observation_id":"3e23e3f6-67df-46b5-b6a8-480a6a8da6db","resolution":{"observed_at":"2026-08-06T15:01:18.922271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.896787Z","title":"Generalization through Memorization: Nearest Neighbor Language Models","venue":null,"work_id":"a3136863-3d4d-4161-b55c-4dd3485da3a8","year":2020},"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":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.209844Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:6c7945747af38aa861bac7b9dcc3a6178b9be26c36043f755647dda6e91e4897","observation_id":"3ce4a675-cbb2-446e-a13d-4d749c5feac0","resolution":{"observed_at":"2026-08-06T15:01:18.902564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.876123Z","title":"Accelerating large-scale graph-based nearest neighbor search on a computational storage platform.IEEE Transactions on Computers, 2023","venue":null,"work_id":"d005dc87-61a5-4c12-8498-9cbacd053e61","year":2023},"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":36,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.214491Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:6f1418f4237f7156ea5f5ab7b5530283919894d13fb9f6a171bb7542dcdf6c7a","observation_id":"e36d37d7-df69-45ca-90c9-07737ef40420","resolution":{"observed_at":"2026-08-06T15:01:18.883154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.854303Z","title":"Andersen, and Yuxiong He","venue":null,"work_id":"fcc7c9a9-4353-468f-ac7e-f1d2bce8bf28","year":2020},"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":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.219740Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:055e15927d14deed03245216c53998178e5c636da08552703d7cbd80e1416e32","observation_id":"4b46da0a-6be3-4773-95d9-72cfea025d84","resolution":{"observed_at":"2026-08-06T15:01:18.860298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.823224Z","title":"Approximate Nearest Neighbor Search on High Dimensional Data — Experi- ments, Analyses, and Improvement .IEEE Transactions on Knowledge & Data Engineering, 2020","venue":null,"work_id":"3b859bdf-2276-4380-9a2f-7c57696899f2","year":2020},"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":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.227372Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:2b59855df8865b71e1020ad2edc769c41ca24ad87a36258288d4f54067d33008","observation_id":"b9e9a1f6-267b-4110-8634-aac4f8c18d1d","resolution":{"observed_at":"2026-08-06T15:01:18.829560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.802044Z","title":null,"venue":null,"work_id":"2facebc7-bb56-4234-aecf-3cd9b21cfe3d","year":2007},"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":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.239573Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:40cd7a6dac5e0c3529fe56e2ea14b828590a98cac24a2140e14ca1dbcad8cf15","observation_id":"ae39e986-169d-42fa-b206-70b0342e54da","resolution":{"observed_at":"2026-08-06T15:01:18.808635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.782997Z","title":"Malkov and D","venue":null,"work_id":"fc3e14fc-9ed9-4cd4-bc96-1534cbb4e9ab","year":2020},"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":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.244782Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:24740704d22217eb4b78f41983ebf01a1b5d6ed1649af2aa92148318d249aaa5","observation_id":"bb7291a6-e8c4-4d6e-b31e-44abba2bece9","resolution":{"observed_at":"2026-08-06T15:01:18.788126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.758563Z","title":"Approximate nearest neigh- bor algorithm based on navigable small world graphs","venue":null,"work_id":"07940fc2-f9f3-4701-888b-4592882f35f2","year":2014},"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":41,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.255447Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e47a0371cc09185742408ff00f9ae0ae0e3e970016de4489c1201759192188ee","observation_id":"a91e0c04-9266-45ff-9d3d-cba6ff53ca4c","resolution":{"observed_at":"2026-08-06T15:01:18.764164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.738627Z","title":"ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms","venue":null,"work_id":"4580a96b-38f9-49dd-8c42-1af4f7e9128b","year":2024},"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":42,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.261995Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:00585fe03c60176d05db81aebcc5d91d38297b5db1eebc5f7031332a43da4ffc","observation_id":"a615605f-6ac6-4aa1-978b-7fa870e55336","resolution":{"observed_at":"2026-08-06T15:01:18.744982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.713033Z","title":"Nene and Shree K","venue":null,"work_id":"7d319fb5-359e-4be8-8a85-2afc822d5928","year":1997},"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":43,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.268972Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:4d73d23c4f2ddcabee82f5803e43dc09be0c8736ec28cc3813e2a2d0364efa0d","observation_id":"387a15c8-7b34-47b3-9bcf-4b154b99cf6d","resolution":{"observed_at":"2026-08-06T15:01:18.722795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.689999Z","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","venue":null,"work_id":"3e5c36d7-6180-4aba-849f-4f1efca24c78","year":2024},"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":44,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.278822Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:1df4a2e8fd9a7618e5e9071904c57cb541b0c46bf503c8bdc95f41bf04e68126","observation_id":"4eaf0cd5-f875-4f9f-aa78-9b7b63162623","resolution":{"observed_at":"2026-08-06T15:01:18.696626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.659595Z","title":"LM-DiskANN: Low Memory Footprint in Disk-Native Dynamic Graph- Based ANN Indexing","venue":null,"work_id":"4e5a45da-2fc2-4973-a7f7-c69067125725","year":2023},"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":45,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.291909Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:7a467d9d609c35b07ca33e2fdafb192f7fbc2ac4d8614770bb226ede65140238","observation_id":"de7a238d-ec90-47ca-9c68-e04dc6cffe19","resolution":{"observed_at":"2026-08-06T15:01:18.667808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.639645Z","title":"Least squares binary quantization of neural networks","venue":null,"work_id":"40285d68-8ca0-4b01-a899-aeb2f6fa8eb8","year":2020},"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":46,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.297333Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:0c604eb0834b953afe18268388aa8d75c439c39a449322019b3e18327698e4d5","observation_id":"788e6491-1014-4d9f-b988-5b2e7b4af525","resolution":{"observed_at":"2026-08-06T15:01:18.646096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.615238Z","title":"HM-ANN: effi- cient billion-point nearest neighbor search on heteroge- neous memory","venue":null,"work_id":"22b95baf-c7a4-4dce-9ad0-881b73ab9fa4","year":2020},"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":47,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.304870Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:00bde352c5791664f2527c9d385203def909e531a7223a6ce5fc3507591ef4c0","observation_id":"509fc51c-333c-402d-aecf-1f7d74dac06e","resolution":{"observed_at":"2026-08-06T15:01:18.622830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.593773Z","title":"Optimised KD-trees for fast image descriptor matching","venue":null,"work_id":"5cc55990-9e20-4d4d-ac5f-5f933b08138c","year":2008},"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":48,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.311478Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e44bcaec460d7e2159eb6d98e463c7d88c0805e808f32b0164f71a5724ffccaf","observation_id":"a0795c1e-3422-4ffb-ae96-44e4ed29c628","resolution":{"observed_at":"2026-08-06T15:01:18.599980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-07T07:51:37.438902Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-08-06T15:01:17.318686Z","title":"FreshDiskANN: A Fast and Accurate Graph- Based ANN Index for Streaming Similarity Search","venue":null,"work_id":null,"year":2021},"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":49,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.318686Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:7cbb6be3faf0940cc6ec43d93fd9c6f736883016ab0a91552b9745e0cde196ea","observation_id":"44f08018-3c59-4bdb-b059-c675a54a4ae8","resolution":{"observed_at":"2026-08-06T15:01:17.318686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.573445Z","title":"DiskANN: fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"8614ce85-db2c-43e9-a690-61a3ad629d97","year":2019},"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":50,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.326514Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:bff5ccb94be41f24f28a4593ea82a8635fb0a4815053fe7df14eee7ff55a323f","observation_id":"95d8aee9-6b92-475a-8991-17da4a2c7a7d","resolution":{"observed_at":"2026-08-06T15:01:18.578869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.549454Z","title":"Scalable billion-point approximate nearest neighbor search using SmartSSDs","venue":null,"work_id":"bc74d4d2-7b8c-4e5b-8917-df45266dd60b","year":2024},"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":51,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.500578Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:86ead8fd4ea646402b322e19764d639797f5f8b1bf034f05004e6a8a71f7c5fb","observation_id":"0b1025ad-726b-412e-9e3d-366f914ba0c2","resolution":{"observed_at":"2026-08-06T15:01:18.554808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16576","last_updated":"2024-09-25T03:14:01Z","snapshot_observed_at":"2026-07-06T19:21:33.180652Z","submitted_at":"2024-09-25T03:14:01Z","title":"FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16576","snapshot_observed_at":"2026-08-06T15:01:17.506638Z","title":"FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Search","venue":null,"work_id":null,"year":2024},"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":52,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.506638Z"},"links":{"cited_paper":"/paper/2409.16576","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:1b6cd5adc0dd300f9b9a169b7d271550cc4653eb600383e5795bb3df208e10dd","observation_id":"d7d2c802-9614-4103-9f76-70bbe1985349","resolution":{"observed_at":"2026-08-06T15:01:17.506638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11324","last_updated":"2025-04-12T18:43:50Z","snapshot_observed_at":"2026-08-05T02:46:32.295827Z","submitted_at":"2024-01-20T21:09:19Z","title":"BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11324","snapshot_observed_at":"2026-08-06T15:01:17.514346Z","title":"BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU.arXiv:2401.11324, 2024","venue":null,"work_id":null,"year":2024},"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":53,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.514346Z"},"links":{"cited_paper":"/paper/2401.11324","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:51715df406ed9fa43638a51f0af73aefdf2bf1b417dafacedee6b673af449b68","observation_id":"c7b46dd6-c300-476c-b368-2111bb7df600","resolution":{"observed_at":"2026-08-06T15:01:17.514346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.517024Z","title":"Gonçalves, Zanoni Dias, and Ricardo da S","venue":null,"work_id":"faf710d2-3b10-4021-9034-842cfee2e256","year":2019},"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":54,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.520714Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:fa09353ee1d08651326959a37c51178b1a59d637e6f5fee71ec1d124e3d76809","observation_id":"4316f3bb-de22-481c-90b4-ff592ed7baba","resolution":{"observed_at":"2026-08-06T15:01:18.527248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.494179Z","title":"Milvus: A Purpose- Built Vector Data Management System","venue":null,"work_id":"34e162a5-307f-4884-8ec6-d79eaa83b516","year":2021},"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":55,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.526249Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:71fe31c56094cdeaa4bcd51dc2eeeaca486c77e56f38e8f4368389dd864528d5","observation_id":"b97f4217-6f07-42bc-8dfe-f6b733389009","resolution":{"observed_at":"2026-08-06T15:01:18.500827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.464442Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neigh- bor search.Proceedings of the VLDB Endowment (VLDB), 2021","venue":null,"work_id":"e628755c-6aa5-486a-8199-2183ed387680","year":2021},"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":56,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.531557Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:0240af368e7bd978f949cfcdde1872bc18b8251a29ced17c538fb4fed46a04ce","observation_id":"ff90b92a-2bcb-48ab-a75b-f87a6c02a9e7","resolution":{"observed_at":"2026-08-06T15:01:18.477710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.426583Z","title":"NDSEARCH: Accelerating Graph-Traversal- Based Approximate Nearest Neighbor Search through Near Data Processing","venue":null,"work_id":"98b8832a-022d-4d25-a37e-5f1a8c9ee7a2","year":2024},"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":57,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.538365Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e8500620ed52cdc4ec47cfb7c56bb3027c093e1fb683e41c5768ee2eb7840d84","observation_id":"7211ba1e-b4a0-4685-a364-5a41d4d7f005","resolution":{"observed_at":"2026-08-06T15:01:18.432974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.405953Z","title":"Xu, Uri Alon, and Graham Neubig","venue":null,"work_id":"a8df6aa7-fcd2-4244-83be-31a4150b033d","year":2023},"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":58,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.544438Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:d5c8fc3c89cd29d1133e2c96e2b0299ecae1860b8a89006cacbe43a47d5714a4","observation_id":"2979c74c-3829-4b6a-b4e4-b32746853413","resolution":{"observed_at":"2026-08-06T15:01:18.412483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:17.551973Z","title":"Proxima: Near-storage Acceleration for Graph-based Approximate Nearest Neighbor Search in 3D NAND.arXiv:2312.04257, 2023","venue":null,"work_id":null,"year":2023},"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":59,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.551973Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:5a8384a5373e8b9f36b2153edab36106100001db9d8f21f58784aef493857652","observation_id":"5feb2eff-09a7-408c-b1f1-26f94b03d815","resolution":{"observed_at":"2026-08-06T15:01:17.551973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10839","last_updated":"2022-06-22T04:35:57Z","snapshot_observed_at":"2026-07-06T13:23:21.926490Z","submitted_at":"2022-06-22T04:35:57Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2206.10839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.10839","snapshot_observed_at":"2026-08-06T15:01:17.715010Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","venue":"cs.IR","work_id":"879210b8-1139-463d-9461-36e8ed629954","year":2022},"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":60,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.558305Z"},"links":{"cited_paper":"/paper/2206.10839","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:3942728424507f3b296e8ca4da5cb4aecd1986665025b8ffc6e68f794523ff05","observation_id":"01a84044-6861-4450-b848-068890ac93de","resolution":{"observed_at":"2026-08-06T15:01:17.721984Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03940","last_updated":"2025-06-03T15:39:34Z","snapshot_observed_at":"2026-07-06T16:58:03.812619Z","submitted_at":"2023-12-06T22:43:50Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":"2312.03940","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.03940","snapshot_observed_at":"2026-08-06T15:01:17.682155Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","venue":"cs.DS","work_id":"13b6fa1e-a14d-417a-9de4-4cf4b030abac","year":2023},"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":61,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.566867Z"},"links":{"cited_paper":"/paper/2312.03940","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e64cf4f0e775f2c18d230403652e0e6c893a198002fb118f8e13e88d74220df4","observation_id":"aa74c2d3-c08a-4bba-951f-0332d12339e8","resolution":{"observed_at":"2026-08-06T15:01:17.692382Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.375112Z","title":"Gpu-accelerated proximity graph approximate nearest neighbor search and construc- tion","venue":null,"work_id":"f3e5f150-a56a-4b11-8071-f088e92f081a","year":2022},"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":62,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.574063Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:34fe9c155f1bbd60669da2f028f7031f76e508e4309d20e316e6de63ac545ca7","observation_id":"16253bb8-3137-4322-8b45-2558c30e3491","resolution":{"observed_at":"2026-08-06T15:01:18.389078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.344627Z","title":"DF-GAS: a Distributed FPGA-as-a-Service Architecture towards Billion-Scale Graph-based Approximate Nearest Neigh- bor Search","venue":null,"work_id":"679f8455-b10a-46bf-a9f5-7c784a3154ce","year":2023},"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":63,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.581144Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:2539833cd6e0aee6ca719a7d13804b9aa30a3e1a2070d286e4588799ef0cede9","observation_id":"c1044bc3-9b01-4e88-b50c-84f56dde7221","resolution":{"observed_at":"2026-08-06T15:01:18.350267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.322272Z","title":"Grasp: Optimizing graph-based nearest neighbor search with subgraph sampling and pruning","venue":null,"work_id":"c8b06bd0-ca73-4a78-a575-74c7b715e42c","year":2022},"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":64,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.586627Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:71c3b511d303dc3335413e34549be2dc45896b1b9ba9e69ebf04312f405a6398","observation_id":"ba31f62e-785a-4afb-ad22-12f4cd2ad1d7","resolution":{"observed_at":"2026-08-06T15:01:18.328548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.293180Z","title":"SONG: Ap- proximate Nearest Neighbor Search on GPU","venue":null,"work_id":"b35979c9-1d6a-4022-ada4-6d9ce7d46df1","year":2020},"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":65,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.593261Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:1c5f0304a097e8eb2758c47e00fbe65b509cb975dcb00da6294eb43c68adb024","observation_id":"05479436-3816-4e2d-bf3f-9f1953f4f228","resolution":{"observed_at":"2026-08-06T15:01:18.305572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.273672Z","title":"Guitar: Gradient pruning toward fast neural ranking","venue":null,"work_id":"b7429636-6c14-44d6-b406-2164112d955b","year":2024},"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":66,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.600903Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:2c4cad0a7fa0fc2d1b3b39accb8c18da0de13859a390c26af147c5247ad6d665","observation_id":"f6a171c0-24e7-4194-bf63-b10efa85b73c","resolution":{"observed_at":"2026-08-06T15:01:18.279172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:01:18.246581Z","title":"Processing-in- hierarchical-memory architecture for billion-scale ap- proximate nearest neighbor search","venue":null,"work_id":"e471ea9d-6f9d-4522-9627-e155b6934d49","year":2023},"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":67,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.606605Z"},"links":{"citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:669fed659cd98d493de173dd874f4b9f8b6e978004ed13d0819737c017e7f975","observation_id":"ccce054d-b593-45e1-87b6-86192d8208f8","resolution":{"observed_at":"2026-08-06T15:01:18.255875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.17094","last_updated":"2025-07-23T00:19:27Z","latest_version":1,"primary_category":"cs.DC","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"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":2,"verified_fuzzy":49},"total_outbound_references":67},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2507.17094."}