{"as_of":"2026-08-09T12:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d867529e8589a0dca527e7715bf602a4ccdde8d0f19227115ba0e7cfd4d1612e","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:44:48.426756Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T21:58:58.866193Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T05:49:36.933705Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"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-08T17:49:21.912469Z","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:e9d5c16c5d4b6e67a7b102902908b70387056a0009ad7da6afca832b194f19c7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07789","snapshot_observed_at":"2026-07-31T21:58:58.866193Z","title":"arXiv preprint arXiv:2509.07789 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-03T03:53:23.301758Z","submitted_at":"2026-07-27T08:55:09Z","title":"Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.866193Z"},"links":{"cited_paper":"/paper/2509.07789","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:b24a6190d8d88b45b96456674ecee4d7c9398131ffada829f4d119eda90744c0","observation_id":"bf3de15e-8106-4d22-ac71-f30d038460f7","resolution":{"observed_at":"2026-07-31T21:58:58.866193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.07789/citation-record","integrity":"/paper/2509.07789/integrity","json":"/paper/2509.07789/citation-record.json","paper":"/paper/2509.07789"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.08675","last_updated":"2016-09-27T21:21:49Z","snapshot_observed_at":"2026-08-06T22:24:48.588621Z","submitted_at":"2016-09-27T21:21:49Z","title":"YouTube-8M: A Large-Scale Video Classification Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.08675","snapshot_observed_at":"2026-08-04T21:44:42.780968Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:42.780968Z"},"links":{"cited_paper":"/paper/1609.08675","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:65ec0ee4befdc375b853a63cf58c383ab2e8fb6d729e5dcdfee9d5bdc1c95a40","observation_id":"d0c0c116-7d0f-4be2-8af0-4848fde1a0ab","resolution":{"observed_at":"2026-08-04T21:44:42.780968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:53.924053Z","title":null,"venue":null,"work_id":"75a4090e-8c49-4036-b84f-15656891298a","year":2008},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:42.856902Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:e01f34760428e9c1b87600d6c5c2b56a9c926ee23501fbd7397094acdfdd9c97","observation_id":"5c1f01ad-cbdc-4d67-9d46-bdb93d840821","resolution":{"observed_at":"2026-08-04T21:44:53.999419Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:42.981625Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:42.981625Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:8a4b8eed1b43f0d262bce2541316b8fbc17ab10a875ab59fefa15f22a87236c7","observation_id":"6ab157c6-f90b-4537-b732-0a8624651624","resolution":{"observed_at":"2026-08-04T21:44:42.981625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03221","last_updated":"2021-04-07T16:18:15Z","snapshot_observed_at":"2026-08-08T03:23:23.602411Z","submitted_at":"2021-04-07T16:18:15Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search","version":1},"cited_work":{"arxiv_id":"2104.03221","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.03221","snapshot_observed_at":"2026-08-04T21:44:50.267202Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search","venue":"cs.DS","work_id":"388238c1-7fc0-4b08-8b94-3eb7d3b25f82","year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.111749Z"},"links":{"cited_paper":"/paper/2104.03221","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:9c59bece3dbbf29d5676d184e22f6a5f5b1464c3c2069aced8fccd00fef5a7a7","observation_id":"7d4dc1c2-d61b-497b-8786-02ee5d1e9633","resolution":{"observed_at":"2026-08-04T21:44:50.325544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:43.255278Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.255278Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:eafeb574b2a06634ed3ac548d84821116b6513f5048c0f5b817263497c362c1e","observation_id":"24d84751-a575-4ebb-aaeb-7869d5dda1a2","resolution":{"observed_at":"2026-08-04T21:44:43.255278Z","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-04T21:44:43.399381Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.399381Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:ea4b40c488868fa64c4c85fd5c371c2459a17b29d908175b45a5d0c974fc3155","observation_id":"2d7cac19-b9ef-43f1-a655-6047eeee092e","resolution":{"observed_at":"2026-08-04T21:44:43.399381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:53.777037Z","title":null,"venue":null,"work_id":"d568960c-7447-4d93-9452-2830a0620e97","year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.499598Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:a41dfbdeb8b83cbff1f683a3de0fdd428f1e23bc25d8e720a0ce1066e6756be9","observation_id":"4037f8f5-a7fc-4b13-9d70-a06e0fc671ea","resolution":{"observed_at":"2026-08-04T21:44:53.837779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:53.597428Z","title":"[n.d.].Elasticsearch","venue":null,"work_id":"85191a62-d12f-4559-98df-0e604ef27c61","year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.634684Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:0b88f3fd1fe20b9b3dea31488eded1116ff3e8bf4a477c020db32d474e5187e8","observation_id":"4254c0ba-64d7-4f20-b186-a1801b01ff72","resolution":{"observed_at":"2026-08-04T21:44:53.680333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-04T21:44:43.793939Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.793939Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:cdf367c30a0d8f1c65590ae9a26563758c9b311e7826cd686276919ff31ad140","observation_id":"91c23970-f6a2-44a2-98fe-3eb765010e86","resolution":{"observed_at":"2026-08-04T21:44:43.793939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.09913","last_updated":"2024-09-16T01:06:23Z","snapshot_observed_at":"2026-08-04T16:37:13.438299Z","submitted_at":"2024-09-16T01:06:23Z","title":"Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.09913","snapshot_observed_at":"2026-08-04T21:44:43.873443Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.873443Z"},"links":{"cited_paper":"/paper/2409.09913","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:08b536478f33dabfc17aa84f29f6aef752d10e4293f11b5b6a637809762671e7","observation_id":"9a5d17fe-a315-4fa2-9a7b-dca4d7fd4baf","resolution":{"observed_at":"2026-08-04T21:44:43.873443Z","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-04T21:44:43.956332Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.956332Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:57b7d2f37d026f7adb1e4727db1c273fb3e972068bcb2bc66b4296639574ccad","observation_id":"b4eef5cc-cc4f-4fcd-82db-a148a556bcc9","resolution":{"observed_at":"2026-08-04T21:44:43.956332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-04T21:44:44.065994Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.065994Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:2cef1526f76709a2c3919e5a69bc14deb69f4fbf28ab3c08c537c67c1e98096d","observation_id":"dee40836-ed32-41c3-af54-c03fd1c2287b","resolution":{"observed_at":"2026-08-04T21:44:44.065994Z","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-04T21:44:44.181920Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.181920Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:3b980858db1fa1b2fe4073d371b63c133ffb248ecedf00b7a71729c461055654","observation_id":"f80c37ab-d978-4a01-bde1-fccb4f9d8700","resolution":{"observed_at":"2026-08-04T21:44:44.181920Z","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-04T21:44:44.252300Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.252300Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:99e4e58afd9c888a3c87c8c0a8f353e3e34eac3f99bb20a0942be1ee5f8bee47","observation_id":"104d7394-1f3c-434e-9dbb-6d78ee6e3ac8","resolution":{"observed_at":"2026-08-04T21:44:44.252300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:53.367423Z","title":"2018.constrainedANN","venue":null,"work_id":"fe93a270-89c1-452a-9d3c-51ee3bae77d5","year":2018},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.343186Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:127a9af35fabcb6dae4c576be84934be5a5051f4fe5fbb792364802161dec3a4","observation_id":"98df6a96-feba-478f-b3f0-be56523c1a47","resolution":{"observed_at":"2026-08-04T21:44:53.488327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-03T18:44:21.028766Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-04T21:44:44.413882Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.413882Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:783aa21157d83302ba7927b6b49425d3ad033c25db5e51d55fc2913a9dd0f56a","observation_id":"6b89367b-cf50-43e6-8c16-6aa8fd2c5184","resolution":{"observed_at":"2026-08-04T21:44:44.413882Z","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":"5515.25056","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:50.034442Z","title":null,"venue":null,"work_id":"a0745f25-e063-43f4-a1fc-9d86ced02c68","year":2013},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.510450Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:d6d29b08efecefa4166896b67e43abcaa0890686db69b5c7936e56bbf7278ca0","observation_id":"31ad463a-154f-4b35-81e7-ff510995a155","resolution":{"observed_at":"2026-08-04T21:44:50.100692Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:44.612876Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.612876Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:142683a7a25704628717f9bce43a7af5d209bd358da45fa841452e1e047cc3f9","observation_id":"b10c7255-9dfa-4ea1-bafe-9ade288632d2","resolution":{"observed_at":"2026-08-04T21:44:44.612876Z","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-04T21:44:44.821939Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.821939Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:638cbbaafdd96de6cc8059b32c99e8031a3ace64f62ab0f266646a3a82c5840c","observation_id":"227afcad-ebe1-4eb4-ac5a-1aa8986585de","resolution":{"observed_at":"2026-08-04T21:44:44.821939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:53.106436Z","title":"2022.TKDE-under-review-Native-Hybrid-Queries-via-ANNS","venue":null,"work_id":"a7232e17-9a93-4e29-801d-154fd6c031c6","year":2022},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.855956Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:0e45211c95f76693b84943a22367a6f816b3e2eed5d6f81f6ef2b9303ee33ff3","observation_id":"084a62c4-1a87-43d4-bbe7-738c54bf1b64","resolution":{"observed_at":"2026-08-04T21:44:53.189992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/35022643","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Nature","work_id":"3d543d6f-0974-4c93-baf3-35849d2775d3","year":2000},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.972896Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:db8db74fbb9e2bdf54fc5fd441726f7572fff0ed73303a0c4cc487136d4c26f3","observation_id":"3f1c1bf7-e502-4d3c-8072-bda796250f98","resolution":{"observed_at":"2026-08-04T21:44:49.010696Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:52.941603Z","title":null,"venue":null,"work_id":"de002c3c-0dce-475f-acaf-6e5fa6790dda","year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.103872Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:2d8ffb267dda8ad65046d1764f63699035abdcdc2d99e18dfd571112c27bd00d","observation_id":"9e183239-3833-4107-8cdc-f568c270906c","resolution":{"observed_at":"2026-08-04T21:44:52.996504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7384.33578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:49.744382Z","title":null,"venue":null,"work_id":"29ae3354-4a6b-40d3-9aa2-5475369d8886","year":2019},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.229491Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:a7586b3b813956830807de8cfc83e893478df6fd7fa383736e4735c61e64b94d","observation_id":"29fe1bce-c7ff-46ca-94b6-141670e70d6c","resolution":{"observed_at":"2026-08-04T21:44:49.884753Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:45.327630Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.327630Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:572a9a199ce23138a8ff7be5fbe3c30c88290aba798ec0008dea18785b1d688b","observation_id":"e72e1ce9-8e5b-4635-84e4-3f146863b7be","resolution":{"observed_at":"2026-08-04T21:44:45.327630Z","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-04T21:44:45.465553Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.465553Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:8e850955a0f45262a0de7a400d1b2627a17377aef197565b1f8f5d4db5ad6fbf","observation_id":"77ec582e-6f67-409a-9ed9-0c34c66b149d","resolution":{"observed_at":"2026-08-04T21:44:45.465553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02448","last_updated":"2025-06-17T09:24:55Z","snapshot_observed_at":"2026-07-06T20:00:57.006102Z","submitted_at":"2024-12-03T13:32:11Z","title":"UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02448","snapshot_observed_at":"2026-08-04T21:44:45.587723Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.587723Z"},"links":{"cited_paper":"/paper/2412.02448","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:b27c936074068267b00aa9e341f2e0ecc076170aca5b417b1593f2d9a118c642","observation_id":"3f894805-27a0-424d-a7b1-9a2642836db7","resolution":{"observed_at":"2026-08-04T21:44:45.587723Z","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-04T21:44:45.703324Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.703324Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:1b5275cec2a36b35d2e1524764fcfec9fe0ecd91a6314e11becaa0326d5bde7e","observation_id":"7e3f2d85-c581-479f-8359-2f966e504d08","resolution":{"observed_at":"2026-08-04T21:44:45.703324Z","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-04T21:44:45.781437Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.781437Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:34037293ca04cc6b0a6329697f37c98d7a6a2f778215b9960749347944e36bc9","observation_id":"75123752-282d-4e83-a296-ed419f278dfc","resolution":{"observed_at":"2026-08-04T21:44:45.781437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:52.802683Z","title":null,"venue":null,"work_id":"7fbf4d47-4113-469a-a569-e7fa4bc0d683","year":2022},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.887899Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:48e14e93bd7f39c5abfa9402481d9151afccf91e3f08326b68dbe0b16b4d88c6","observation_id":"e028097f-ab26-476d-9f5a-3d633f6c0f52","resolution":{"observed_at":"2026-08-04T21:44:52.854646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00402","last_updated":"2023-11-30T09:15:51Z","snapshot_observed_at":"2026-07-06T16:25:58.486204Z","submitted_at":"2023-09-30T14:55:44Z","title":"DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00402","snapshot_observed_at":"2026-08-04T21:44:45.991734Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:45.991734Z"},"links":{"cited_paper":"/paper/2310.00402","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:2a70df6c03849889f35f2077fc5a1ec6fc1d181d0e83dd0a04a7472ed3601a22","observation_id":"8fa9e2d9-bf66-416c-98bd-a37dd512283f","resolution":{"observed_at":"2026-08-04T21:44:45.991734Z","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-04T21:44:46.129411Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.129411Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:f1b084e672eb79e0f543d47d1436d2c4790086808d39817cdd5ec08106054b29","observation_id":"503c823a-1208-415d-9f3d-bd542bde1f55","resolution":{"observed_at":"2026-08-04T21:44:46.129411Z","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":"0531.34120","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:49.525877Z","title":null,"venue":null,"work_id":"297d5837-ae20-4b44-bbb3-c8a4eb85db04","year":2020},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.239524Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:749889855ce8abfefd816ef31f2588e16a316b2054adc5a117ca6664a460d388","observation_id":"0f61ce06-3b46-425a-9966-4f833c6f729d","resolution":{"observed_at":"2026-08-04T21:44:49.598328Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:46.363177Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.363177Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:6ca683c5df3da64c735801832adebbefe7ddf08334c94d2292bfe572f2dcb0ee","observation_id":"af015b7c-037f-487c-a015-9d376ca9c981","resolution":{"observed_at":"2026-08-04T21:44:46.363177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:52.656481Z","title":null,"venue":null,"work_id":"f1668a46-13da-40fb-917a-15d0cdf5abdf","year":2022},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.461736Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:e17efb7462eae1ca964c6ff36b84efc406c780cf5cacafc54ce4cec943108e58","observation_id":"612a81f2-b0aa-457c-908b-fc3787011cc1","resolution":{"observed_at":"2026-08-04T21:44:52.716164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:52.468304Z","title":null,"venue":null,"work_id":"782db658-305c-4d03-8d30-84cbd322f249","year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.572654Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:aa8a1f76850bacc9eb3631db38536bc6eaa938ce8f7397ded8e7338e71773ac6","observation_id":"58a8d35c-6a51-453b-a6ec-0a68b6729c25","resolution":{"observed_at":"2026-08-04T21:44:52.581148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:46.678628Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.678628Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:dc4431e4ec36024c52a1f0532c2588204cff04be14beedc058aa9b3f83e679ab","observation_id":"ee387da6-5593-4463-8ea9-1e47f43328e1","resolution":{"observed_at":"2026-08-04T21:44:46.678628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00020","last_updated":"2021-02-26T19:04:58Z","snapshot_observed_at":"2026-07-06T10:45:03.059688Z","submitted_at":"2021-02-26T19:04:58Z","title":"Learning Transferable Visual Models From Natural Language Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.00020","snapshot_observed_at":"2026-08-04T21:44:46.750731Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.750731Z"},"links":{"cited_paper":"/paper/2103.00020","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:8e36cbe65b432b7a8f690e18fd9eb1627a3f118fa4f43971613499e0645a546b","observation_id":"7e081adc-c5be-4262-8f59-c27dddadb66a","resolution":{"observed_at":"2026-08-04T21:44:46.750731Z","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-04T21:44:46.885495Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.885495Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:9cb01cb8e6d4ce4275fabca5ce5e7fd4bc6aab30c8d895ba581b4de4b2279c29","observation_id":"5657acc6-88e5-4eb4-aa8f-fd4f00cda427","resolution":{"observed_at":"2026-08-04T21:44:46.885495Z","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-04T21:44:47.101029Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.101029Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:ee00bed855ecb1fdf6247377396150d14b79cf52608b151deae3cb4dcdec9806","observation_id":"0d66c30a-f191-4420-a8dd-f9a7166bbb80","resolution":{"observed_at":"2026-08-04T21:44:47.101029Z","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-02T09:28:14.540794Z","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-04T21:44:47.331427Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.331427Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:1588348e0685210a5de9d6a92e5608edfd242b3900038a9976d53189f8f957d7","observation_id":"f22650c9-3380-4992-a534-317b4df8e1ae","resolution":{"observed_at":"2026-08-04T21:44:47.331427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02114","last_updated":"2021-11-03T10:16:39Z","snapshot_observed_at":"2026-08-02T08:12:49.547570Z","submitted_at":"2021-11-03T10:16:39Z","title":"LAION-400M: Open Dataset of CLIP-Filtered 400 Million Image-Text Pairs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02114","snapshot_observed_at":"2026-08-04T21:44:47.219963Z","title":"arXiv preprint arXiv:2111.02114(2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.219963Z"},"links":{"cited_paper":"/paper/2111.02114","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:f67ebbc7ab917fb59ef106b940a39da45fccd18c7deb5cbf843d4e362b4b2bd2","observation_id":"c71a22fc-8e17-49fa-8edf-85d8d6749cae","resolution":{"observed_at":"2026-08-04T21:44:47.219963Z","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.3844/jcssp.2015.692.698","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Computer Science","work_id":"c68ca74b-8682-49e4-8370-8cd19a562d5c","year":2015},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.511102Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:42a2a5479166c95822e2a455766938a767b809b32f8d0f6234a99b3d341db013","observation_id":"26afe4c7-eda7-4e6a-b9fc-637ab174a1f5","resolution":{"observed_at":"2026-08-04T21:44:48.740834Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:51.740590Z","title":null,"venue":null,"work_id":"2e721a1a-6950-45cc-a488-68cdb5a6646b","year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.416119Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:2aa950b18db18114f1ed6906655fed6591902d018977fbb2afb93202a35fd282","observation_id":"24c4a9b3-c03f-411b-a1a8-1826aad37866","resolution":{"observed_at":"2026-08-04T21:44:51.863938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:51.161541Z","title":"2019.DiskANN: fast accurate billion- point nearest neighbor search on a single node","venue":null,"work_id":"64e476a6-5b8f-44f8-9a64-7a298d88cb20","year":2019},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.649393Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:e3ae4727339520825fe4df366cd62112dcdeba620775eb1bc151906cc9755335","observation_id":"2ef52c43-79a8-42f4-acf7-fc10a1bcbbc2","resolution":{"observed_at":"2026-08-04T21:44:51.281755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:51.481548Z","title":null,"venue":null,"work_id":"079027c6-700e-448e-a40a-c77b29180c9f","year":2019},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.565862Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:8fe22a326f1e949562ac2cb0898023d157fa466394957848e2f219b32026c2e8","observation_id":"b885837b-6472-4de1-b1ca-ce52fb431b8d","resolution":{"observed_at":"2026-08-04T21:44:51.630616Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:50.920034Z","title":null,"venue":null,"work_id":"3cbfeb55-2eb9-433a-87e6-f74d24d8f09b","year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.783463Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:5a96617b843129711ba11132a409a5fd48ce4636c18a125e584028d5a8748317","observation_id":"bfd873a2-0cce-497c-9d88-f4cc871e74b4","resolution":{"observed_at":"2026-08-04T21:44:51.048427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:47.732010Z","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":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.732010Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:26754cdf78cc851a4df83b3eced2d202909b625e88763ea3e029ccccc3ddf6a0","observation_id":"15905721-4a89-4952-b14d-2250953fe2ca","resolution":{"observed_at":"2026-08-04T21:44:47.732010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:50.720995Z","title":null,"venue":null,"work_id":"6a9bec6e-c173-4510-bf60-1c6cb962b9ae","year":2022},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.982711Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:f99082c238e82c667c971ef127f9052fb3766b8022b6662d8e4faa33d60b5020","observation_id":"e4a3b593-d5e7-42de-88af-d5653bd29d6b","resolution":{"observed_at":"2026-08-04T21:44:50.824940Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-07-06T10:36:50.762036Z","submitted_at":"2021-01-29T15:12:35Z","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-08-04T21:44:47.864277Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.864277Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:90537c654fb4ab7233cced5494821b69c0d911d80c3730a713431958698dc0f0","observation_id":"34b6b4ed-22f5-461e-81a1-392caf5d418d","resolution":{"observed_at":"2026-08-04T21:44:47.864277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19473","last_updated":"2024-06-21T08:26:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T18:59:01Z","title":"Retrieval-Augmented Generation for AI-Generated Content: A Survey","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19473","snapshot_observed_at":"2026-08-04T21:44:48.163194Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:48.163194Z"},"links":{"cited_paper":"/paper/2402.19473","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:535e12b9a6b8ea02b4f899485761aaa56126a2aa84740fd31bfb2cbfb8e47a9c","observation_id":"097b0adb-24c1-45fa-832b-036ce1c920df","resolution":{"observed_at":"2026-08-04T21:44:48.163194Z","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-04T21:44:48.093788Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:48.093788Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:a743822fb2ea42734b4f7779f71d4551bf5abd8ee6dbdfe152204f3eb5b2a6e4","observation_id":"2c52d5be-4845-4c37-85f4-7a08d12f4f59","resolution":{"observed_at":"2026-08-04T21:44:48.093788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:50.434183Z","title":null,"venue":null,"work_id":"f36b48f9-2b3b-4a6f-99ed-b71bce1aee91","year":2024},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:48.426756Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:a75409ccce8b97792a9044ca8d70ca36d78a2263530622ad47ffc2fdcc95a42e","observation_id":"e76a73fb-c9dc-4d31-9b53-f13bae82d4f9","resolution":{"observed_at":"2026-08-04T21:44:50.530756Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3581.36036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:49.210478Z","title":null,"venue":null,"work_id":"35f31511-65df-409f-9dda-282bda4d8032","year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:48.271302Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:608050f8794823a0b3292b1e0e772f277911f707f1e70fd8b2bbe61fceb7e38b","observation_id":"4fc3b09a-9f76-40c1-9092-1c3bb2101516","resolution":{"observed_at":"2026-08-04T21:44:49.296704Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:44:52.153041Z","title":"InProceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"ec2bd8d5-cb08-4132-a93a-b7c67d578975","year":null},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:46.984971Z"},"links":{"citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:00a5a2fb67c9b10f3772bdc5e5a9a9a21a989f9bf677a61628720649dc7d7230","observation_id":"4633b4a3-417b-4063-9ad4-cca1540e1eb9","resolution":{"observed_at":"2026-08-04T21:44:52.265492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":1,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":41,"verified_exact":3,"verified_fuzzy":5},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 2 inbound Pith citation observations for arXiv:2509.07789."}