{"as_of":"2026-08-13T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da29de6bd7f479009de2fe4ad5c4f3e6572f6a7c959787bb5b7cc333b08acf8a","coverage":[{"denominator":78,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":78,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:38:30.071536Z","state":"measured"},{"denominator":78,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":78,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.17582/citation-record","integrity":"/paper/2607.17582/integrity","json":"/paper/2607.17582/citation-record.json","paper":"/paper/2607.17582"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.189329Z","title":"Hnswlib - fast approximate nearest neighbor search","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.189329Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:aefcf122763acda9bfed2053895df08d4c351403415e91ce90c8800abbaa9960","observation_id":"c42b9f91-c669-4626-87f7-409ff6fdb02a","resolution":{"observed_at":"2026-08-01T17:38:24.189329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.235111Z","title":"Apache Lucene","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.235111Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:d1c08836321d61af0e5ca799c26d59f01b735392c7b91a70d7a1cdf5bf00ec91","observation_id":"b54e75cb-5536-49fd-bca4-396e42c23b17","resolution":{"observed_at":"2026-08-01T17:38:24.235111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.316331Z","title":"Microsoft Bing Search Engine","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.316331Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:add7c784177843a87d54807b6b4e4840d1a8fabeba25e547d818c701e0168cf0","observation_id":"5aec96b1-a17c-484d-878f-9d27b1d01eb6","resolution":{"observed_at":"2026-08-01T17:38:24.316331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.395590Z","title":"Pinecone: Vector Database for Vector Search","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.395590Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:2badddda2480d7b3d45ea3b694f02f949015b0e10b8ba9f92b98b3f96e7ce973","observation_id":"71800558-011b-4220-878a-64247752bd7d","resolution":{"observed_at":"2026-08-01T17:38:24.395590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.448462Z","title":"Weaviate: The AI Native Vector Database","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.448462Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:3b9ff28d2aaba76e6c9d74a398d1833c5290ed44d210c48196aad894f50bfc73","observation_id":"11ebfc4e-d633-4020-9547-df73251d170b","resolution":{"observed_at":"2026-08-01T17:38:24.448462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.521510Z","title":"ANNlib: A Development Framework for Efficient Approx- imate Nearest Neighbor Search","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.521510Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:0fcf4fcdbf91258d2aa5d5fe22d78b7a1e67dc1d4e3a3e57dc8fb0239ffafac1","observation_id":"d893c2da-2b18-4107-bd6a-5f8b10a0a618","resolution":{"observed_at":"2026-08-01T17:38:24.521510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.598458Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.598458Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:b6bf50acef322c3e2f359930ce1aa062b6feb214f7492a0076f837a377ad02b3","observation_id":"26171870-6d1c-47da-9cca-c57605125225","resolution":{"observed_at":"2026-08-01T17:38:24.598458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.650685Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.650685Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:9fac25a8147c43f71be75a6a662566078ffa06ccb910b224769284fc7d088707","observation_id":"1bf3e6e2-18d6-4fd2-94c9-9da1fb1ee7cf","resolution":{"observed_at":"2026-08-01T17:38:24.650685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.734208Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.734208Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:07710fa2495d1ac20145f4598f6056e3e6266061f9466e741ef93a878a6b78cc","observation_id":"4fd4029f-34f9-404d-81a9-76c7edd97465","resolution":{"observed_at":"2026-08-01T17:38:24.734208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.792073Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.792073Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:b8c2ce0dd343a89a6c9dfe020ff1169ad58422c8c29f5a8b08fa55ff856f9e66","observation_id":"3b5070b7-f6cb-4233-a361-d4c62b6841cd","resolution":{"observed_at":"2026-08-01T17:38:24.792073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.845590Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.845590Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:0b56f0fa98a389ef6a54283474959696b57c62526fad23c574efcdac3274f161","observation_id":"5b95606e-b408-4484-a07f-4cb782f3252a","resolution":{"observed_at":"2026-08-01T17:38:24.845590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.903883Z","title":"Blelloch, Daniel Anderson, and Laxman Dhulipala","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.903883Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:b83ac825a18c8d587d0255dd46670fb98738dc649460dfec53bb29fa4067f4aa","observation_id":"1af6948c-cdc2-435a-8a0c-c2afc4977b2a","resolution":{"observed_at":"2026-08-01T17:38:24.903883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:24.980400Z","title":"Blelloch and Magdalen Dobson","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:24.980400Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:c52aa9fdda802e545f2a5da4958cd214a7755d697313b252be66f99adc7707dd","observation_id":"f78c2754-3a1a-4b04-a1a2-89f148b3336c","resolution":{"observed_at":"2026-08-01T17:38:24.980400Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.036950Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.036950Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:2ef2bb3df9c9799faf48a202273f068e5a7bddeaf46106a02c596542a4eed379","observation_id":"f045b8f1-9d7f-473d-bd1a-31f68fd5cea9","resolution":{"observed_at":"2026-08-01T17:38:25.036950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.109363Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.109363Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:ddcb9ea9988b106203859466e3dbdd50fef9df7b93e92bee585ba3403a6eb0cb","observation_id":"8ef64ff1-07aa-40f9-b419-bbfe656047ce","resolution":{"observed_at":"2026-08-01T17:38:25.109363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.187900Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.187900Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:e1876ba9095bbf46f96c50f3eb97f26efa51aed3ec8d9e49c00039c19199aa26","observation_id":"09ade7a6-cbd6-4fdf-a8ae-389b14dcec89","resolution":{"observed_at":"2026-08-01T17:38:25.187900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.244470Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.244470Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:2042923d9cdff67950a53fa10b0ce8bba0fc57e537374fc1d42aaa153fe2722d","observation_id":"5924304e-4185-4012-8034-7d86563379c4","resolution":{"observed_at":"2026-08-01T17:38:25.244470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.309500Z","title":"2018.SPTAG: A library for fast approximate nearest neigh- bor search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.309500Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:95b01b1bbb2e2cfa6acf9bb84407f5c3409ba09d1530059950e96789d83f5ed3","observation_id":"ca6cfd40-c3b4-47fd-be89-9abd34fa4151","resolution":{"observed_at":"2026-08-01T17:38:25.309500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.386042Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.386042Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:3f3a09e6b4c66658fe70588eac845e0a82016a5c0ff12ab225734774ca866cd0","observation_id":"3590d486-702b-4b44-a87f-0c5238435c8f","resolution":{"observed_at":"2026-08-01T17:38:25.386042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.459697Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.459697Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:0021d40572ed059b2cb9f720b37aa05c002727058c88b3e66b95ee99ecfccbc3","observation_id":"96004aa9-a34b-41fa-ad61-0d2a7e11265e","resolution":{"observed_at":"2026-08-01T17:38:25.459697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.513772Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.513772Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:d1f73146de5f4f633c5a7dc305d2e3dc5d73c59002c93fd8736bdcf473e07012","observation_id":"2df0e3ea-3697-41d6-961a-c255aae844b5","resolution":{"observed_at":"2026-08-01T17:38:25.513772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.578425Z","title":"Blelloch, Yan Gu, and Yihan Sun","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.578425Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:be907fafc760df20565494f2eabe3649e78b3363fc2c8b66ee6d4771ae81b50b","observation_id":"724790e9-4576-4d77-90df-e3b855a543ac","resolution":{"observed_at":"2026-08-01T17:38:25.578425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.652838Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.652838Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:3ee8dd74e99cd0af542e6f504fe39ebee3eb6e378d1de226534f79997830743e","observation_id":"ab354e26-5d67-4929-9561-2056ddd6de73","resolution":{"observed_at":"2026-08-01T17:38:25.652838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.836517Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.836517Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:026fc75ef9bec6d2c812bc78e955d767917a44c9d9368e9d2e9e5f5252e865b4","observation_id":"b28e683e-2f1c-409c-ac99-fad8bc48bae8","resolution":{"observed_at":"2026-08-01T17:38:25.836517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T17:38:25.900986Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.900986Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:ad29f6b3829ca8d2722572b44fbc833159c4f08ebf50801931ad87e8b64517d8","observation_id":"532b439c-3778-44bc-9e97-4a5c55c0c5fc","resolution":{"observed_at":"2026-08-01T17:38:25.900986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.979080Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.979080Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:69ede23266cd7ba1dd14a482e4b96b748a9854b74b511f1b9a1cecd5acffaf82","observation_id":"1e8c281a-c67b-42ff-9e47-c819785c5a71","resolution":{"observed_at":"2026-08-01T17:38:25.979080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","snapshot_observed_at":"2026-08-13T04:28:57.364746Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00943","snapshot_observed_at":"2026-08-01T17:38:26.087240Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.087240Z"},"links":{"cited_paper":"/paper/2402.00943","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:f7ef9364e19aad2366b064f55273fa704f7862dc3d7c14c848ad233a56947bf9","observation_id":"c0eb75bf-82be-49d1-a8d6-a6eb1d718676","resolution":{"observed_at":"2026-08-01T17:38:26.087240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.170709Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.170709Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:38fd251e71a4266dfdfc4df9ace754f3aaedbbddc7c645111f631236fc48f00a","observation_id":"d043d83f-8509-4331-a1ed-1f89dc434c03","resolution":{"observed_at":"2026-08-01T17:38:26.170709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.251740Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.251740Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:60f69041405bf0518e0b89763a1bbc8fdd22be037d5aa052360a24d79da53771","observation_id":"83d0ba74-7b94-40e7-93e3-1deb60c4f5cc","resolution":{"observed_at":"2026-08-01T17:38:26.251740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.309906Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.309906Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:493976c6259f38d39fa95eaaf0e2c55d00c74a7a49a0849aac2c2ef01194d7e8","observation_id":"7faddec2-4fe6-458d-af97-9bb4c9194adb","resolution":{"observed_at":"2026-08-01T17:38:26.309906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.394526Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.394526Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:999db6985064973a2df425badedb141bd91c0fd07a635fefaa4b1beb135eb9b1","observation_id":"ce581f28-c17b-460b-a380-97f92af4be18","resolution":{"observed_at":"2026-08-01T17:38:26.394526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.457973Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.457973Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:6ee010e9e37bb025afe31bccf6d07cad8f83aa54c751bc1d53a557847318b6c5","observation_id":"bbe6ef92-eedb-45ce-98e5-0b5d60b687a2","resolution":{"observed_at":"2026-08-01T17:38:26.457973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12850","last_updated":"2022-11-30T11:14:07Z","snapshot_observed_at":"2026-08-13T13:59:03.792159Z","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-01T17:38:26.526668Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.526668Z"},"links":{"cited_paper":"/paper/2211.12850","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:e8b26bda021bbd27f5ef2f3a1e89d2bc8d1123a21e51b76ace8566f136f6a1d3","observation_id":"f88d7579-4120-4d1d-933a-5cead635c07f","resolution":{"observed_at":"2026-08-01T17:38:26.526668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.579513Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.579513Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:1b69a5c35ceaa8bd38caf6aeef4a4d985dc1fb4836edb532c59ac57e4e33a6e6","observation_id":"fea2005c-998a-4a94-a9d0-f780ea7c046f","resolution":{"observed_at":"2026-08-01T17:38:26.579513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.677503Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.677503Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:1e305cde9a370e606876edbf719c07c09ded7d4e1232a726800d0de69e07c0b2","observation_id":"6a6d8e7e-6f1c-4b14-b457-fd23b5ea7a39","resolution":{"observed_at":"2026-08-01T17:38:26.677503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.774735Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.774735Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:49905cd2de67b9beb7ad16668b8c59fa75c71ec56108c088d00b862f94507543","observation_id":"343833d2-7186-41f9-8602-3e6f9961f4ce","resolution":{"observed_at":"2026-08-01T17:38:26.774735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:26.886238Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.886238Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:0a03ebd39c05de5c6c0c3e66021d0d2d248907e2e696b29a65739d85bca82bc0","observation_id":"3b2fbab9-d690-4849-b28a-5ce398fc646e","resolution":{"observed_at":"2026-08-01T17:38:26.886238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06501","last_updated":"2025-05-10T04:02:14Z","snapshot_observed_at":"2026-08-09T11:58:46.446536Z","submitted_at":"2025-05-10T04:02:14Z","title":"Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06501","snapshot_observed_at":"2026-08-01T17:38:26.994206Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.994206Z"},"links":{"cited_paper":"/paper/2505.06501","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:08ce98f87e5a87468263ee9ad4fe53a21e770e2f914543daa2a979c624ac3a56","observation_id":"9a34a3a4-136f-45a2-82d0-40cfbd150bf7","resolution":{"observed_at":"2026-08-01T17:38:26.994206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.096508Z","title":"Malkov and Dmitry A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.096508Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:350bae3e89e7537a80017711ea0629276ba26d8eeccb890045fdff3c48a48dc5","observation_id":"1b891e68-793b-4b41-8738-de8c0b9bd9e1","resolution":{"observed_at":"2026-08-01T17:38:27.096508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.174279Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.174279Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:3ab43b8afff15d7efbca2993fe517a21a91c4dfed433f287698875202f8e31e6","observation_id":"4c3757a7-06da-4457-b437-3980d6a094f1","resolution":{"observed_at":"2026-08-01T17:38:27.174279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.349034Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.349034Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:44979245f5af75b40e9ce626b70d67f31e1bffd917fb5469fa878cded4c88540","observation_id":"5a6ea6c6-74e0-434a-b764-c898e772740c","resolution":{"observed_at":"2026-08-01T17:38:27.349034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.462200Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.462200Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:9d689f690bb6390c9eaf0e1d11673d2465d30127a2d92c345a29636ef6b4d772","observation_id":"a03c39ad-7a3d-41b4-9344-f48e57395722","resolution":{"observed_at":"2026-08-01T17:38:27.462200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.556028Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.556028Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:accdebeef7b99710abe768caedc289c661f00cf8a08486fba9b99b80f6da3564","observation_id":"cf649c00-23f3-4794-ba6f-552b19c41a34","resolution":{"observed_at":"2026-08-01T17:38:27.556028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10005","last_updated":"2022-01-24T23:36:20Z","snapshot_observed_at":"2026-07-06T12:30:51.934079Z","submitted_at":"2022-01-24T23:36:20Z","title":"Text and Code Embeddings by Contrastive Pre-Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10005","snapshot_observed_at":"2026-08-01T17:38:27.625029Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.625029Z"},"links":{"cited_paper":"/paper/2201.10005","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:edc84513925089818533df02b5ae3918c35d22e9e082f5fd62bff04abcc0d348","observation_id":"4ac5cf49-e02f-493f-aa4c-035cbc7711a9","resolution":{"observed_at":"2026-08-01T17:38:27.625029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.722924Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.722924Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:5e81e71721bf4e3b71f0fab6d0353eb77bce2ce8db1711e978bf9393c040a82b","observation_id":"89d4dc09-ea33-4dce-ad3f-845b723ba6ad","resolution":{"observed_at":"2026-08-01T17:38:27.722924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.823544Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.823544Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:8bdbcccffaeff5a182430efefe17c8db50b003105644c690bc7a106479861aa3","observation_id":"572b060a-b97a-4847-a5b4-d4d6e8ae0c61","resolution":{"observed_at":"2026-08-01T17:38:27.823544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01382","last_updated":"2022-10-22T08:45:28Z","snapshot_observed_at":"2026-08-13T15:30:46.368281Z","submitted_at":"2022-06-03T04:02:02Z","title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":"2206.01382","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.01382","snapshot_observed_at":"2026-08-01T17:43:34.394690Z","title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","venue":"cs.DS","work_id":"b81f6ab4-56d3-4082-83c2-9bbc4dc092e1","year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.970225Z"},"links":{"cited_paper":"/paper/2206.01382","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:cb3469945dcc88c0f3983c0ff9860e922b3d92003ddab8b4454db1e92de0a82c","observation_id":"4c1897bf-50ba-42d9-bdd8-0300b408a0ab","resolution":{"observed_at":"2026-08-01T17:43:34.399829Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-01T17:38:28.072184Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.072184Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:7e21c8b4b17bf594972732804915ff1ecc8ac9803e0a43610d1c24a582c19f31","observation_id":"b6c5a0aa-ae81-4c24-bb69-ed1a3f0ec846","resolution":{"observed_at":"2026-08-01T17:38:28.072184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.909926Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.909926Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:c6d04c383fd944eec1cf39d305a5046a2539090302db442e56853971d15e42df","observation_id":"95d6fbbf-f5d3-4f2b-ab51-ec100f2cea73","resolution":{"observed_at":"2026-08-01T17:38:27.909926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.227498Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.227498Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:951277d95a43795589b13a7d3583d745b0714abb153227dc7fd4ca2aa78b88de","observation_id":"5665c3af-ea69-4b4a-aacb-b7e5b4a38a8d","resolution":{"observed_at":"2026-08-01T17:38:28.227498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.313803Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.313803Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:0a1a21d01f70775a334a118e9e3387a7ccf06580719d509d5f405ed487c96325","observation_id":"746cade1-83cd-4f28-9ec1-1dca962bda02","resolution":{"observed_at":"2026-08-01T17:38:28.313803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.146191Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.146191Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:59cc40f915a95a941a4c9deaae1f5573765843af9238fbca4c59cafe266fcbff","observation_id":"51584df4-cf19-4dee-a65d-c7ba871f8743","resolution":{"observed_at":"2026-08-01T17:38:28.146191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-10T18:40:28.900730Z","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-01T17:38:28.531711Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.531711Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:d271a4d6dd8b9b7193ce824c3921db8ec97cbe8a8a8d02a9b850bfa5fa0e5cb0","observation_id":"f570ae48-6278-40c3-8028-444e290e600f","resolution":{"observed_at":"2026-08-01T17:38:28.531711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.591352Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.591352Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:bf44f4b1250c6bca6a2f631132d1a1a6471b23bb58f254cd6ba121aad411d1ff","observation_id":"eda3b3b3-6ee3-4835-ba09-e9eeb33e639b","resolution":{"observed_at":"2026-08-01T17:38:28.591352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17424","last_updated":"2024-09-25T23:24:56Z","snapshot_observed_at":"2026-08-12T22:37:20.843102Z","submitted_at":"2024-09-25T23:24:56Z","title":"Results of the Big ANN: NeurIPS'23 competition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17424","snapshot_observed_at":"2026-08-01T17:38:28.406668Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.406668Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:88ca99511bd71d9834d0a12359515b5c12cb4a2e7cef7153c33ec37014b42b6e","observation_id":"f017fb1b-75b0-4d22-b00a-aa5e30f65273","resolution":{"observed_at":"2026-08-01T17:38:28.406668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.478456Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.478456Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:c5723db56364b8c126600c934e3efab8324f0b819fad19188d3dd26d5fe4d125","observation_id":"e0fd22fa-35a5-4b77-be9a-bb69684cb4ca","resolution":{"observed_at":"2026-08-01T17:38:28.478456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.887371Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.887371Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:24dc079fbd5f3370be2b66477531899675bd951cd9f2477d2681af9c68b25805","observation_id":"2c56757b-29a3-434b-8176-1756ffe9602c","resolution":{"observed_at":"2026-08-01T17:38:28.887371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.967946Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.967946Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:41fed5c5888b66c773e0b9015b8ad54986eb9f52602e1175e411aa73400d1384","observation_id":"55ec4d22-3caf-41a8-ac01-dcf6cafc8da9","resolution":{"observed_at":"2026-08-01T17:38:28.967946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.647376Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.647376Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:c3b2ad78716106668c13533b10b63c17c48ae2a51694cc9a23656ffb79f85a1e","observation_id":"d9b64e1d-6794-4cc7-bd5b-be5f78429d8f","resolution":{"observed_at":"2026-08-01T17:38:28.647376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.230753Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.230753Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:a20696c39df8e13cddd4d9e337920d59d20f058aee380e876dc02f48303b0895","observation_id":"198d1761-df94-4e46-8434-086beb9c7114","resolution":{"observed_at":"2026-08-01T17:38:29.230753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.790439Z","title":"Blelloch","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.790439Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:60431b614e9db06cd58da99ba131b0c1be47382fe1f0031e8a5c8eef2ce9fc69","observation_id":"0ec7cd09-f6cc-4b8c-a2ba-2c7e6f325ac7","resolution":{"observed_at":"2026-08-01T17:38:28.790439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.377355Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.377355Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:196e2202d80892a3df4ac8d6606e1a00cc7215a1dd94fbcd8c53e91c8186d294","observation_id":"171692f7-19ff-482b-9fd2-d6df3af5079a","resolution":{"observed_at":"2026-08-01T17:38:29.377355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00812","last_updated":"2025-06-01T03:27:52Z","snapshot_observed_at":"2026-08-12T13:19:39.648438Z","submitted_at":"2025-06-01T03:27:52Z","title":"VecFlow: A High-Performance Vector Data Management System for Filtered-Search on GPUs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.00812","snapshot_observed_at":"2026-08-01T17:38:29.448634Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.448634Z"},"links":{"cited_paper":"/paper/2506.00812","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:5c7ebef7842c7ff6761570fe015789df110dbcf84205d7f8d5bd2eef5b71532b","observation_id":"679c3fe0-5f16-4627-badb-ef9174c98903","resolution":{"observed_at":"2026-08-01T17:38:29.448634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.051870Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.051870Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:82a38d778e7a31d734f0dc8bc29539916000fa78e2343d2f23efc3c63aad6bf0","observation_id":"61ec858b-3596-4240-af1d-8884bf7b7db0","resolution":{"observed_at":"2026-08-01T17:38:29.051870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.627407Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.627407Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:6a50b5b79afe78fdabec604a02078064fd8c58792c192540d5bda43e1131267d","observation_id":"88028518-39af-4c30-9395-f4ccdeb78133","resolution":{"observed_at":"2026-08-01T17:38:29.627407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.736743Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.736743Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:e079b6cce1b7de2e65b838ec5f4a4898f88b795afde5bc48887bb257dbe8830d","observation_id":"8b8c784a-92a3-4e6b-b078-0cfe682dc633","resolution":{"observed_at":"2026-08-01T17:38:29.736743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.304310Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.304310Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:30f62d286c561474fb9ecf830466385b4e5d4b8708a56c4d467f28752b87a73b","observation_id":"0fbdbbcb-8912-4bb8-82b9-753783aa25e5","resolution":{"observed_at":"2026-08-01T17:38:29.304310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.887248Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.887248Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:54c6ea76a5f4f4970b3bbae8fe47364c530381a1754744edc1853e6f7c281c6a","observation_id":"a935e383-72b1-4e49-aa52-68f56a1fac57","resolution":{"observed_at":"2026-08-01T17:38:29.887248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.967054Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.967054Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:8241c14d58df4ac73c367e91d059112a4727e245a2e3e4cb2813a4ffccdfb035","observation_id":"392c1a4a-094f-479b-9fd8-872a80d32761","resolution":{"observed_at":"2026-08-01T17:38:29.967054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.534346Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.534346Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:a011a1f621a798c7a99c4025b87e4fd595bcfa52cef40de6aab1f4c5e8db8040","observation_id":"85c25db4-1cb8-40f2-b68e-7c12f4281c39","resolution":{"observed_at":"2026-08-01T17:38:29.534346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:30.071536Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:30.071536Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:41aeea514fd610384c18ece448078508e099e637f85a5c0833a5b7d26c9af863","observation_id":"65c47cb2-0e6d-477d-832d-b049f64743dc","resolution":{"observed_at":"2026-08-01T17:38:30.071536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.805400Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.805400Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:eece1a4614130d12433f87281a03a725ed0c8871959c1ecbd038f93b1fa4b9f7","observation_id":"dfa9cd6a-523f-4d3c-9086-d4bd4c2f9340","resolution":{"observed_at":"2026-08-01T17:38:29.805400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:30.020956Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:30.020956Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:bb317baaf7cecdc9bfbc46e237b4729fe28c7d5d050ee18e49310e68252c7e54","observation_id":"bcbc0489-c217-4b4d-a098-f4a3493de76a","resolution":{"observed_at":"2026-08-01T17:38:30.020956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:25.775478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":934,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:25.775478Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:f39648f4ad96e33aedfb7a923618c08e700b6ec9adf715e61f56c32e521d0075","observation_id":"7e0eeb2a-8f36-4ce8-8a82-0ba00dee3c55","resolution":{"observed_at":"2026-08-01T17:38:25.775478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.134629Z","title":"ACM59, 2 (2016), 64–73","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.134629Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:98310fe1a37d3b54d30da2da26462a1ac590005407f1e8f137b923486932f23a","observation_id":"42947622-0cab-4548-b83c-7b7840868fc3","resolution":{"observed_at":"2026-08-01T17:38:29.134629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:28.718384Z","title":"InAnnual Conference on Neural Infor- mation Processing Systems (NeurIPS)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:28.718384Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:30db2f1c166ccb08c4b644ca0474251583cb12cfb7c9b24548173a09c2455920","observation_id":"261f4bd4-59b1-4eda-826b-1cf75443014a","resolution":{"observed_at":"2026-08-01T17:38:28.718384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:29.676776Z","title":"InProceedings of the 29th Symposium on Operating Systems Principles","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:29.676776Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:d8a4966b568a22b063cc8c0e35b2b367b5f11b7eeab25a176a9111bca5f4fbaa","observation_id":"7982f779-75ec-4ec0-8ea7-7bafd4e446ea","resolution":{"observed_at":"2026-08-01T17:38:29.676776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:38:27.269177Z","title":"In Proceedings of the 29th ACM SIGPLAN Annual Symposium on Prin- ciples and Practice of Parallel Programming (PPoPP ’24)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:27.269177Z"},"links":{"citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:90ee23bdc230b761565eae0dd440a651b5ee0d81db122b236bcdd20813c4d687","observation_id":"e1301418-e8fd-4c32-b8e3-55e7a8cb8bf9","resolution":{"observed_at":"2026-08-01T17:38:27.269177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":78,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":76,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":78},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 78 of 78 outbound references and 0 inbound Pith citation observations for arXiv:2607.17582."}