{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T08:41:29Z","timestamp":1780389689395,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210104043"],"award-info":[{"award-number":["DP210104043"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,8]]},"DOI":"10.1145\/3701716.3715595","type":"proceedings-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T16:20:01Z","timestamp":1748017201000},"page":"1360-1364","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["ReSLLM: Large Language Models are Strong Resource Selectors for Federated Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0726-5250","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"first","affiliation":[{"name":"The University of Queensland, Brisbane, Queensland, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6711-0955","authenticated-orcid":false,"given":"Shengyao","family":"Zhuang","sequence":"additional","affiliation":[{"name":"CSIRO, Brisbane, Queensland, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5577-3391","authenticated-orcid":false,"given":"Bevan","family":"Koopman","sequence":"additional","affiliation":[{"name":"CSIRO, Brisbane, Queensland, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0271-5563","authenticated-orcid":false,"given":"Guido","family":"Zuccon","sequence":"additional","affiliation":[{"name":"The University of Queensland, Brisbane, Queensland, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-47019-5_5"},{"key":"e_1_3_2_1_2_1","volume-title":"Scaling instruction-finetuned language models","author":"Chung H. W.","year":"2022","unstructured":"H. W. Chung, L. Hou, S. Longpre, B. Zoph, Y. Tay, W. Fedus, E. Li, X. Wang, M. Dehghani, S. Brahma, A. Webson, S. S. Gu, Z. Dai, M. Suzgun, X. Chen, A. Chowdhery, S. Narang, G. Mishra, A. Yu, V. Zhao, Y. Huang, A. Dai, H. Yu, S. Petrov, E. H. Chi, J. Dean, J. Devlin, A. Roberts, D. Zhou, Q. V. Le, and J. Wei. Scaling instruction-finetuned language models, 2022. URL https:\/\/arxiv.org\/abs\/2210.11416."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080657"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"Text Retrieval Conference (TREC-2013)","author":"Demeester T.","year":"2013","unstructured":"T. Demeester, D. Trieschnigg, D. Nguyen, and D. Hiemstra. Overview of the trec 2013 federated web search track. In Text Retrieval Conference (TREC-2013), pages 1--11, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.500-308.federated-overview"},{"key":"e_1_3_2_1_6_1","volume-title":"TREC","author":"Di Buccio E.","year":"2014","unstructured":"E. Di Buccio, M. Melucci, et al. University of padua at trec 2014: Federated web search track. In TREC, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583360"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1108\/DTA-01-2019-0005"},{"key":"e_1_3_2_1_9_1","volume-title":"Time travel in llms: Tracing data contamination in large language models. arXiv preprint arXiv:2308.08493","author":"Golchin S.","year":"2023","unstructured":"S. Golchin and M. Surdeanu. Time travel in llms: Tracing data contamination in large language models. arXiv preprint arXiv:2308.08493, 2023."},{"key":"e_1_3_2_1_10_1","volume-title":"TREC","author":"Jin S.","year":"2014","unstructured":"S. Jin and M. Lan. Simple may be best-a simple and effective method for federated web search via search engine impact factor estimation. In TREC, 2014."},{"key":"e_1_3_2_1_11_1","volume-title":"Dspy: Compiling declarative language model calls into self-improving pipelines. arXiv preprint arXiv:2310.03714","author":"Khattab O.","year":"2023","unstructured":"O. Khattab, A. Singhvi, P. Maheshwari, Z. Zhang, K. Santhanam, S. Vardhamanan, S. Haq, A. Sharma, T. T. Joshi, H. Moazam, H. Miller, M. Zaharia, and C. Potts. Dspy: Compiling declarative language model calls into self-improving pipelines. arXiv preprint arXiv:2310.03714, 2023."},{"key":"e_1_3_2_1_12_1","volume-title":"Solar 10.7 b: Scaling large language models with simple yet effective depth up-scaling. arXiv preprint arXiv:2312.15166","author":"Kim D.","year":"2023","unstructured":"D. Kim, C. Park, S. Kim, W. Lee, W. Song, Y. Kim, H. Kim, Y. Kim, H. Lee, J. Kim, et al. Solar 10.7 b: Scaling large language models with simple yet effective depth up-scaling. arXiv preprint arXiv:2312.15166, 2023."},{"key":"e_1_3_2_1_13_1","first-page":"11","author":"Liu J.","year":"2022","unstructured":"J. Liu. LlamaIndex, 11 2022. URL https:\/\/github.com\/jerryjliu\/llama_index.","journal-title":"LlamaIndex"},{"key":"e_1_3_2_1_14_1","volume-title":"Data contamination: From memorization to exploitation. arXiv preprint arXiv:2203.08242","author":"Magar I.","year":"2022","unstructured":"I. Magar and R. Schwartz. Data contamination: From memorization to exploitation. arXiv preprint arXiv:2203.08242, 2022."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.04.008"},{"key":"e_1_3_2_1_16_1","volume-title":"Resource selection for federated search on the web. arXiv preprint arXiv:1609.04556","author":"Nguyen D.","year":"2016","unstructured":"D. Nguyen, T. Demeester, D. Trieschnigg, and D. Hiemstra. Resource selection for federated search on the web. arXiv preprint arXiv:1609.04556, 2016."},{"key":"e_1_3_2_1_17_1","volume-title":"Rankvicuna: Zero-shot listwise document reranking with open-source large language models. arXiv preprint arXiv:2309.15088","author":"Pradeep R.","year":"2023","unstructured":"R. Pradeep, S. Sharifymoghaddam, and J. Lin. Rankvicuna: Zero-shot listwise document reranking with open-source large language models. arXiv preprint arXiv:2309.15088, 2023."},{"key":"e_1_3_2_1_18_1","volume-title":"Large language models are effective text rankers with pairwise ranking prompting. arXiv preprint arXiv:2306.17563","author":"Qin Z.","year":"2023","unstructured":"Z. Qin, R. Jagerman, K. Hui, H. Zhuang, J. Wu, J. Shen, T. Liu, J. Liu, D. Metzler, X. Wang, et al. Large language models are effective text rankers with pairwise ranking prompting. arXiv preprint arXiv:2306.17563, 2023."},{"key":"e_1_3_2_1_19_1","volume-title":"Prompt engineering or fine tuning: An empirical assessment of large language models in automated software engineering tasks. arXiv preprint arXiv:2310.10508","author":"Shin J.","year":"2023","unstructured":"J. Shin, C. Tang, T. Mohati, M. Nayebi, S. Wang, and H. Hemmati. Prompt engineering or fine tuning: An empirical assessment of large language models in automated software engineering tasks. arXiv preprint arXiv:2310.10508, 2023."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000010"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860490"},{"key":"e_1_3_2_1_22_1","volume-title":"An investigation of prompt variations for zero-shot llm-based rankers. arXiv preprint arXiv:2406.14117","author":"Sun S.","year":"2024","unstructured":"S. Sun, S. Zhuang, S. Wang, and G. Zuccon. An investigation of prompt variations for zero-shot llm-based rankers. arXiv preprint arXiv:2406.14117, 2024."},{"key":"e_1_3_2_1_23_1","volume-title":"Stanford alpaca: An instruction-following llama model. https:\/\/github.com\/tatsu-lab\/stanford_alpaca","author":"Taori R.","year":"2023","unstructured":"R. Taori, I. Gulrajani, T. Zhang, Y. Dubois, X. Li, C. Guestrin, P. Liang, and T. B. Hashimoto. Stanford alpaca: An instruction-following llama model. https:\/\/github.com\/tatsu-lab\/stanford_alpaca, 2023."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572014"},{"key":"e_1_3_2_1_25_1","volume-title":"Large language models can accurately predict searcher preferences. arXiv preprint arXiv:2309.10621","author":"Thomas P.","year":"2023","unstructured":"P. Thomas, S. Spielman, N. Craswell, and B. Mitra. Large language models can accurately predict searcher preferences. arXiv preprint arXiv:2309.10621, 2023."},{"key":"e_1_3_2_1_26_1","volume-title":"Llama 2: Open foundation and fine-tuned chat models. arXiv preprint arXiv:2307.09288","author":"Touvron H.","year":"2023","unstructured":"H. Touvron, L. Martin, K. Stone, P. Albert, A. Almahairi, Y. Babaei, N. Bashlykov, S. Batra, P. Bhargava, S. Bhosale, et al. Llama 2: Open foundation and fine-tuned chat models. arXiv preprint arXiv:2307.09288, 2023."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-56027-9_25"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31624-2_5"},{"key":"e_1_3_2_1_29_1","volume-title":"C-pack: Packaged resources to advance general chinese embedding","author":"Xiao S.","year":"2023","unstructured":"S. Xiao, Z. Liu, P. Zhang, and N. Muennighoff. C-pack: Packaged resources to advance general chinese embedding, 2023."},{"key":"e_1_3_2_1_30_1","volume-title":"TREC","author":"Zhao H.","year":"2014","unstructured":"H. Zhao and X. Hu. Drexel at trec 2014 federated web search track. In TREC, 2014."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.findings-emnlp.590"},{"key":"e_1_3_2_1_32_1","volume-title":"A setwise approach for effective and highly efficient zero-shot ranking with large language models. arXiv preprint arXiv:2310.09497","author":"Zhuang S.","year":"2023","unstructured":"S. Zhuang, H. Zhuang, B. Koopman, and G. Zuccon. A setwise approach for effective and highly efficient zero-shot ranking with large language models. arXiv preprint arXiv:2310.09497, 2023."}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701716.3715595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701716.3715595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T03:07:51Z","timestamp":1759892871000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701716.3715595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":32,"alternative-id":["10.1145\/3701716.3715595","10.1145\/3701716"],"URL":"https:\/\/doi.org\/10.1145\/3701716.3715595","relation":{},"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"2025-05-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}