{"as_of":"2026-08-20T09:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d3b44233eaa7cd9f3567fc9d24d5627b2deced5e75872f8db916ce0a017cc36","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:49:32.192408Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2412.10701/citation-record","integrity":"/paper/2412.10701/integrity","json":"/paper/2412.10701/citation-record.json","paper":"/paper/2412.10701"},"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-11T15:49:32.589654Z","title":"A cascade ranking model for efficient ranked retrieval,","venue":null,"work_id":"88580bd7-81f1-4ed8-bd2e-c0b714b34c77","year":2011},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.062515Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:d38c5b88208cbaea9d4ef9fddbc00ce9f0519ff175f0ee70df1b3de49494ae8e","observation_id":"fa0313ae-345a-46bd-be6d-1330705213e3","resolution":{"observed_at":"2026-08-11T15:49:32.593882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.580568Z","title":"Query evaluation: strategies and optimizations,","venue":null,"work_id":"24907af6-37ca-4815-aabb-dae201f1c74f","year":1995},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.066738Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:80d9ed7cc47954224e5fe9f40e893540b7b9a8f5146c6a8701566401f03d6934","observation_id":"04756dc7-3dc5-472f-90e2-884cdba88909","resolution":{"observed_at":"2026-08-11T15:49:32.583981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.570036Z","title":"Efficient query evaluation using a two-level retrieval process,","venue":null,"work_id":"b81028d4-dd06-4510-b440-bed591d55c7c","year":2003},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.070144Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:d62bc4c228d9488e67a7633d370412dac426df9879a1400d02f43dc7384d92ae","observation_id":"696c0bf3-d6df-44d4-b48d-1f7f95ad8db0","resolution":{"observed_at":"2026-08-11T15:49:32.573588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.560106Z","title":"Faster top-k document retrieval using block-max indexes,","venue":null,"work_id":"96621f86-1a64-433c-bb9b-68cae1f65a74","year":2011},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.073660Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:0aaf7aa5f03c54853e6a274f448d2b569fac7d844641e56923be4b2d1ddc2ba4","observation_id":"a937b3b1-3da3-4f2c-85b5-b1d00b9a11ca","resolution":{"observed_at":"2026-08-11T15:49:32.563447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.551772Z","title":"Optimizing top-k document retrieval strategies for block-max indexes,","venue":null,"work_id":"f22bc2a1-ca52-4d57-8b0e-2ec359ae4a7b","year":2013},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.077127Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:74f6ef3e6a748a0e82e4e2a1ec0e5bafaad3894485d0ed3e38241f8736e80a6a","observation_id":"c16876f8-d402-46cf-9b2a-89294e65f677","resolution":{"observed_at":"2026-08-11T15:49:32.554562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.543266Z","title":"Heuristics to improve the BMW method and its variants,","venue":null,"work_id":"5702152c-fa7e-4d36-be3d-4044ad910be0","year":2015},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.080726Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:a951a234c61faffba15ed6c4cbbfe9b97dd66f763564908bce6e322245072141","observation_id":"c819f860-a2c1-48e6-bdb6-b1be3cd872df","resolution":{"observed_at":"2026-08-11T15:49:32.546579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.535143Z","title":"Faster blockmax wand with variable-sized blocks,","venue":null,"work_id":"d6027168-1749-4781-9c77-959810003fd6","year":2017},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.084413Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:04a72a48cbb9e4874f6c0ca10a9c5a3ef7f448c640bc836e5a2496733756ca64","observation_id":"5b90b106-600c-40c9-a921-74017c790125","resolution":{"observed_at":"2026-08-11T15:49:32.538265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.523908Z","title":"Accelerated query processing via similarity score prediction,","venue":null,"work_id":"636fa0d8-8703-4588-ab50-10212361a57b","year":2019},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.087685Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:ea415fe93ad62ff0fc16b4a86dd9d9d3993e0c37da7f22547d6a3435417809c1","observation_id":"2fc3792e-70c5-4c67-8beb-61406af0c24a","resolution":{"observed_at":"2026-08-11T15:49:32.528225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.512675Z","title":"Split-lists and initial thresholds for wand- based search,","venue":null,"work_id":"cdd4c037-31ae-45f9-b067-f9c50c6d433f","year":2018},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.091040Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:f153cb4fd399cda18a82ea5a18243161e9a3536bb4fcb410e4a43820b6ac2ea3","observation_id":"1d511280-e424-4516-b966-da00e5a9e7eb","resolution":{"observed_at":"2026-08-11T15:49:32.516894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.503397Z","title":"A candidate filtering mechanism for fast top-k query processing on modern cpus,","venue":null,"work_id":"acde2659-3f24-4422-8bb4-454d4f86eaba","year":2013},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.094377Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:faea899a4109fb6f78d4c8b14a5354d2a07d5b682b4171854981297aea1dbfb2","observation_id":"e907e40f-eef1-4cc0-9885-ce3ffa0e0253","resolution":{"observed_at":"2026-08-11T15:49:32.506741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.494464Z","title":"A comparison of top- k threshold estimation techniques for disjunctive query processing,","venue":null,"work_id":"3a9add80-56a0-4850-ad66-d464ff0a0f8b","year":2020},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.097967Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:df0887fd9141c3e710c84b1cd444e4cf18a4c6b32b185d69e3bccbd7f96e85da","observation_id":"bd36a20c-7524-49ab-9bf5-1ed07ead8c7a","resolution":{"observed_at":"2026-08-11T15:49:32.497896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.483163Z","title":"Selective search: Efficient and effective search of large textual collections,","venue":null,"work_id":"5890b17f-6837-46c3-8bc5-7bbc4afa7e1b","year":2015},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.101356Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:b93012ac947ad023ad96b1b49a69731f8d64719dd51c349ca3c4b4884cb8584a","observation_id":"9e37b11d-9b47-45e3-8934-c08790c5eb7f","resolution":{"observed_at":"2026-08-11T15:49:32.487486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.473299Z","title":"Multi-tier architecture for web search engines,","venue":null,"work_id":"1100a4c9-89e7-4e24-9557-d741ffc0568f","year":2003},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.105177Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:869b2bde0c1fcc6a803131310145fa3a270c232bd2451b841d569212befa2c95","observation_id":"a48861b1-26b5-4dc7-8228-b35efa935230","resolution":{"observed_at":"2026-08-11T15:49:32.476884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.461749Z","title":"Optimal web-scale tiering as a flow problem,","venue":null,"work_id":"fa9fde77-3de6-4f78-a31f-fe041d364af9","year":2010},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.109015Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:de1ff4a840b22d9ac26f2c1e0e6bf43d0f5b856b087accc744d43433bd0d0f15","observation_id":"1b9e62fb-85da-4e82-8cd1-949b7279d029","resolution":{"observed_at":"2026-08-11T15:49:32.466178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.451609Z","title":"Efficiency trade-offs in two-tier web search systems,","venue":null,"work_id":"bf39b289-c1a7-4c34-92fe-2f480ea5981f","year":2009},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.112935Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:b606b6867d864be93602abe6ceb729575e4b30e479f8f6b1e16bf9c7b82f2497","observation_id":"d824179c-fa3c-4628-9548-a54d07d0d8d1","resolution":{"observed_at":"2026-08-11T15:49:32.455057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.442690Z","title":"Taily: Shard selection using the tail of score distributions,","venue":null,"work_id":"ecfa22fe-4fa4-44ed-8133-0f590e8f62f6","year":2013},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.117015Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:6729bd7878b013f1381b5b8d6b2657b53fb611e63ee378aaaa2466e56eaca378","observation_id":"a7b92868-039a-443b-8164-88b97c967d40","resolution":{"observed_at":"2026-08-11T15:49:32.445854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.432675Z","title":"Caching scores for faster query process- ing with dynamic pruning in search engines,","venue":null,"work_id":"0de30406-7d4d-42b4-af20-527d5dea8dba","year":2019},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.121312Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:50b03e3a6286d820dda0d541ea0f16dd3b2a86602973a0643531854fb882cffc","observation_id":"78cd7fcc-e072-4498-bd94-a00649c6266b","resolution":{"observed_at":"2026-08-11T15:49:32.436113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.422228Z","title":"Sushi: Scoring scaled samples for server selection,","venue":null,"work_id":"dbe2bf37-c5bc-490f-b10b-9a787c8e47f0","year":2009},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.125286Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:1a90c498341cfc5cdee220f6405774d554be03c0da938f1e053dcc1bf3c18a31","observation_id":"81ecf668-6a97-41ee-a08f-21d0c384b8d1","resolution":{"observed_at":"2026-08-11T15:49:32.425842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.412605Z","title":"Optimal aggregation algorithms for middleware,","venue":null,"work_id":"224f649f-fc7d-4ca9-ae12-102d52dfd9a5","year":2001},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.129041Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:6f5e508780ad3d7aa6ee422ad79dcea79af7322786c26f95da69942b4d310b34","observation_id":"a6ee18fa-9ec9-4bbc-a5c8-be60959f5c66","resolution":{"observed_at":"2026-08-11T15:49:32.416030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.400745Z","title":"Fast first-phase candidate generation for cascading rankers,","venue":null,"work_id":"d58b740c-4300-43db-8ca9-830b4985f80c","year":2016},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.133037Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:270ce0a220642a0570820969cb86bb7244359d0cd29d00fbba0a088a2343fb45","observation_id":"525bee38-2d0f-41bd-b2d5-f8bdd7b82d54","resolution":{"observed_at":"2026-08-11T15:49:32.405462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.389297Z","title":"From doc2query to doctttttquery,","venue":null,"work_id":"a5dded1a-62e2-4e50-aa91-2ccf32dfc3b8","year":2019},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.136565Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:258d5dbc9bbd233d5b9dd01a68986d8bd2b3a31f8d71310f09bf2b805f6d9dd9","observation_id":"83f3a1d8-14ac-4d43-b466-f58fcb807c91","resolution":{"observed_at":"2026-08-11T15:49:32.393609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.378559Z","title":"Learning passage impacts for inverted indexes,","venue":null,"work_id":"ab84c9b4-9352-4253-ade1-109a179e469b","year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.140926Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:4cc041e02b003160ab641944305859e24967e7a19192d987a312e2e2344dc295","observation_id":"3d13e6f9-5383-46a0-a3d4-846a796cdf9c","resolution":{"observed_at":"2026-08-11T15:49:32.382721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.368643Z","title":"Shard ranking and cutoff estimation for topically partitioned collections,","venue":null,"work_id":"d10c1653-26d2-486c-97da-9a90137563e8","year":2012},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.144352Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:8e28ad7028fb18677ed97ad07200043c665c28c71bd1fe8eff8c726a143d4c00","observation_id":"0dd16db2-a8e6-4ef7-8a94-3c47e19efdad","resolution":{"observed_at":"2026-08-11T15:49:32.372230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.357611Z","title":"Using conjunctions for faster disjunctive top-k queries,","venue":null,"work_id":"f0b8dfb7-a7bc-43be-b1cd-99025b45e8b6","year":2022},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.148344Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:42697cddc92518e82e1c64daf494a17a4093199d493c5fcd8ba2019a72dd4a77","observation_id":"e82fe47e-4d4c-4f7d-9d4b-63a1a2300b4a","resolution":{"observed_at":"2026-08-11T15:49:32.361521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.346900Z","title":"Exploring the magic of wand,","venue":null,"work_id":"d4e9fafe-8db9-4c6b-81ea-71aec1c1427f","year":2013},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.152432Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:60496ddaebbaa01bb10c821fcf687bd1021eef4f76aaf3afc87d453472a3c17b","observation_id":"c87a6f95-4841-495a-bc58-03c1fd57b125","resolution":{"observed_at":"2026-08-11T15:49:32.350606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.336683Z","title":"Fast disjunctive candidate generation using live block filtering,","venue":null,"work_id":"5d374708-7566-4685-b776-66d27a0a3671","year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.156146Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:851ab31a8a97aa8d95dff49543f13ae526e2f5e8c8f48987be13c72dbc67e3b6","observation_id":"7b2a1e25-a467-4870-91e7-82e22c05474b","resolution":{"observed_at":"2026-08-11T15:49:32.340798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.327131Z","title":"COIL: revisit exact lexical match in information retrieval with contextualized inverted list,","venue":null,"work_id":"9bead902-fb6b-438f-b7dd-9230af148d68","year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.160066Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:ace0d60a2d94f7fa54d61967d134ecaf323f6573ac9df971a59a030f872a7b8d","observation_id":"aa6c9a18-dcab-45c7-89e5-3a41e84d9c7a","resolution":{"observed_at":"2026-08-11T15:49:32.330621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.14807","last_updated":"2021-06-28T15:30:42Z","snapshot_observed_at":"2026-08-16T18:13:56.515022Z","submitted_at":"2021-06-28T15:30:42Z","title":"A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniques","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.14807","snapshot_observed_at":"2026-08-11T15:49:32.164043Z","title":"A few brief notes on DeepImpact, COIL, and a conceptual framework for information retrieval techniques,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.164043Z"},"links":{"cited_paper":"/paper/2106.14807","citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:17c972151db7ef42ff890b9ac17a2f44b2f17724e5eda43591d00e81259dd46d","observation_id":"7a31375f-2358-46a4-b44b-c22d79b7288d","resolution":{"observed_at":"2026-08-11T15:49:32.164043Z","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-11T15:49:32.316783Z","title":"SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking,","venue":null,"work_id":"f67b3497-5b68-4092-b387-362da30e9e39","year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.167457Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:2b586cac7a0b90c1d4acbd82d7cd07a763454e128cfbdffea6a7542dcccdeaa9","observation_id":"70b00dae-bf9c-49f3-bc2c-c417b60ee40b","resolution":{"observed_at":"2026-08-11T15:49:32.320407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11540","last_updated":"2021-10-28T00:00:20Z","snapshot_observed_at":"2026-08-16T17:47:26.951470Z","submitted_at":"2021-10-22T00:48:38Z","title":"Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11540","snapshot_observed_at":"2026-08-11T15:49:32.170574Z","title":"Wacky weights in learned sparse representations and the revenge of score-at-a-time query evaluation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.170574Z"},"links":{"cited_paper":"/paper/2110.11540","citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:61e810f8be73e41c3526d8e236cc8e310e7c2877b59dcec8b652c1e37558731a","observation_id":"016448dc-e1dd-47c5-8c66-b64d2c642ef4","resolution":{"observed_at":"2026-08-11T15:49:32.170574Z","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-11T15:49:32.305083Z","title":"Faster learned sparse retrieval with guided traversal,","venue":null,"work_id":"be3b81be-41c5-4482-88d6-9593f9430814","year":2022},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.173686Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:7855cce2e36fca46a131c3cc2dd37e9614db08f9137050397e4672a3c986257e","observation_id":"fc6a6a5c-5e09-43dc-9d64-352205e36e2d","resolution":{"observed_at":"2026-08-11T15:49:32.309591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.293366Z","title":"Ioqp: A simple impact- ordered query processor written in rust,","venue":null,"work_id":"f89c5b86-9e39-43e5-9be9-b74132f8c1b8","year":2022},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.176444Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:4904d2559cff0ede9e4f05457e555544089e7db65e4aa73ac6cde44484ed0b8b","observation_id":"6749783b-d81b-48f1-a05f-e10d5eb3de63","resolution":{"observed_at":"2026-08-11T15:49:32.297776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.282246Z","title":"Accelerating learned sparse indexes via term impact decomposition,","venue":null,"work_id":"6f89372a-3f5a-4a41-a434-d994487adb6b","year":2022},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.179198Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:946177986d12c365a97d015b737330bb6f42273531c985f6b3e7b2e385a1b19d","observation_id":"36553a19-1207-4ddf-87b5-504c75931855","resolution":{"observed_at":"2026-08-11T15:49:32.286095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.271723Z","title":"PISA: performant indexes and search for academia,","venue":null,"work_id":"53fb26dc-f054-4354-82cc-3f9c61c9f4d3","year":2019},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.181798Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:7efdf39787369979e521f250e540b819722f44dd898c49e7684440491a3198bf","observation_id":"2151fbb8-db03-4e4b-88f6-a2955eecd9ef","resolution":{"observed_at":"2026-08-11T15:49:32.275477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.260545Z","title":"Quasi-succinct indices,","venue":null,"work_id":"1238ab5a-e322-4e27-a8ad-1c3c90103c6f","year":2013},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.184502Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:a5134e242409127f7401a23a41f0a1510edca233ee0672ffb2e13ee619b010b3","observation_id":"be7dbf93-c217-4cbf-a021-aa0003547a0f","resolution":{"observed_at":"2026-08-11T15:49:32.264326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.250421Z","title":"Ms marco: A human generated machine reading compre- hension dataset,","venue":null,"work_id":"7e80174e-e5b6-4ab2-9068-bb1438511b5f","year":2016},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.188503Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:f5f680c1898882ff3e6ce2900c0d628ed44ed884525a32f4eab98f9ccf92e26b","observation_id":"e0351b4e-6aa7-4152-b03c-34264402a50f","resolution":{"observed_at":"2026-08-11T15:49:32.254142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T15:49:32.238319Z","title":"A language modeling approach to information retrieval,","venue":null,"work_id":"40b78f38-e101-45f0-a62d-80837189403e","year":1998},"citing_paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T15:49:32.192408Z"},"links":{"citing_paper":"/paper/2412.10701"},"observation_digest":"sha256:e4114d47ed91fe5a5f1b9c2e74a53120d326239dd0b8646b293357743349f560","observation_id":"9bd107ea-00ff-40c4-acc4-4d8be917cf38","resolution":{"observed_at":"2026-08-11T15:49:32.243952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.10701","last_updated":"2024-12-14T06:18:19Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-11T23:33:30.957939Z","submitted_at":"2024-12-14T06:18:19Z","title":"Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":35},"total_outbound_references":37},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2412.10701."}