{"as_of":"2026-08-14T16:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e330a14fc261608bf4af97041d37b0e22042d9eeed7e1336043fafaa33654c9c","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T15:30:03.463197Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2606.19898/citation-record","integrity":"/paper/2606.19898/integrity","json":"/paper/2606.19898/citation-record.json","paper":"/paper/2606.19898"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3258.27834","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T05:49:36.941305Z","title":"Houle, Ken-ichi Kawarabayashi, and Michael Nett","venue":null,"work_id":"539c3b98-9fe5-4d6d-9b79-dc98c7680dcb","year":2015},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:575e9dd2743e5721d252bd802ebe46801d356a3454f751527891d48108828fef","observation_id":"92e28d9f-43d5-44f6-9ce7-a326f28de01a","resolution":{"observed_at":"2026-07-04T05:49:36.943219Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.is.2019.02.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2020 , pages =","venue":"Information Systems","work_id":"d21addbf-2773-4624-9c69-6171bf0c712b","year":2020},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:1679683d71776ffff12620026232f83c5347acf62ed594287900af89107cf74f","observation_id":"395b8e6c-549e-4fd0-9adc-29439d2c39d4","resolution":{"observed_at":"2026-06-26T15:39:33.962848Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:50:24.867153+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:50:24.867153+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:60e7e261f7c8ffdadc8198cc80a1275060390a49d9487a11c6cc9be7d4e7bb92","observation_id":"2267aef3-79b3-4c56-84aa-f14da112477d","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3698822","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Navigating labels and vectors: A unified approach to filtered approximate nearest neighbor search,","venue":"Proceedings of the ACM on Management of Data","work_id":"1fecd9a5-7d48-421d-8f2d-53718989f48e","year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:006c31fc3196a444e16a5e395c9da5149eb23db64214dc0565c4dae98db638a2","observation_id":"cc49f4ac-b66b-4e5c-872d-b1f31747f743","resolution":{"observed_at":"2026-06-26T15:39:33.958038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-23T04:23:52.930587+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T04:23:52.930587+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.12980","doi":"10.48550/arxiv.2512.12980","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"8d22c3b4-45fd-4337-a033-a535b613ae2c","year":2026},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:df5fb7d433c19dab58d442c9a09c0f03ac7d3860c1047e3357e012899798fe5a","observation_id":"3a0f5ed6-7655-4f48-93e2-ffda04ad7266","resolution":{"observed_at":"2026-07-04T05:49:36.939557Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:a30285116a795e386150f6e7e47597b16dfbf245d143c38aec29349dabd523a3","observation_id":"f397bec1-16eb-44f1-b683-2e656dd1ab54","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":"InProceedings of the 41st International Conference on Machine Learning (ICML)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:842cb533cdb284d5fe4b40fcb757ce97ff2b3e2b03ec92ddac7984411e58bc32","observation_id":"bec55b71-0875-4065-99ec-8bb5c6bab0c9","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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":"2602.17914","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T05:49:36.927079Z","title":null,"venue":null,"work_id":"87892228-c289-46b5-8900-da2335cbe6ea","year":2026},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:34fe6a5920fafa4b45a2f6192ba8de2a3867d1c2bba2aa9eb325bc63bde167e8","observation_id":"db874677-3f5d-4daa-9b5e-710d18d1c8c0","resolution":{"observed_at":"2026-07-04T05:49:36.929051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3507.358355","doi":"10.1145/3543507.3583552","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters","venue":null,"work_id":"1561b266-1809-4d0e-93e3-cc8c53706537","year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:f41b76f22198e2052791e7cc5889199740cc4f3f5b66dcd11693b85ee1313186","observation_id":"ba46e699-935c-4529-8fab-525951147228","resolution":{"observed_at":"2026-06-26T15:39:33.963239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-23T04:23:54.289733+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T04:23:54.289733+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-13T10:25:18.093063Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:c9eb8edea042a23c46c4c89323cccd02cbe210a18edbfa0541425184f2e6ab77","observation_id":"a885f0d1-757c-459c-b6c0-a759cf69b4eb","resolution":{"observed_at":"2026-07-04T05:49:36.914476Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:3f840261fe8be46026d5e0c8bef2d5dfd65a0add0cb397faada3fa316486704b","observation_id":"d5504bc9-89ed-4491-b748-3e495565b428","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:6e10e799198b1ff296e050f29e2b7fdd52ab1521798131846ad13f7fb3bfa053","observation_id":"3b26d558-d440-4db5-bd47-c5f6dc0ef298","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:7eee4fdda4cb0a3e2e7362228433ba58c8b61690ace29a4ccdc07752aa3749a2","observation_id":"6a34a4d8-0748-4813-9a3a-040d447981ce","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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":"7755.371777","doi":"10.14778/3717755.3717770","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Unify: Unified index for range filtered approximate nearest neighbors search,","venue":"Proceedings of the VLDB Endowment","work_id":"722b1f0a-9f0c-436d-85b5-3885b0e5f967","year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:7b2cc1aaf4aa0a0b4e76b0c44624dbe2a354d17958bf013a71995fb2bdc820e3","observation_id":"268031aa-30e7-4fa1-817b-b1d1cce6ede5","resolution":{"observed_at":"2026-06-26T15:39:33.978611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-23T04:23:56.658858+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T04:23:56.658858+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06501","last_updated":"2025-05-10T04:02:14Z","snapshot_observed_at":"2026-08-14T14:09:56.073829Z","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":"2505.06501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.06501","snapshot_observed_at":"2026-07-04T05:49:36.930551Z","title":"Sean Wang","venue":null,"work_id":"c5f54fb8-d310-462a-bd8b-f5664bf9ec3b","year":2025},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2505.06501","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:45a8ff912e5541f032c71da882be4b209b2be70a1220d4fdd8a751c7831b56c2","observation_id":"a184b5db-5724-42c3-af22-b044324ac021","resolution":{"observed_at":"2026-07-04T05:49:36.932268Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.09320","last_updated":"2018-08-14T19:29:07Z","snapshot_observed_at":"2026-07-06T04:51:12.932821Z","submitted_at":"2016-03-30T19:29:44Z","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","version":4},"cited_work":{"arxiv_id":"1603.09320","doi":"10.48550/arxiv.1603.09320","metadata_source":"pith","pith_arxiv_id":"1603.09320","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","venue":"cs.DS","work_id":"dc20b472-9c35-4b91-b0e6-c485ecf016c0","year":2016},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/1603.09320","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:90f69ad9c03bb9beb7e5151c56250d6884845267610cc8dfb1125afdb8994df5","observation_id":"863dca98-b3ec-4112-9ce0-db912e7cb12d","resolution":{"observed_at":"2026-07-04T05:49:36.918474Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04871","last_updated":"2024-03-07T19:45:08Z","snapshot_observed_at":"2026-08-13T00:59:47.030957Z","submitted_at":"2024-03-07T19:45:08Z","title":"ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data","version":1},"cited_work":{"arxiv_id":"2403.04871","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.04871","snapshot_observed_at":"2026-07-04T05:49:36.923514Z","title":null,"venue":null,"work_id":"f7ec37ba-4312-4d27-9663-8f0a867bc73e","year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2403.04871","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:dcb169dd189341b58a8ca2fbe80cf9f9d98f1edf224a3f09e843e97c787c0306","observation_id":"328776a5-4d83-4cd8-a483-43e5bddeb678","resolution":{"observed_at":"2026-07-04T05:49:36.925628Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:5e5d6246b2822b70f1703f6aac63c7743d42791d400b4ade9461b1e2f610c578","observation_id":"27527028-a482-4618-b639-231d2ac43085","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0065-2458(08)60520-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Advances in computers, vol","venue":"Advances in computers","work_id":"f9762036-7c7e-4b95-801b-6dce9492ec21","year":1976},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:08170f5596cf15b47b0c5e15f6aaf8cae6ae592a617f8d8e482c59780aff8c8e","observation_id":"d0e83de4-650d-49f3-8e3e-c3db93e6e4a1","resolution":{"observed_at":"2026-06-26T15:39:33.985616Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-16T21:50:34.735151+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T21:50:34.735151+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-13T05:28:45.073121Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"cited_work":{"arxiv_id":"2509.07789","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.07789","snapshot_observed_at":"2026-07-04T05:49:36.933705Z","title":null,"venue":null,"work_id":"8382310e-c77a-4940-9fad-a461b10d9296","year":2025},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2509.07789","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:c4c2383658e5262c5c64e578db12939564ef1566a71f26bec227041b7f5ab856","observation_id":"8e25002f-44bc-45d6-ae47-19fd6d79ddd2","resolution":{"observed_at":"2026-07-04T05:49:36.935805Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:cd2cb55003d1204b06d98c6426c98ae7993a47e8a3c6d955fe53fb03e25d56e0","observation_id":"0aa25d18-c918-4449-88e2-182ce0528d0e","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":"InProceedings of the NeurIPS 2021 Competitions and Demonstra- tions Track","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:a8770d22a949e74ec8f0bbb731d7ee0e74db5488701300146ce798b52a4f1c2a","observation_id":"e00de880-ba4a-451b-a3ea-1f047eb26ee7","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:f7298e4774a7d4c4f41c5a5fcd7b5c7b1bcb4e866d425bb93740435048f552c4","observation_id":"bf8e27b5-94ff-45e0-9e3b-01c09b80cd16","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":"Shamma, Gerald Friedland, Benjamin Elizalde, Karl Ni, Douglas Poland, Damian Borth, and Li-Jia Li","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:464b25d567e2d410571f5a36b88530de29677c33f857b283dbfb3fb1e74e61bf","observation_id":"ec08dfdd-afc1-46d7-b0d4-aba5da8796fe","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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":"8016.345755","doi":"10.1145/3448016.3457550","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Milvus: A purpose-built vector data management system","venue":null,"work_id":"3420bc48-57e6-45ac-9e7a-08ce61de9cbb","year":2021},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:dfb04db0b8fd1a4435afd5c27d4f1fcedb1b2e056ffc1b403f1aa45436e73cdd","observation_id":"d5bcc2cc-918c-47c7-8b2b-076f268a2131","resolution":{"observed_at":"2026-06-26T15:39:33.982838Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:50:27.745877+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:50:27.745877+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:61d1979189bfce0b0bf55ec5bd2fe96919a45cb5048053f54904bcf9b26f2a76","observation_id":"d3e18559-0955-4137-ad16-64f7cf66e984","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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":"5448.2025","doi":"10.1109/icde65448.2025","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In41st IEEE International Conference on Data Engineering, ICDE 2025, Hong Kong, May 19-23","venue":null,"work_id":"f5c48d9b-b829-45c4-a99d-2c3ce30a9653","year":2025},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:4a04bd72361edd08efff6494cc9dbbfb618131743f2aa343a98fd7a698a83ef8","observation_id":"37065126-ef60-4fe2-bbb9-e339821183fe","resolution":{"observed_at":"2026-06-26T15:39:33.973100Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:2c4f0dbd5c1496a1df4e95978f38688d945e778c7195dfc4c6bd4c874ccf7ce4","observation_id":"39415cef-52c9-4f5b-ab29-111dd88ba36b","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:4dc74f28de9d793b9474f73a9ff8699ca4c1fdff6d4bd7dbd5fb36744c9fa69f","observation_id":"073f7d32-9244-4cb3-a625-9ff78e453c51","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.07940","last_updated":"2022-07-16T13:29:26Z","snapshot_observed_at":"2026-08-14T10:47:47.335812Z","submitted_at":"2022-07-16T13:29:26Z","title":"HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2207.07940","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.07940","snapshot_observed_at":"2026-07-04T05:49:36.920024Z","title":null,"venue":null,"work_id":"def035de-07b2-4b6d-9db3-48f765fc032c","year":2022},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2207.07940","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:a3d6e9adc51dfaef37ac217d9d391daf6afd4cdfae8db5f959d21e6c292987be","observation_id":"94c50f24-1f87-495c-9747-0aa65ff0cd75","resolution":{"observed_at":"2026-07-04T05:49:36.921660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.2490","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Artificial Intelligence Research32, 565–606 (2008).https://doi.org/10.1613/jair.2490","venue":"Journal of Artificial Intelligence Research","work_id":"8764f5b8-9013-4d16-b22a-ad75e5d3f61f","year":2008},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:ff1e3503957cf8882b7218a8e39ee4d2cb893650d69eb118fd518db00599c4e9","observation_id":"45a8783e-dcb4-4a31-bbf4-0d960dfcf833","resolution":{"observed_at":"2026-06-26T15:39:33.980251Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:b7146fd1596f920e063338eacde009ecaae47ff471b1784705372e339322d620","observation_id":"e8bf15c2-29ea-47c2-9baa-0ab1fade4737","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3698814","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"irangegraph: Improvising range-dedicated graphs for range-filtering nearest neighbor search,","venue":"Proceedings of the ACM on Management of Data","work_id":"97b28f01-a5e3-45f9-9588-23e0b88ecc37","year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:1f683a0ebc1fa8ea26ea9ceb5a8ee6e38612c013176113c85c11cdc96d7bcfb5","observation_id":"fada0a74-e4e4-411a-83fd-58a0108311ef","resolution":{"observed_at":"2026-06-26T15:39:33.984590Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-23T04:23:59.926841+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T04:23:59.926841+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3725401","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.1145/3725401","venue":"Proceedings of the ACM on Management of Data","work_id":"81802a07-3826-4b2a-8eeb-3662fa549b27","year":2025},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:f2bc3c0b731a0c1a34304cc554ab627a1e3a3328fa6a098469b2b7bef3b695ac","observation_id":"c22c807c-58ac-4ebf-b77a-7d312b19e907","resolution":{"observed_at":"2026-06-26T15:39:33.981005Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:118ce13099f941194b19885c74b82924394c82668a7025d0c6f50f48f991a935","observation_id":"f00a45cd-7329-4faa-a689-2e884ecb87db","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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-06-26T15:30:03.463197Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:245ec735073d0dca38ca962d640cf7571e01087e21d1b1e0446036739a320d76","observation_id":"9fbe122c-e82d-4c71-ae2f-b0e0cda0e6de","resolution":{"observed_at":"2026-06-26T15:30:03.463197Z","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":"3581.360360","doi":"10.14778/3603581.3603601","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Arkgraph: All-range approximate k-nearest-neighbor graph,","venue":"Proceedings of the VLDB Endowment","work_id":"a889ddce-6675-4580-b1b8-397896f2fb7d","year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:0c58c36a846a7e074cb18bd5f419f7593cbb6806a6f0d739e53eae6adcc5bebb","observation_id":"1ce6dbad-a112-4b00-ab4b-770dd3e650f3","resolution":{"observed_at":"2026-06-26T15:39:33.983742Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3639324","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InProceedings of the ACM on Management of Data (SIGMOD ’24)","venue":"Proceedings of the ACM on Management of Data","work_id":"3618c87d-f9a6-4d82-aaec-4c72e6e923ed","year":2024},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:21a68cefe3f3d06e891360cce1c3e85fa88f173ff3df6377c33532faf16bb8d1","observation_id":"c8f0d565-b852-4a5d-af31-91a2ac75c606","resolution":{"observed_at":"2026-06-26T15:39:33.965514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-23T04:24:01.876947+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T04:24:01.876947+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-13T17:28:03.114739Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":17,"verified_exact":18,"verified_fuzzy":0},"total_outbound_references":38},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2606.19898."}