{"as_of":"2026-08-08T05:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3aee01a90d61e3a939570cf2a77c6cb5a74b0dac83570e7138550b593b869758","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:37:34.805525Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.04790/citation-record","integrity":"/paper/2506.04790/integrity","json":"/paper/2506.04790/citation-record.json","paper":"/paper/2506.04790"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:37:41.809535Z","title":"Optuna: A next-generation hy- perparameter optimization framework","venue":null,"work_id":"0e237a42-a19d-4424-b810-2da622786cd3","year":null},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.566738Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:8aa46850176383201171f0ef18184561805f6204730f4a1aa5b10f634f110cc8","observation_id":"096e2b6f-7ad8-4ab4-ac88-c9027726812b","resolution":{"observed_at":"2026-08-07T10:37:41.812670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.800127Z","title":"Optuna: A next-generation hyperparameter optimization framework","venue":null,"work_id":"e07734fb-71bc-4aa6-a3c8-284f12ecc5e5","year":2019},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.595538Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:1c7cc6ef00697dc81e388e0bf4ffcf2e54a281f1caac4fcad6baf6656bd00303","observation_id":"f52b5291-cf19-46ef-806c-355f79d1691a","resolution":{"observed_at":"2026-08-07T10:37:41.803469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.790752Z","title":"Diversity maximization in the presence of outliers","venue":null,"work_id":"57da4282-60bc-4dc6-9a19-c53912eebe91","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.657984Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:93784531839404b3373f93babed8dbe1c9ff3e397d5af264d1344f5c976f062a","observation_id":"2c9511ba-f0cb-44ab-b8c6-33056ab4d3ef","resolution":{"observed_at":"2026-08-07T10:37:41.794091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.780711Z","title":"Quicker adc: Unlocking the hidden potential of product quantization with simd","venue":null,"work_id":"8042b342-c0a2-4ca2-8363-ad683bb63e30","year":2021},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.738931Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:a24bb3fc98f42210da5f2bd1ca37dd075b1176350778befb7f061d584552ce19","observation_id":"80e2c01a-1254-4705-9472-cb459dccb5e9","resolution":{"observed_at":"2026-08-07T10:37:41.784440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.770960Z","title":"Acl2023 tutorial on retrieval-based language models and ap- plications, 2023","venue":null,"work_id":"d7697f5d-3125-456b-afa8-5dae34ea1459","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.808248Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:bf31384eda550b0b50933f11f3999b49c8d113615066fe40a3650a3d48954013","observation_id":"a5cd5a33-f15c-4c5d-8b20-3f58f74c83f6","resolution":{"observed_at":"2026-08-07T10:37:41.774349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-07T10:37:30.889309Z","title":"Ms marco: A human generated machine reading comprehension dataset","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.889309Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4fb6279391700ebc76fa0cfa5ffbe91de53572c8c02327b4369eabb96cc7eb33","observation_id":"7de72cfd-166b-48ed-85f5-d364ac319731","resolution":{"observed_at":"2026-08-07T10:37:30.889309Z","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-07T10:37:41.759734Z","title":"Re- visiting the inverted indices for billion-scale approximate nearest neighbors","venue":null,"work_id":"a4c42c6a-4686-49f4-b789-2989a44ce29e","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:30.974453Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:e828f16ad00c56713c5ae3dab82d7cd6c3861fe4df18ae671e3303fc5dce42d3","observation_id":"89dbbaff-cf32-4fe5-8b6c-9a5daaf49c36","resolution":{"observed_at":"2026-08-07T10:37:41.764382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.750019Z","title":"Foundations of Vector Retrieval","venue":null,"work_id":"a269be8c-0717-47b5-a6ea-ab812182ec2b","year":null},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.042324Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:e53b5a1c62421f6edbf8f30b863375b3857fe0f727e99029087bd796857164dd","observation_id":"7f0e3ac3-e806-42f8-825f-402fe3383f76","resolution":{"observed_at":"2026-08-07T10:37:41.753369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.689526Z","title":"The use of mmr, diversity-based reranking for reordering documents and pro- ducing summaries","venue":null,"work_id":"f51cf0ed-de25-4a17-9e9c-f544506175ab","year":1998},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.119460Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:37b8fe36d6694f20af18e1c57515f180b92af95a1179e2d9e98d767e10e2d1cf","observation_id":"a7fe7239-f781-491c-9a80-609b2043fa78","resolution":{"observed_at":"2026-08-07T10:37:41.742775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.446288Z","title":"Learned index with dy- namic ϵ","venue":null,"work_id":"5795c02c-dfe4-4f67-825d-ceda2fde3e47","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.207368Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:1e8f64950fbbdef0869ae8db62fad6e5bcc057783c5f9739b1e4935d08fb262d","observation_id":"80b53865-7e63-4569-b95d-b733ea100ed2","resolution":{"observed_at":"2026-08-07T10:37:41.530869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:41.025336Z","title":"Bert: Pre-training of deep bidirectional trans- formers for language understanding","venue":null,"work_id":"7bc7f4d8-db28-44f9-bdb4-699cc5f2cd46","year":null},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.297695Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:7bf763c8bfd162b35c60c2fb5b9ab524e28a09ab23888896e8e2220a75e83bb5","observation_id":"d7b63c4f-dd53-47dc-b109-5210ce420c21","resolution":{"observed_at":"2026-08-07T10:37:41.229608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:40.789057Z","title":"Tsunami: A learned multi-dimensional index for correlated data and skewed workloads","venue":null,"work_id":"b10ccecf-f2bb-43ef-98e0-710a4240566f","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.386182Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:a2b9fe3f87be75b79a08af6a93f8ca2c8b1d4df347ac6d08ed2fa652dab24c30","observation_id":"afe7d5fa-255c-45bc-aa5e-22686d8be89f","resolution":{"observed_at":"2026-08-07T10:37:40.880555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:40.557873Z","title":"Link and code: Fast indexing with graphs and compact re- gression codes","venue":null,"work_id":"2ca793db-1362-4e6a-b1ea-f654654421f6","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.470173Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:f9d373f13d6fee588c6f6d07ec639da902a07c0c9afb5a2328cae1af87e7883a","observation_id":"db41db40-04f0-4591-9b54-8f8a241ef793","resolution":{"observed_at":"2026-08-07T10:37:40.682634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-07T10:37:31.541091Z","title":"The faiss library","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.541091Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:8be9cc57351b8b63d4a4be416c492e67cc77ac41c785c13dc84f542bc5b50a01","observation_id":"f5cadd4d-56f1-4f5e-a0cc-f8f4d52e96a1","resolution":{"observed_at":"2026-08-07T10:37:31.541091Z","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-07T10:37:40.412794Z","title":"Search result diversi- fication","venue":null,"work_id":"be1d7f8e-cb66-4040-9d2b-513eae9f0c6f","year":2010},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.591741Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4102b302b85ca904df8903fa3455eab02c667d47b24a6ccfe3f32d9b365ccd70","observation_id":"47169e97-656f-4010-8e10-370eacf33a89","resolution":{"observed_at":"2026-08-07T10:37:40.481668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:40.173043Z","title":"Disc diversity: Result diversification based on dissimilarity and coverage","venue":null,"work_id":"bbf13387-40a0-4e34-ae13-0170cb5af4a7","year":2012},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.669668Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:2214dfd6618df6c803c3f0d3aff0ac29c5ec1176352f8dddee26bd67cda4aae7","observation_id":"35ef443c-cca7-4b54-ab4a-30e76ea8da71","resolution":{"observed_at":"2026-08-07T10:37:40.312764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:39.979550Z","title":"Learned Data Structures","venue":null,"work_id":"42625a07-f4fc-40e6-a7d3-67bbb12e18ea","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.743134Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:3bb24ff9b7ccb9036d36a242325bfc6c46c1da79a48fddce54df8da53fea1297","observation_id":"e4c91106-75f4-405f-9e47-1799dc235d1a","resolution":{"observed_at":"2026-08-07T10:37:40.085821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:39.786640Z","title":"The pgmindex: a fully dynamic compressed learned index with provable worst-case bounds","venue":null,"work_id":"b7b07b9f-9007-49ef-abb9-033e4cfe60bd","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.817102Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:d37e62ca7ce66dd3549710ab0a66afc2e5e5db8bad7c0a8950f5f1ebcf27eb57","observation_id":"14e33dff-cb65-4e28-8043-f2fbace15749","resolution":{"observed_at":"2026-08-07T10:37:39.864557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:39.518247Z","title":"Why are learned indexes so effective? In Proc","venue":null,"work_id":"a78abb98-87d0-4e6f-9787-fdf70cbdedba","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.896190Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:216e736be6d04130536b94f5ccb404ae8e5aa5c92d380225cd57434d67d36e3c","observation_id":"c3ea6766-b1a7-4cfc-a1dc-c9ad530bcd2e","resolution":{"observed_at":"2026-08-07T10:37:39.642906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:39.367837Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":null,"work_id":"06644cb2-8cf1-4cfc-b117-ed0ff77478a3","year":2019},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:31.969327Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:698fe564f997362097e8a134ea5b5ccefbb28bc9812989278c3733914f96739e","observation_id":"fb6b7150-339e-4f13-8afb-b72cbd6d2705","resolution":{"observed_at":"2026-08-07T10:37:39.414380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:39.163902Z","title":"Flexflood: Efficiently up- datable learned multi-dimensional index","venue":null,"work_id":"89602014-fe8e-45fd-a003-802d874520f9","year":2024},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.038484Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:d7cada41f4eb7f7d49e6ef22ace42d13c1209cfb7b812900b5b660c40192e933","observation_id":"cdaef10e-2be3-4185-a045-53ae61882646","resolution":{"observed_at":"2026-08-07T10:37:39.280149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.989653Z","title":"Solving diversity-aware maximum inner product search efficiently and effectively","venue":null,"work_id":"de591cf5-75f9-4562-98bd-a269dcf17c6f","year":2022},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.092604Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:7698a09f4cc26f6850090122748fd7039549a60dc95abe950484a72cc2058b9f","observation_id":"55dd7bdc-5ace-4217-bda5-ce3ccb130141","resolution":{"observed_at":"2026-08-07T10:37:39.063419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.852966Z","title":"nanobind: tiny and efficient c++/python bind- ings, 2022","venue":null,"work_id":"03c7b5e1-9700-4cc0-a3fb-936ee18a3afd","year":2022},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.192912Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:7515506459d3e35553c99b0a02da157cd99ca063a2596f49db57d06fcd045d87","observation_id":"90c38d58-b4b2-4ed1-bd81-ac125df40e77","resolution":{"observed_at":"2026-08-07T10:37:38.914438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.726393Z","title":"Prod- uct quantization for nearest neighbor search","venue":null,"work_id":"82fa0aa3-7115-4bce-adfc-e62e6276997f","year":2011},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.294889Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:d240b40307295bfa19368f91ea258f4c21212706dd7788f2c82b3eb3087b485a","observation_id":"3530c3ab-bac3-4fb1-bb9d-b0b5d6206317","resolution":{"observed_at":"2026-08-07T10:37:38.792768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.625712Z","title":"Kochenderfer and Tim A","venue":null,"work_id":"8b619ada-95f6-4bde-9a2b-2e79739ec124","year":2019},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.405816Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:c79e501caef3ecadc8fd4a9c003450dd8ddff7419bccccacb5186eaa1f158e7f","observation_id":"a13eb572-e005-49c4-8e32-d97d17e7aa81","resolution":{"observed_at":"2026-08-07T10:37:38.673276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.508391Z","title":"Chi, Jeffrey Dean, and Neoklis Polyzotis","venue":null,"work_id":"efc4a8f0-8a24-4d9a-9b42-101006f0ab95","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.480018Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:2913895178606e50d8ba49d87bcc73ad676cf4d2ee80f050bdd7a90c2a5797bc","observation_id":"493f5823-d722-43cf-9aaf-d608c12bd56a","resolution":{"observed_at":"2026-08-07T10:37:38.567288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.430441Z","title":"Stable learned bloom filters for data streams","venue":null,"work_id":"18332050-b305-4433-8e1c-97ab2f4eb0bf","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.566132Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:ca5c439fc17a48b5cca72583baca50bcdb31978ba56a9ea0f57e00607caf4ca8","observation_id":"bc9c9471-a465-4818-8ba7-1bbd946443d7","resolution":{"observed_at":"2026-08-07T10:37:38.470577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.307148Z","title":"Malkov and Dmitry A","venue":null,"work_id":"ea7544c7-8639-4eed-a697-18caa5e8316e","year":null},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.641236Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:a18ad43719bd6279bd39b6eecc23f41c1e6e04552d8939a8ff953a5427dec4e9","observation_id":"0cbd5a17-1a52-4eb4-b2f4-106ea3d7de2e","resolution":{"observed_at":"2026-08-07T10:37:38.369722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.233119Z","title":"Cvpr2020 tutorial on image retrieval in the wild, 2020","venue":null,"work_id":"4accf879-5e92-45c2-84f4-2cb56de7cebb","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.747966Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:f4220d8290f055e82754c2232d31689480f0cb2d528715c3db3f32e7c20e33c9","observation_id":"47e7d837-7879-489d-9b8e-3d1472e48a38","resolution":{"observed_at":"2026-08-07T10:37:38.268619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.144595Z","title":"Arm 4-bit pq: Simd-based acceleration for approximate nearest neighbor search on arm","venue":null,"work_id":"58e429af-57ae-439e-83c4-7384782e2131","year":2022},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.823947Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:27b8af62faf7ba097b28af9ac83cb38ea4c2830ca321ac63f1d587049a297f99","observation_id":"7ed2b6ae-c687-4919-9bcb-800245329102","resolution":{"observed_at":"2026-08-07T10:37:38.186919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:38.029852Z","title":"Cvpr2023 tutorial on neural search in action, 2023","venue":null,"work_id":"27006cc9-4edd-4fdc-a83a-4a36164621c3","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.916528Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4d8abaa9c03f49d2f5a286d25cbba23bb5ad53b9e1ae9b027c37c980808d8ea8","observation_id":"77a5877c-463e-45c1-ae77-b71f42c672b7","resolution":{"observed_at":"2026-08-07T10:37:38.071747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.914234Z","title":"A model for learned bloom filters, and optimizing by sandwiching","venue":null,"work_id":"2d895990-b1bc-4d7b-b156-1c3bb65e91a5","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:32.989797Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4c45ef6cf87670eb9c6422073e3cf291c340f679e323b8d7b59d546a6154760a","observation_id":"d91e59e1-5e86-4366-b393-e2f7272d0371","resolution":{"observed_at":"2026-08-07T10:37:37.962551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.792387Z","title":"Learning multi-dimensional indexes","venue":null,"work_id":"89f28b36-e42a-453f-aec9-ab13e3e9d79d","year":2020},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.099647Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:45b7e53d0b7732f3a78612fc62398e65613062a532f580ccc051c18dd05d2c1c","observation_id":"ba4a20c4-312c-4f5d-a5ed-10dc13aa9c29","resolution":{"observed_at":"2026-08-07T10:37:37.852755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.653494Z","title":"General and practical tun- ing method for off-the-shelf graph-based index: Sisap index- ing challenge report by team utokyo","venue":null,"work_id":"252e08e1-a133-4ee9-88f0-7a43f26fced8","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.206032Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:ba741e51090fdec859348198011bc080fad0788b4526fae7e3a2918f3022a89f","observation_id":"f07fa6d5-0fb4-47c2-9d4d-a749db442140","resolution":{"observed_at":"2026-08-07T10:37:37.724700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04713","last_updated":"2024-02-07T10:05:42Z","snapshot_observed_at":"2026-07-06T17:26:43.251349Z","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2402.04713","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.04713","snapshot_observed_at":"2026-08-07T10:37:34.976241Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","venue":"cs.IR","work_id":"71db0a0b-8131-40f6-8374-40b9dc451c36","year":2024},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.278187Z"},"links":{"cited_paper":"/paper/2402.04713","citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:be64a2f42611884d63435151c799fb28af23a17ea44ba00efe30badafd296f96","observation_id":"5aa0a325-7e53-4177-a54e-6af1958e8de2","resolution":{"observed_at":"2026-08-07T10:37:35.040405Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.429508Z","title":"Relative nn-descent: A fast index construction for graph-based approximate nearest neighbor search","venue":null,"work_id":"0f14f170-2da7-4e22-9b03-f615f255eac2","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.355981Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:dfb47063d0f9114443ab9996e56694093a89ae09b8a5f1c8ceea774351354584","observation_id":"9cc4d7c6-b69d-4c89-b6c0-6e54b9ca2b40","resolution":{"observed_at":"2026-08-07T10:37:37.520472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.240399Z","title":"Revisiting oxford and paris: Large-scale image retrieval benchmarking","venue":null,"work_id":"f7790222-982f-43e6-8e54-2ed1ff776d22","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.461554Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:074d59a694bd3520c67ee66ab259535d9f9a4c3eba6ab8df25e5862ddbea2f77","observation_id":"dcedb3aa-e9dd-41dd-ac67-42378b318b44","resolution":{"observed_at":"2026-08-07T10:37:37.341940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:37.072081Z","title":"Fine- tuning cnn image retrieval with no human annotation","venue":null,"work_id":"61f835ef-f17d-45eb-8208-27940e244e81","year":2018},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.538563Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:3c07a47dce77fde42eaa92685eac9fc1095a6d9151d6cf92d0c4eede1f94e970","observation_id":"8fb037f3-18e1-471e-82bf-1c8e041e8d9f","resolution":{"observed_at":"2026-08-07T10:37:37.146823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.906787Z","title":null,"venue":null,"work_id":"868d9cf7-6cbd-4942-99a4-07c149b67453","year":2016},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.644399Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:5d5cd1a1e886b8aae3c066b50221b329aacc6513d194dac599f572a7c1cdf709","observation_id":"329c89b5-6e32-4504-864f-88da853715ef","resolution":{"observed_at":"2026-08-07T10:37:36.972846Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.735089Z","title":"Ravi, Daniel J","venue":null,"work_id":"bc9fd125-24b7-4994-83d5-620508585b54","year":1994},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.743893Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:aac95f058e1c0cc9a2be1029cfa02acdecbf8a35b99a3c16c64ffe84283b02d7","observation_id":"e8a95796-5121-4156-92ea-bb9028105119","resolution":{"observed_at":"2026-08-07T10:37:36.821453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.546895Z","title":null,"venue":null,"work_id":"fcc18e2e-f37f-4abd-ac69-80d7bd9d9401","year":2015},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.886378Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:33f6d42bc28caa588d3bb1d3e2f079437da3a04977cff79429ea0982be47396b","observation_id":"d4b01840-c994-48bf-8572-57e3b413b943","resolution":{"observed_at":"2026-08-07T10:37:36.621337Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.364399Z","title":"Fast partitioned learned bloom filter","venue":null,"work_id":"bb1cc4aa-65e3-4326-a221-963601550903","year":2023},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.992833Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4989f034c0c8855919595caa9e81b4c09e4bceae5166207ebc8eae9ea6725998","observation_id":"c66f7cb2-85d5-4943-9c47-3dffe859fb4b","resolution":{"observed_at":"2026-08-07T10:37:36.450788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.193249Z","title":"Glow: Global weighted self-attention network for web search","venue":null,"work_id":"4f496b50-bbf0-49bd-9621-06678ad6b534","year":2021},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.067962Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:4569d2de5c7af3a9957cf33aec88e95d1cfd127732702439f89a72ed46ed2532","observation_id":"d53c2956-ad72-4f31-889e-64fd8397f70d","resolution":{"observed_at":"2026-08-07T10:37:36.276852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:36.023837Z","title":"Results of the neurips’21 challenge on billion-scale approximate nearest neighbor search","venue":null,"work_id":"f5bfb844-d457-4082-be8b-597b3fd229cd","year":2022},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.170760Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:75de3c3bc1541a128700915ef8066c8507c607c981b2c818105e773401740da5","observation_id":"466e2177-cf36-48a8-b98e-f989b1f5e6c7","resolution":{"observed_at":"2026-08-07T10:37:36.065747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T10:37:34.281513Z","title":"Results of the big ann: Neurips’23 competition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.281513Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:1461c4150d6d111809e896a58b1dd7710a380653318f83de70822f00ef062959","observation_id":"63796b15-1610-4e8d-9a2d-8bce6f54d998","resolution":{"observed_at":"2026-08-07T10:37:34.281513Z","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-07T10:37:35.864831Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"9377d1f8-2f5e-48ec-97fd-c9397f965eb3","year":2019},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.385124Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:5b0a6b6a402247f48cc145c1ded560b7b19432d67e8f85290f5952fffe72a7be","observation_id":"df671512-be0c-4c57-a008-f9551a59c542","resolution":{"observed_at":"2026-08-07T10:37:35.948015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:35.666221Z","title":"Partitioned learned bloom filters","venue":null,"work_id":"156b715e-d323-47f5-a06b-339fc89ff682","year":null},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.467562Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:bfaf2a08b2c0f78d984049a0e35e586839addcc5c45e30ca3dcddf2d23f10c8d","observation_id":"c7ca202a-c670-4ad7-8416-ebef1b05e465","resolution":{"observed_at":"2026-08-07T10:37:35.769319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:35.512896Z","title":"A comprehensive survey and experimental compari- son of graph-based approximate nearest neighbor search","venue":null,"work_id":"819dcec5-98b6-4588-8aee-df92442b5f86","year":2021},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.574874Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:3fcb992e20382500435fe08eafae9d8cb7a6effd295ee056d2ce3d095c3c597a","observation_id":"fdfcb0f8-ae0d-4c40-b6c6-1b093c42b830","resolution":{"observed_at":"2026-08-07T10:37:35.578460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:35.331055Z","title":"Updatable learned index with precise positions","venue":null,"work_id":"a361673d-b035-4df2-bac7-3c0120a72b60","year":2021},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.688983Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:524af936da4a3b71eacf6b32a3ab55a85745651a1b3a9b2340c36e29f61610e9","observation_id":"11b07d8a-5ed8-49f2-8117-ec42f7742983","resolution":{"observed_at":"2026-08-07T10:37:35.421287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:37:35.166280Z","title":"This condition","venue":null,"work_id":"1fd1a02f-4b9c-4e05-9580-353fd1e2d82e","year":2017},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:34.805525Z"},"links":{"citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:70fdb3a72dc6c088827c5ede6f832b2ea955bbaa9033d5e19f26e68d9df789ae","observation_id":"8f92090f-0cc3-4056-9a2f-5615c15eccc9","resolution":{"observed_at":"2026-08-07T10:37:35.235634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-07T10:30:25.261637Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":50},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.04790."}