{"as_of":"2026-08-09T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59cce02730f61d78e832adab01c01bc7cc3ed0e15408e62127c5b3502cd5b0f5","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T21:59:00.063625Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.24173/citation-record","integrity":"/paper/2607.24173/integrity","json":"/paper/2607.24173/citation-record.json","paper":"/paper/2607.24173"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T21:58:57.125909Z","title":"In: IEEE Big Data","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":1,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.125909Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:afce11d5d51c745070fc3a97232398ffd86445c7ee30481774f9de395779ea70","observation_id":"06ca5b96-d20b-424f-ac60-cc791e87ab52","resolution":{"observed_at":"2026-07-31T21:58:57.125909Z","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-07-31T21:58:57.197384Z","title":"In: SIGMOD","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":2,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.197384Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:394c162982a41a3b2db432f7f00727a3652e96d6b525d4c50ee2d2290698652a","observation_id":"6490a161-14cd-4dd9-8dce-d1cbbc71f809","resolution":{"observed_at":"2026-07-31T21:58:57.197384Z","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-07-31T21:58:57.287176Z","title":"The VLDB Journal 31(4), 797–821 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":3,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.287176Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:ba53a0dcefd149c4bcedac6a1b0ed645ff5f88a247483b5b016835c55527c88e","observation_id":"29326f64-b2da-4852-9de0-ed5fe11bf8fd","resolution":{"observed_at":"2026-07-31T21:58:57.287176Z","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-07-31T21:58:57.348049Z","title":"Proceedings of the ACM on Management of Data 3(1), 1–31 (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-09T12:42:25.589050Z","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":4,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.348049Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:3ac4a8573edaaa7907cd4f458f4866dd9badea10d4aad73ef0dbb35bd2f5421c","observation_id":"b4e5bfc6-81f8-45a0-b3b5-2a8785c7b993","resolution":{"observed_at":"2026-07-31T21:58:57.348049Z","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-07-31T21:58:57.408323Z","title":"Proceedings of the ACM on Management of Data2(6), 1–27 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":5,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.408323Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:f086df035207d89a2cd53633c8f233e2507eed1a5c44a8f12e7518563f23fecb","observation_id":"9d45fcf4-9bc2-4256-ae13-122b179ee843","resolution":{"observed_at":"2026-07-31T21:58:57.408323Z","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-07-31T21:58:57.493633Z","title":"In: Asilomar Conference on Signals, Systems and Computers","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":6,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.493633Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:1dbc02dc0456b873f3e03a875ff426aa66465f0b917d356fb6dd9310a3921815","observation_id":"8284b3d7-4fb5-4fdd-a0af-029d89ec163a","resolution":{"observed_at":"2026-07-31T21:58:57.493633Z","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-07-31T21:58:57.565218Z","title":"In: World Wide Web","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":7,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.565218Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:f7454b4cebfc0e513631b1d7f7a630a55479ef2a38a400b31336cad0f8c15a18","observation_id":"e813b226-c9d8-4b7d-9084-d3f98429da4c","resolution":{"observed_at":"2026-07-31T21:58:57.565218Z","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-07-31T21:58:57.650795Z","title":"In: ICML (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":8,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.650795Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:b589e46988aaea2dc221bd9b4e4b70e1f1972952f8184eec6eaa1a2b2179d6e4","observation_id":"5d475d5c-3706-4675-9263-0b19478d442b","resolution":{"observed_at":"2026-07-31T21:58:57.650795Z","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-07-31T21:58:57.728325Z","title":"IEEE Transac- tions on Pattern Analysis and Machine Intelligence44(8), 4139–4150 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":9,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.728325Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:d2782a4bbfed01685a27482c0d7d62a73960d24334c87264546fa0c3ffb3b89c","observation_id":"37d27683-5b74-4143-b5cd-53ea3955e192","resolution":{"observed_at":"2026-07-31T21:58:57.728325Z","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-07-31T21:58:57.810581Z","title":"Proceedings of the VLDB Endowment 12(5), 461–474 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":10,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.810581Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:f4fd216b3fa6f93ac5e4e8a888948104299fb240b15b6a8bb4d25a90cd4233cb","observation_id":"5b84d47d-3903-4a59-beda-3be557a12beb","resolution":{"observed_at":"2026-07-31T21:58:57.810581Z","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-07-31T21:58:57.890546Z","title":"In: Web Conference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":11,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.890546Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:247c6ff8426ba8aa69bd54b8b4edf5b8c9e0e4bcb0e7903e90f8c3e3199b9152","observation_id":"f97bf921-c1f1-45f7-bae0-1d163114514a","resolution":{"observed_at":"2026-07-31T21:58:57.890546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07-31T21:58:57.964862Z","title":"arXiv preprint arXiv:2308.15014 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":12,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.964862Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:77c2bd80bb537a153d8ed42d52b170a2c2dc9ec5c86194f4133e8a3fdd3a28c4","observation_id":"deec3681-150a-403d-9004-9a449b31ed9e","resolution":{"observed_at":"2026-07-31T21:58:57.964862Z","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-07-31T21:58:58.064481Z","title":"Proceedings of the ACM on Management of Data3(3), 1–26 (2025) Simple and Fast Algorithm for Graph-based Filtered ANNS 13","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-09T12:42:25.589050Z","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":13,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.064481Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:c7b320e04cf9af5e8b03dabf9b4ba6a1473d0858e89ec4fac0e3fb78b86c62ea","observation_id":"10b563d1-ac27-4859-b849-7ca64de71cbc","resolution":{"observed_at":"2026-07-31T21:58:58.064481Z","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-07-31T21:58:58.149400Z","title":"In: PAKDD","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-09T12:42:25.589050Z","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":14,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.149400Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:a414fb7e27e39e0a1204d054e5e8b6b6ec024634a315e74237124a07df8ddf00","observation_id":"38b618ae-dca1-4069-b9e0-76e1432064b5","resolution":{"observed_at":"2026-07-31T21:58:58.149400Z","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-07-31T21:58:58.281807Z","title":"Proceedings of the ACM on Management of Data3(6), 1–26 (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-09T12:42:25.589050Z","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":15,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.281807Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:6f1876a08ec631940a131682be3cbbbb7e14d86c7b119047cd894e2bfeff5ee9","observation_id":"8828578b-44d5-4913-b0d8-13d04f694ac5","resolution":{"observed_at":"2026-07-31T21:58:58.281807Z","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-07-31T21:58:58.357323Z","title":"IEEE Transactions on Knowledge and Data Engineering32(8), 1475–1488 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":16,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.357323Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:5f1d56cee8a0573b70795bb348a2c9bf6561afe98c188637c6383cf3df902ca5","observation_id":"d8732fd3-760e-4b2c-b603-5a9cdd6e3595","resolution":{"observed_at":"2026-07-31T21:58:58.357323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06501","last_updated":"2025-05-10T04:02:14Z","snapshot_observed_at":"2026-08-09T11:58:46.446536Z","submitted_at":"2025-05-10T04:02:14Z","title":"Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06501","snapshot_observed_at":"2026-07-31T21:58:58.471982Z","title":"arXiv preprint arXiv:2505.06501 (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-09T12:42:25.589050Z","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":17,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.471982Z"},"links":{"cited_paper":"/paper/2505.06501","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:7a0d45f250b52876cd844d144813033952c4dc678a8abae240ab26077db658e2","observation_id":"3f8e61c3-6dc8-4c07-ad62-f8eebb275cfb","resolution":{"observed_at":"2026-07-31T21:58:58.471982Z","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-07-31T21:58:58.532762Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligencee42(4), 824–836 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":18,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.532762Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:0fec87215520484fe304f321fa26a2d59de46cadd142d66a636105a1aa0f3aa0","observation_id":"5e388f4a-176c-4d1c-acd9-a2d63fbae713","resolution":{"observed_at":"2026-07-31T21:58:58.532762Z","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-07-31T21:58:58.611318Z","title":"Information Systems 45, 61–68 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":19,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.611318Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:d63b2fb9ef3121f48a7cfe2b8dba75ca0ae7662788f0ee17534a83404ee80b29","observation_id":"9f42c0cd-f23b-4403-9785-2af5d0c50de6","resolution":{"observed_at":"2026-07-31T21:58:58.611318Z","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-07-31T21:58:58.711699Z","title":"Proceedings of the ACM on Management of Data2(3), 1–27 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":20,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.711699Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:84da18ab93683caeb108f1e85d4d3adf0075608ea24a307958e67f31f2d7b7cc","observation_id":"6e04e057-15b5-4bb1-909e-48f19f7b044a","resolution":{"observed_at":"2026-07-31T21:58:58.711699Z","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-07-31T21:58:58.763832Z","title":"Proceedings of the ACM on Man- agement of Data1(1), 1–27 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":21,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.763832Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:34f7921c4fd67e1f708f432893ec134a0ff573b67e928e2087e10d6ee4fcb238","observation_id":"b8641bd9-dfba-4913-a1a3-4f2b45fa042b","resolution":{"observed_at":"2026-07-31T21:58:58.763832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-09T12:42:25.589050Z","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:9e0e46b0709439c6496eaddda11061ddf8132b893311d7f97c7b3a7d2e3379d6","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T21:58:58.942553Z","title":"In: NeurIPS","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":23,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:58.942553Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:2c89467c77f3a4718086d2a189806df3bfa1c85cda7dda5914165f4eb4455c03","observation_id":"17d4557b-ac90-4873-b53d-3425c12157d3","resolution":{"observed_at":"2026-07-31T21:58:58.942553Z","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-07-31T21:58:59.020692Z","title":"Pattern Recognition12(4), 261–268 (1980)","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":24,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.020692Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:0ad7d74fb7a0253ac979c748788402ca660c06338a5e1ad5fee8d58794d32f31","observation_id":"6f748f09-2762-4fc1-83d8-ca1015870b77","resolution":{"observed_at":"2026-07-31T21:58:59.020692Z","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-07-31T21:58:59.101073Z","title":"In: IEEE International Conference on Big Data","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-09T12:42:25.589050Z","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":25,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.101073Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:c714a440a8582f44e084ead569224bff1292a3053d959c500d8737cd89780c1c","observation_id":"f270bfd5-50b2-4bc7-b8cb-7a5e6d8d8824","resolution":{"observed_at":"2026-07-31T21:58:59.101073Z","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-07-31T21:58:59.196992Z","title":"In: SISAP (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":26,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.196992Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:17e3e0d43ba07af5da3e1a778fca4649a74ba7ab5de9f10585d99c5295b09bd1","observation_id":"9cc9d981-09e9-4e78-b642-7e58214044a3","resolution":{"observed_at":"2026-07-31T21:58:59.196992Z","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-07-31T21:58:59.317649Z","title":"In: SISAP (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":27,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.317649Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:ac1578b201a1d02a4a5828684ccbf6afc678344ef65bab10c3f4c63ea9c35049","observation_id":"705f9099-0b64-4703-8c2e-c5299949e14c","resolution":{"observed_at":"2026-07-31T21:58:59.317649Z","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-07-31T21:58:59.408457Z","title":"In: SIGMOD","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":28,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.408457Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:f025e4b44532bbc48f94063b1516127d8ac03c0b49d25fa663ec04c6fe5f2490","observation_id":"6428e2ff-70ec-4e82-b5a9-b9a293978bd2","resolution":{"observed_at":"2026-07-31T21:58:59.408457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-31T21:58:59.454756Z","title":"arXiv preprint arXiv:2203.13601 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":29,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.454756Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:5a98907e8ad49eefa8156d20f7d793188f1864a9bac83305d92598873c88e15c","observation_id":"8a76358a-5f19-49bb-8264-de1c711e6d7c","resolution":{"observed_at":"2026-07-31T21:58:59.454756Z","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-07-31T21:58:59.559736Z","title":"In: NeurIPS","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":30,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.559736Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:f896391656cd9b5eb37a615935990648d03a1e4d670190b867166fe90f446439","observation_id":"89cf8110-ebda-45f6-ae55-089722c0085a","resolution":{"observed_at":"2026-07-31T21:58:59.559736Z","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-07-31T21:58:59.638082Z","title":"In: CIKM","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":31,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.638082Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:fb611dafaa000cf2421f2549f82a7fc7b714d9136171a2c0e1540125ff6ba3cc","observation_id":"5c22e3b5-20dc-4a29-8fa1-75b9848bc380","resolution":{"observed_at":"2026-07-31T21:58:59.638082Z","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-07-31T21:58:59.741192Z","title":"Proceedings of the ACM on Management of Data2(6), 1–26 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":32,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.741192Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:32fb5f8e29d17537f72921c383ca5d67c25385ed772a2452da12402550ad4029","observation_id":"34eebf6a-901b-4e4f-9ebc-2375a732451e","resolution":{"observed_at":"2026-07-31T21:58:59.741192Z","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-07-31T21:58:59.820405Z","title":null,"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-09T12:42:25.589050Z","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":33,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.820405Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:73e8ec0adb88e697dcf74fb54cfa9f7f2cfec8909cf29d63259a1a34b64da681","observation_id":"2223e4a1-bab8-482b-86e7-a03a01a7e6f8","resolution":{"observed_at":"2026-07-31T21:58:59.820405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03940","last_updated":"2025-06-03T15:39:34Z","snapshot_observed_at":"2026-07-06T16:58:03.812619Z","submitted_at":"2023-12-06T22:43:50Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03940","snapshot_observed_at":"2026-07-31T21:58:59.869190Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":34,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.869190Z"},"links":{"cited_paper":"/paper/2312.03940","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:adb05949ab53891dc9b7c20bfcc1fe155f6f0829b654fe639c1be552d9ad8d03","observation_id":"614de366-4f3b-44e7-beb7-f4b32b3b76ed","resolution":{"observed_at":"2026-07-31T21:58:59.869190Z","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-07-31T21:58:59.967385Z","title":"Proceedings of the VLDB Endowment19(2), 183–195 (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-09T12:42:25.589050Z","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":35,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.967385Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:812ed2f2069de243cf91c5768503622214ec6cd46d5a52b059bd913977ff0534","observation_id":"8973284f-3875-4fe1-a752-0749f9ac200d","resolution":{"observed_at":"2026-07-31T21:58:59.967385Z","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-07-31T21:59:00.063625Z","title":"Proceedings of the ACM on Man- agement of Data2(1), 1–26 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","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":36,"source":"pdf_text","source_observed_at":"2026-07-31T21:59:00.063625Z"},"links":{"citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:2184d176793f534992607e548983961ab3bad3d6a5d83b3ece7d83f9948e2cc1","observation_id":"2186be44-8780-4384-8fef-3ec110cb9056","resolution":{"observed_at":"2026-07-31T21:59:00.063625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","submitted_at":"2026-07-27T08:55:09Z","title":"Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.24173."}