{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T15:16:09Z","timestamp":1766934969472,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Italian Government","award":["Forelab Departments of Excellence"],"award-info":[{"award-number":["Forelab Departments of Excellence"]}]},{"name":"European Union ? NextGenerationEU","award":["Spoke FutureHPC & BigData' of the ICSC ? Centro Nazionale di Ricerca in High-Performance Computing, Big Data and Quantum Computing"],"award-info":[{"award-number":["Spoke FutureHPC & BigData' of the ICSC ? Centro Nazionale di Ricerca in High-Performance Computing, Big Data and Quantum Computing"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,22]]},"DOI":"10.1145\/3573128.3604896","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T10:15:41Z","timestamp":1691144141000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Static Pruning for Multi-Representation Dense Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5377-8737","authenticated-orcid":false,"given":"Antonio","family":"Acquavia","sequence":"first","affiliation":[{"name":"University of Pisa, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3143-279X","authenticated-orcid":false,"given":"Craig","family":"Macdonald","sequence":"additional","affiliation":[{"name":"University of Glasgow, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7427-1001","authenticated-orcid":false,"given":"Nicola","family":"Tonellotto","sequence":"additional","affiliation":[{"name":"University of Pisa, Italy"}]}],"member":"320","published-online":{"date-parts":[[2023,8,22]]},"reference":[{"volume-title":"Proc. SPIRE. 177--193","author":"Altin Soner","key":"e_1_3_2_1_1_1","unstructured":"Soner Altin, Ricardo Baeza-Yates, and B. Barla Cambazoglu. 2020. Pre-indexing Pruning Strategies. In Proc. SPIRE. 177--193."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094074"},{"key":"e_1_3_2_1_3_1","volume-title":"Design trade-offs for search engine caching. ACM TWEB 2","author":"Baeza-Yates Ricardo","year":"2008","unstructured":"Ricardo Baeza-Yates, Aristides Gionis, Flavio P. Junqueira, Vanessa Murdock, Vassilis Plachouras, and Fabrizio Silvestri. 2008. Design trade-offs for search engine caching. ACM TWEB 2 (2008), 20:1--20:28. Issue 4."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. InCoCo@NIPS.","author":"Bajaj Payal","year":"2016","unstructured":"Payal Bajaj, Daniel Campos, Nick Craswell, Li Deng, Jianfeng Gao, Xiaodong Liu, Rangan Majumder, Andrew McNamara, Bhaskar Mitra, Tri Nguyen, Mir Rosenberg, Xia Song, Alina Stoica, Saurabh Tiwary, and Tong Wang. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. In Proc. InCoCo@NIPS."},{"key":"e_1_3_2_1_5_1","unstructured":"Jo Kristian Bergum. 2021. Pretrained Transformer Language Models for Search - part 4. https:\/\/blog.vespa.ai\/pretrained-transformer-language-models-for-search-part-4\/"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71496-5_9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658377.1658378"},{"key":"e_1_3_2_1_8_1","volume-title":"Clarke","author":"B\u00fcttcher Stefan","year":"2006","unstructured":"Stefan B\u00fcttcher and Charles L. A. Clarke. 2006. A Document-Centric Approach to Static Index Pruning in Text Retrieval Systems. In Proc. CIKM. 182--189."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383958"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484061"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. TREC","author":"Craswell Nick","year":"2020","unstructured":"Nick Craswell, Bhaskar Mitra, Daniel Campos, and Emine Yilmaz. 2020. Overview of the TREC 2019 Deep Learning Track. In Proc. TREC 2019."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. TREC","author":"Craswell Nick","year":"2021","unstructured":"Nick Craswell, Bhaskar Mitra, Emine Yilmaz, and Daniel Campos. 2021. Overview of the TREC 2020 Deep Learning Track. In Proc. TREC 2020."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331303"},{"key":"e_1_3_2_1_15_1","volume-title":"Nascimento","author":"de Moura Edleno S.","year":"2005","unstructured":"Edleno S. de Moura, C\u00e9lia F. dos Santos, Daniel R. Fernandes, Altigran S. Silva, Pavel Calado, and Mario A. Nascimento. 2005. Improving Web Search Efficiency via a Locality Based Static Pruning Method. In Proc. WWW. 235--244."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. NAACL.","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proc. NAACL."},{"key":"e_1_3_2_1_17_1","unstructured":"Sebastian Hofst\u00e4tter and Allan Hanbury. 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. In OSIRRC@SIGIR."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462891"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401075"},{"key":"e_1_3_2_1_22_1","first-page":"167","article-title":"On Using Query Logs for Static Index Pruning","volume":"1","author":"Lam Hoang Thanh","year":"2010","unstructured":"Hoang Thanh Lam, Raffaele Perego, and Fabrizio Silvestri. 2010. On Using Query Logs for Static Index Pruning. In Proc. WI-IAT, Vol. 1. 167--170.","journal-title":"Proc. WI-IAT"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531835"},{"key":"e_1_3_2_1_24_1","volume-title":"Justified! A Recantation. SIGIR Forum 52, 2","author":"Lin Jimmy","year":"2019","unstructured":"Jimmy Lin. 2019. The Neural Hype, Justified! A Recantation. SIGIR Forum 52, 2 (2019)."},{"volume-title":"Pretrained Transformers for Text Ranking: BERT and Beyond","author":"Lin Jimmy","key":"e_1_3_2_1_25_1","unstructured":"Jimmy Lin, Rodrigo Nogueira, and Andrew Yates. 2021. Pretrained Transformers for Text Ranking: BERT and Beyond. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.repl4nlp-1.17"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401093"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401262"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331317"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482156"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. IIR.","author":"Macdonald Craig","year":"2021","unstructured":"Craig Macdonald, Nicola Tonellotto, and Iadh Ounis. 2021. On Single and Multiple Representations in Dense Passage Retrieval. In Proc. IIR."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148246"},{"key":"e_1_3_2_1_33_1","unstructured":"Rodrigo Nogueira and Kyunghyun Cho. 2019. Passage Re-ranking with BERT. arXiv:1901.04085"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277776"},{"key":"e_1_3_2_1_35_1","volume-title":"da Silva","author":"Rossi Cristian","year":"2013","unstructured":"Cristian Rossi, Edleno S. de Moura, Andre L. Carvalho, and Altigran S. da Silva. 2013. Fast Document-at-a-time Query Processing Using Two-tier Indexes. In Proc. SIGIR. 183--192."},{"key":"e_1_3_2_1_36_1","volume-title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. CoRR abs\/2112.01488","author":"Santhanam Keshav","year":"2021","unstructured":"Keshav Santhanam, Omar Khattab, Jon Saad-Falcon, Christopher Potts, and Matei Zaharia. 2021. ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. CoRR abs\/2112.01488 (2021). arXiv:2112.01488"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390359"},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. NeurIPS.","author":"Thakur Nandan","year":"2021","unstructured":"Nandan Thakur, Nils Reimers, Andreas R\u00fcckl\u00e9, Abhishek Srivastava, and Iryna Gurevych. 2021. BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In Proc. NeurIPS."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20161-5_54"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482162"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_2_1_42_1","first-page":"5776","article-title":"MiniLM: Deep self-attention distillation for task-agnostic compression of pre-trained transformers","volume":"33","author":"Wang Wenhui","year":"2020","unstructured":"Wenhui Wang, Furu Wei, Li Dong, Hangbo Bao, Nan Yang, and Ming Zhou. 2020. MiniLM: Deep self-attention distillation for task-agnostic compression of pre-trained transformers. In Proc. NeurIPS, Vol. 33. 5776--5788.","journal-title":"Proc. NeurIPS"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103026"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080809"},{"key":"e_1_3_2_1_45_1","volume-title":"Proc. ICLR.","author":"Xiong Lee","year":"2021","unstructured":"Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul Bennett, Junaid Ahmed, and Arnold Overwijk. 2021. Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In Proc. ICLR."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271800"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462880"}],"event":{"name":"DocEng '23: ACM Symposium on Document Engineering 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Limerick Ireland","acronym":"DocEng '23"},"container-title":["Proceedings of the ACM Symposium on Document Engineering 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573128.3604896","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3573128.3604896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:45:38Z","timestamp":1750178738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573128.3604896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,22]]},"references-count":47,"alternative-id":["10.1145\/3573128.3604896","10.1145\/3573128"],"URL":"https:\/\/doi.org\/10.1145\/3573128.3604896","relation":{},"subject":[],"published":{"date-parts":[[2023,8,22]]},"assertion":[{"value":"2023-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}