{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:50:19Z","timestamp":1783738219005,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,13]]},"DOI":"10.1145\/3726302.3730358","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T01:41:01Z","timestamp":1752457261000},"page":"4153-4156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["ReNeuIR at SIGIR 2025: The Fourth Workshop on Reaching Efficiency in Neural Information Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-8242","authenticated-orcid":false,"given":"Sebastian","family":"Bruch","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1003-981X","authenticated-orcid":false,"given":"Maik","family":"Fr\u00f6be","sequence":"additional","affiliation":[{"name":"Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4854-7249","authenticated-orcid":false,"given":"Tim","family":"Hagen","sequence":"additional","affiliation":[{"name":"University of Kassel and hessian.AI, Kassel, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-0665","authenticated-orcid":false,"given":"Martin","family":"Potthast","sequence":"additional","affiliation":[{"name":"University of Kassel, hessian.AI, and ScaDS.AI, Kassel, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Multi-Stage Search Architectures for Streaming Documents","author":"Asadi N.","year":"2013","unstructured":"N. Asadi. Multi-Stage Search Architectures for Streaming Documents. University of Maryland, 2013. Ph.D. Dissertation."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398656"},{"issue":"3","key":"e_1_3_2_1_3_1","first-page":"13","article-title":"Fast candidate generation for real-time tweet search with Bloom filter chains","volume":"31","author":"Asadi N.","unstructured":"N. Asadi and J. Lin. Fast candidate generation for real-time tweet search with Bloom filter chains. ACM Trans. Inf. Syst., 31(3):13.1-13.36, 2013.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484132"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36973-5_13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.73"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3267345"},{"key":"e_1_3_2_1_8_1","volume-title":"Report on the 1st workshop on reaching efficiency in neural information retrieval (ReNeuIR 2022) at SIGIR 2022. SIGIR Forum, 56(2)","author":"Bruch S.","year":"2022","unstructured":"S. Bruch, C. Lucchese, and F. M. Nardini. Report on the 1st workshop on reaching efficiency in neural information retrieval (ReNeuIR 2022) at SIGIR 2022. SIGIR Forum, 56(2), 2022."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531704"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000071"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591922"},{"key":"e_1_3_2_1_12_1","volume-title":"A proposed efficiency benchmark for modern information retrieval systems","author":"Bruch S.","year":"2023","unstructured":"S. Bruch, J. Mackenzie, M. Maistro, and F. M. Nardini. A proposed efficiency benchmark for modern information retrieval systems. 2023. URL https:\/\/reneuir.org\/assets\/pdfs\/ReNeuIR_2023_benchmark_proposal.pdf."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3331088"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718538"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462804"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015022.3015026"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36973-5_36"},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"15","article-title":"Fast ranking with additive ensembles of oblivious and non-oblivious regression trees","volume":"35","author":"Dato D.","unstructured":"D. Dato, C. Lucchese, F. M. Nardini, S. Orlando, R. Perego, N. Tonellotto, and R. Venturini. Fast ranking with additive ensembles of oblivious and non-oblivious regression trees. ACM Trans. Inf. Syst., 35(2):15.1-15.31, 2016.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_19_1","first-page":"236","volume-title":"Proc. ECIR","author":"Fr\u00f6be M.","unstructured":"M. Fr\u00f6be, M. Wiegmann, N. Kolyada, B. Grahm, T. Elstner, F. Loebe, M. Hagen, B. Stein, and M. Potthast. Continuous Integration for Reproducible Shared Tasks with TIRA.io. In Proc. ECIR, pages 236-241."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591888"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657994"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409256.3409838"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970398.2970433"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.repl4nlp-1.18"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401224"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. EMNLP Findings.","author":"Jiao X.","unstructured":"X. Jiao, Y. Yin, L. Shang, X. Jiang, X. Chen, L. Li, F. Wang, and Q. Liu. TinyBERT: Distilling BERT for natural language understanding. In Proc. EMNLP Findings."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531833"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2860982"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. NeurIPS","author":"Lewis P.","year":"2020","unstructured":"P. Lewis, E. Perez, A. Piktus, F. Petroni, V. Karpukhin, N. Goyal, H. K\u00fcttler, M. Lewis, W. Yih, T. Rockt\u00e4schel, S. Riedel, and D. Kiela. Retrieval-augmented generation for knowledge-intensive NLP tasks. In Proc. NeurIPS, 2020."},{"key":"e_1_3_2_1_31_1","volume-title":"Pretrained Transformers for Text Ranking: BERT and Beyond","author":"Lin J.","year":"2021","unstructured":"J. Lin, R. Nogueira, and A. Yates. Pretrained Transformers for Text Ranking: BERT and Beyond. Morgan & Claypool Publishers, 2021."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.64"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098011"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.425"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_37_1","first-page":"949","volume-title":"Proce. SIGIR","author":"Lucchese C.","year":"2016","unstructured":"C. Lucchese, F. M. Nardini, S. Orlando, R. Perego, F. Silvestri, and S. Trani. Postlearning optimization of tree ensembles for efficient ranking. In Proce. SIGIR, pages 949-952, 2016."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914758"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080725"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463254"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159676"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.205"},{"issue":"4","key":"e_1_3_2_1_43_1","article-title":"Efficient document-at-a-time and score-ata- time query evaluation for learned sparse representations","volume":"41","author":"Mackenzie J.","year":"2023","unstructured":"J. Mackenzie, A. Trotman, and J. Lin. Efficient document-at-a-time and score-ata- time query evaluation for learned sparse representations. ACM Trans. Inf. Syst., 41(4), 2023.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531774"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401266"},{"key":"e_1_3_2_1_46_1","volume-title":"Structured pruning of a BERT-based question answering model. arXiv:1910.06360","author":"McCarley J. S.","year":"2021","unstructured":"J. S. McCarley, R. Chakravarti, and A. Sil. Structured pruning of a BERT-based question answering model. arXiv:1910.06360, 2021."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463049"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3152585"},{"key":"e_1_3_2_1_49_1","volume-title":"Passage re-ranking with BERT. arXiv:1901.04085","author":"Nogueira R.","year":"2020","unstructured":"R. Nogueira and K. Cho. Passage re-ranking with BERT. arXiv:1901.04085, 2020."},{"key":"e_1_3_2_1_50_1","volume-title":"Multi-stage document ranking with BERT. arXiv:1910.14424","author":"Nogueira R.","year":"2019","unstructured":"R. Nogueira, W. Yang, K. Cho, and J. Lin. Multi-stage document ranking with BERT. arXiv:1910.14424, 2019."},{"key":"e_1_3_2_1_51_1","volume-title":"Document expansion by query prediction. arXiv:1904.08375","author":"Nogueira R.","year":"2019","unstructured":"R. Nogueira,W. Yang, J. Lin, and K. Cho. Document expansion by query prediction. arXiv:1904.08375, 2019."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.63"},{"key":"e_1_3_2_1_53_1","volume-title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. arXiv:1910.01108","author":"Sanh V.","year":"2020","unstructured":"V. Sanh, L. Debut, J. Chaumond, and T. Wolf. DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. arXiv:1910.01108, 2020."},{"key":"e_1_3_2_1_54_1","volume-title":"Moving beyond downstream task accuracy for information retrieval benchmarking. arXiv:2212.01340","author":"Santhanam K.","year":"2022","unstructured":"K. Santhanam, J. Saad-Falcon, M. Franz, O. Khattab, A. Sil, R. Florian, M. A. Sultan, S. Roukos, M. Zaharia, and C. Potts. Moving beyond downstream task accuracy for information retrieval benchmarking. arXiv:2212.01340, 2022."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531766"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.504"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1355"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009934"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.204"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.8"},{"key":"e_1_3_2_1_61_1","volume-title":"Proc. ICLR","author":"Xiong L.","year":"2021","unstructured":"L. Xiong, C. Xiong, Y. Li, K.-F. Tang, J. Liu, P. Bennett, J. Ahmed, and A. Overwijk. Approximate nearest neighbor negative contrastive learning for dense text retrieval. In Proc. ICLR, 2021."},{"key":"e_1_3_2_1_62_1","volume-title":"Proc. Workshop on ReNeuIR at SIGIR","author":"Zhuang S.","year":"2022","unstructured":"S. Zhuang and G. Zuccon. Fast passage re-ranking with contextualized exact term matching and efficient passage expansion. In Proc. Workshop on ReNeuIR at SIGIR, 2022."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578337.3605121"}],"event":{"name":"SIGIR '25: The 48th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Padua Italy","acronym":"SIGIR '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726302.3730358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:22:08Z","timestamp":1755868928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726302.3730358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":63,"alternative-id":["10.1145\/3726302.3730358","10.1145\/3726302"],"URL":"https:\/\/doi.org\/10.1145\/3726302.3730358","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}