{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T18:08:59Z","timestamp":1784138939994,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T00:00:00Z","timestamp":1784419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,20]]},"DOI":"10.1145\/3805712.3809875","type":"proceedings-article","created":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:06:26Z","timestamp":1784135186000},"page":"3630-3634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Load-sensitive Selective Pruning in Dense Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5710-3795","authenticated-orcid":false,"given":"Maria Diana","family":"Calugaru","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1339-6983","authenticated-orcid":false,"given":"Federico","family":"Siciliano","sequence":"additional","affiliation":[{"name":"National Institute of Geophysics and Volcanology, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2364-2043","authenticated-orcid":false,"given":"Francesca","family":"Pezzuti","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7427-1001","authenticated-orcid":false,"given":"Nicola","family":"Tonellotto","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7669-9055","authenticated-orcid":false,"given":"Fabrizio","family":"Silvestri","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,19]]},"reference":[{"key":"e_1_3_2_1_1_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 Wang Tong. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. In Proc. InCoCo@NIPS."},{"key":"e_1_3_2_1_2_1","first-page":"379","article-title":"Load-sensitive selective pruning for distributed search","author":"Broccolo Daniele","year":"2013","unstructured":"Daniele Broccolo, Craig Macdonald, Salvatore Orlando, Iadh Ounis, Raffaele Perego, Fabrizio Silvestri, and Nicola Tonellotto. 2013a. Load-sensitive selective pruning for distributed search. In Proc. CIKM. 379-388.","journal-title":"Proc. CIKM."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02432-5_9"},{"key":"e_1_3_2_1_4_1","volume-title":"Scalability Challenges in Web Search Engines","author":"Cambazoglu Berkant","unstructured":"Berkant Cambazoglu and Ricardo Baeza-Yates. 2011. Scalability Challenges in Web Search Engines. Vol. 7. 27-50."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718538"},{"key":"e_1_3_2_1_6_1","first-page":"751","article-title":"Load-sensitive CPU Power Management for Web Search Engines","author":"Catena Matteo","year":"2015","unstructured":"Matteo Catena, Craig Macdonald, and Nicola Tonellotto. 2015. Load-sensitive CPU Power Management for Web Search Engines. In Proc. SIGIR. 751-754.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2681279"},{"key":"e_1_3_2_1_8_1","first-page":"4171","article-title":"BERT","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-HLT. 4171-4186.","journal-title":"Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proc. NAACL-HLT."},{"key":"e_1_3_2_1_9_1","first-page":"137","article-title":"Batch query processing for web search engines","author":"Ding Shuai","year":"2011","unstructured":"Shuai Ding, Josh Attenberg, Ricardo Baeza-Yates, and Torsten Suel. 2011. Batch query processing for web search engines. In Proc. WSDM. 137-146.","journal-title":"Proc. WSDM."},{"key":"e_1_3_2_1_10_1","first-page":"1318","article-title":"Dimension Importance Estimation for Dense Information Retrieval","author":"Faggioli Guglielmo","year":"2024","unstructured":"Guglielmo Faggioli, Nicola Ferro, Raffaele Perego, and Nicola Tonellotto. 2024. Dimension Importance Estimation for Dense Information Retrieval. In Proc. SIGIR. 1318-1328.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_11_1","first-page":"1139","article-title":"Scheduling queries across replicas","author":"Freire Ana","year":"2012","unstructured":"Ana Freire, Craig Macdonald, Nicola Tonellotto, Iadh Ounis, and Fidel Cacheda. 2012. Scheduling queries across replicas. In Proc. SIGIR. 1139-1140.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36973-5_37"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"e_1_3_2_1_14_1","first-page":"113","article-title":"Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling","author":"Hofst\u00e4tter Sebastian","year":"2021","unstructured":"Sebastian Hofst\u00e4tter, Sheng-Chieh Lin, Jheng-Hong Yang, Jimmy Lin, and Allan Hanbury. 2021. Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling. In Proc. SIGIR. 113-122.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_15_1","unstructured":"Gautier Izacard Mathilde Caron Lucas Hosseini Sebastian Riedel Piotr Bojanowski Armand Joulin and Edouard Grave. 2022. Unsupervised Dense Information Retrieval with Contrastive Learning. arXiv:2112.09118."},{"key":"e_1_3_2_1_16_1","first-page":"253","article-title":"Predictive parallelization: taming tail latencies in web search","author":"Jeon Myeongjae","year":"2014","unstructured":"Myeongjae Jeon, Saehoon Kim, Seung-won Hwang, Yuxiong He, Sameh Elnikety, Alan L. Cox, and Scott Rixner. 2014. Predictive parallelization: taming tail latencies in web search. In Proc. SIGIR. 253-262.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_18_1","unstructured":"Arman Khaledian Amirreza Ghadiridehkordi and Nariman Khaledian. 2025. PCA-RAG: Principal Component Analysis for Efficient Retrieval-Augmented Generation. arXiv:2504.08386."},{"key":"e_1_3_2_1_19_1","first-page":"30233","article-title":"Matryoshka Representation Learning","volume":"35","author":"Kusupati Aditya","year":"2022","unstructured":"Aditya Kusupati, Gantavya Bhatt, Aniket Rege, Matthew Wallingford, Aditya Sinha, Vivek Ramanujan, William Howard-Snyder, Kaifeng Chen, Sham Kakade, Prateek Jain, and Ali Farhadi. 2022. Matryoshka Representation Learning. In Proc. NeurIPS, Vol. 35. 30233-30249.","journal-title":"Proc. NeurIPS"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3160557"},{"key":"e_1_3_2_1_21_1","volume-title":"Lin","author":"Ma Xueguang","year":"2021","unstructured":"Xueguang Ma, Minghan Li, Kai Sun, Ji Xin, and Jimmy J. Lin. 2021. Simple and Effective Unsupervised Redundancy Elimination to Compress Dense Vectors for Passage Retrieval. In Proc. EMNLP."},{"key":"e_1_3_2_1_22_1","first-page":"621","article-title":"Learning to predict response times for online query scheduling","author":"Macdonald Craig","year":"2012","unstructured":"Craig Macdonald, Nicola Tonellotto, and Iadh Ounis. 2012. Learning to predict response times for online query scheduling. In Proc. SIGIR. 621-630.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_23_1","first-page":"86","article-title":"Index-Based Batch Query Processing Revisited","author":"Mackenzie Joel","year":"2023","unstructured":"Joel Mackenzie and Alistair Moffat. 2023. Index-Based Batch Query Processing Revisited. In Proc. ECIR. 86-100.","journal-title":"Proc. ECIR."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_25_1","unstructured":"Federico Siciliano Francesca Pezzuti Nicola Tonellotto and Fabrizio Silvestri. 2024. Static Pruning in Dense Retrieval using Matrix Decomposition. arXiv:2412.09983."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2064730.2064734"},{"key":"e_1_3_2_1_27_1","first-page":"63","article-title":"Efficient and effective retrieval using selective pruning","author":"Tonellotto Nicola","year":"2013","unstructured":"Nicola Tonellotto, Craig Macdonald, and Iadh Ounis. 2013. Efficient and effective retrieval using selective pruning. In Proc. WSDM. 63-72.","journal-title":"Proc. WSDM."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_2_1_29_1","first-page":"3125","article-title":"2D Matryoshka Training for Information Retrieval","author":"Wang Shuai","year":"2025","unstructured":"Shuai Wang, Shengyao Zhuang, Bevan Koopman, and Guido Zuccon. 2025. 2D Matryoshka Training for Information Retrieval. In Proc. SIGIR. 3125-3134.","journal-title":"Proc. SIGIR."},{"key":"e_1_3_2_1_30_1","first-page":"1154","article-title":"Pretrained Transformers for Text Ranking","author":"Yates Andrew","year":"2021","unstructured":"Andrew Yates, Rodrigo Nogueira, and Jimmy Lin. 2021. Pretrained Transformers for Text Ranking: BERT and Beyond. In Proc. WSDM. 1154-1156.","journal-title":"BERT and Beyond. In Proc. WSDM."},{"key":"e_1_3_2_1_31_1","unstructured":"Wayne Xin Zhao Jing Liu Ruiyang Ren and Ji-Rong Wen. 2022. Dense Text Retrieval based on Pretrained Language Models: A Survey. arXiv:2211.14876."},{"key":"e_1_3_2_1_32_1","volume-title":"Large Language Models for Information Retrieval: A Survey. ACM TOIS (Sept","author":"Zhu Yutao","year":"2025","unstructured":"Yutao Zhu, Huaying Yuan, Shuting Wang, Jiongnan Liu, Wenhan Liu, Chenlong Deng, Haonan Chen, Zheng Liu, Zhicheng Dou, and Ji-Rong Wen. 2025. Large Language Models for Information Retrieval: A Survey. ACM TOIS (Sept. 2025)."},{"key":"e_1_3_2_1_33_1","unstructured":"Shengyao Zhuang Shuai Wang Fabio Zheng Bevan Koopman and Guido Zuccon. 2025. Starbucks-v2: Improved Training for 2D Matryoshka Embeddings. arXiv:2410.13230."}],"event":{"name":"SIGIR '26: The 49th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Melbourne VIC Australia","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:32:05Z","timestamp":1784136725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3805712.3809875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,19]]},"references-count":33,"alternative-id":["10.1145\/3805712.3809875","10.1145\/3805712"],"URL":"https:\/\/doi.org\/10.1145\/3805712.3809875","relation":{},"subject":[],"published":{"date-parts":[[2026,7,19]]},"assertion":[{"value":"2026-07-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}