{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:07:52Z","timestamp":1774310872190,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032213235","type":"print"},{"value":"9783032213242","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-21324-2_25","type":"book-chapter","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T08:37:19Z","timestamp":1774255039000},"page":"305-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Does Reasoning Make Search More Fair? Comparing Fairness in\u00a0Reasoning and\u00a0Non-reasoning Rerankers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1827-2023","authenticated-orcid":false,"given":"Saron","family":"Samuel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4328-4288","authenticated-orcid":false,"given":"Benjamin","family":"van Durme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0051-1535","authenticated-orcid":false,"given":"Eugene","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,24]]},"reference":[{"key":"25_CR1","unstructured":"Burke, R.: Multisided fairness for recommendation (2017). https:\/\/arxiv.org\/abs\/1707.00093"},{"key":"25_CR2","unstructured":"DeepSeek-AI, et al.: Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning (2025). https:\/\/arxiv.org\/abs\/2501.12948"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Diaz, F., Mitra, B., Ekstrand, M.D., Biega, A.J., Carterette, B.: Evaluating stochastic rankings with expected exposure. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management, CIKM \u201920, pp. 275\u2013284. ACM (2020). https:\/\/doi.org\/10.1145\/3340531.3411962,","DOI":"10.1145\/3340531.3411962"},{"key":"25_CR4","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness (2011). https:\/\/arxiv.org\/abs\/1104.3913"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ekstrand, M.D., McDonald, G., Raj, A., Johnson, I.: Overview of the trec 2022 fair ranking track (2023). https:\/\/arxiv.org\/abs\/2302.05558","DOI":"10.6028\/NIST.SP.500-338.fair-overview"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Fabris, A., et al.: Fairness and bias in algorithmic hiring: a multidisciplinary survey. ACM Trans. Intell. Syst. Technol. 16(1) (2025). ISSN 2157-6904. https:\/\/doi.org\/10.1145\/3696457","DOI":"10.1145\/3696457"},{"key":"25_CR7","unstructured":"Gao, Y., et al.: Retrieval-augmented generation for large language models: a survey (2024). https:\/\/arxiv.org\/abs\/2312.10997"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Grootendorst, M.: Keybert: Minimal keyword extraction with bert (2020). https:\/\/doi.org\/10.5281\/zenodo.4461265,","DOI":"10.5281\/zenodo.4461265"},{"key":"25_CR9","unstructured":"Holm, S.: A simple sequentially rejective multiple test procedure. Scandinavian J. Stat. 6(2), 65\u201370 (1979). ISSN 03036898, 14679469. http:\/\/www.jstor.org\/stable\/4615733"},{"key":"25_CR10","unstructured":"Lawrie, D., et al.: Overview of the trec 2023 neuclir track (2024). https:\/\/arxiv.org\/abs\/2404.08071"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lee, M.H.J., Lai, C.K.: Implicit bias-like patterns in reasoning models (2025). https:\/\/arxiv.org\/abs\/2503.11572","DOI":"10.21203\/rs.3.rs-7726631\/v1"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Li, Z., et al.: Split and merge: aligning position biases in llm-based evaluators. In: Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, pp. 11084\u201311108 (2024)","DOI":"10.18653\/v1\/2024.emnlp-main.621"},{"key":"25_CR13","unstructured":"Liu, W., et al.: Reasonrank: empowering passage ranking with strong reasoning ability (2025). https:\/\/arxiv.org\/abs\/2508.07050"},{"key":"25_CR14","unstructured":"Ma, X., Wang, L., Yang, N., Wei, F., Lin, J.: Fine-tuning llama for multi-stage text retrieval (2023). https:\/\/arxiv.org\/abs\/2310.08319"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Men\u00e9ndez, M.L., Pardo, J.A., Pardo, L., Pardo, M.C.: The Jensen\u2013Shannon divergence. J. Franklin Inst. 334(2), 307\u2013318 (1997). ISSN 0016-0032. https:\/\/doi.org\/10.1016\/S0016-0032(96)00063-4","DOI":"10.1016\/S0016-0032(96)00063-4"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Nogueira, R., Jiang, Z., Pradeep, R., Lin, J.: Document ranking with a pretrained sequence-to-sequence model. In: Cohn, T., He, Y., Liu, Y. (eds.) Findings of the Association for Computational Linguistics: EMNLP 2020, pp. 708\u2013718. Association for Computational Linguistics, Online (2020), https:\/\/doi.org\/10.18653\/v1\/2020.findings-emnlp.63","DOI":"10.18653\/v1\/2020.findings-emnlp.63"},{"key":"25_CR17","unstructured":"OpenAI, et al.: Gpt-4o system card (2024). https:\/\/arxiv.org\/abs\/2410.21276"},{"key":"25_CR18","unstructured":"Pradeep, R., Sharifymoghaddam, S., Lin, J.: Rankzephyr: effective and robust zero-shot listwise reranking is a breeze! (2023). https:\/\/arxiv.org\/abs\/2312.02724"},{"key":"25_CR19","unstructured":"Raj, A., Ekstrand, M.D.: Comparing fair ranking metrics (2022). https:\/\/arxiv.org\/abs\/2009.01311"},{"key":"25_CR20","unstructured":"Redi, M., Gerlach, M., Johnson, I., Morgan, J., Zia, L.: A taxonomy of knowledge gaps for wikimedia projects (second draft) (2021). https:\/\/arxiv.org\/abs\/2008.12314"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Robertson, S., Zaragoza, H.: The probabilistic relevance framework: Bm25 and beyond. Found. Trends Inf. Retr. 3(4), 333\u2013389 (2009). ISSN 1554-0669. https:\/\/doi.org\/10.1561\/1500000019","DOI":"10.1561\/1500000019"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Sapiezynski, P., Zeng, W., E\u00a0Robertson, R., Mislove, A., Wilson, C.: Quantifying the impact of user attention on fair group representation in ranked lists. In: Companion Proceedings of The 2019 World Wide Web Conference, WWW \u201919, pp. 553\u2013562. Association for Computing Machinery, New York (2019). ISBN 9781450366755. https:\/\/doi.org\/10.1145\/3308560.3317595,","DOI":"10.1145\/3308560.3317595"},{"issue":"6","key":"25_CR23","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/BF01068419","volume":"15","author":"DJ Schuirmann","year":"1987","unstructured":"Schuirmann, D.J.: A comparison of the two one-sided tests procedure and the power approach for assessing the equivalence of average bioavailability. J. Pharmacokinet. Biopharm. 15(6), 657\u2013680 (1987)","journal-title":"J. Pharmacokinet. Biopharm."},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Singh, A., Joachims, T.: Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201918, pp. 2219\u20132228. ACM (2018). https:\/\/doi.org\/10.1145\/3219819.3220088,","DOI":"10.1145\/3219819.3220088"},{"key":"25_CR25","unstructured":"Su, H., et al.: Bright: a realistic and challenging benchmark for reasoning-intensive retrieval (2025). https:\/\/arxiv.org\/abs\/2407.12883"},{"key":"25_CR26","unstructured":"Thakur, N., Reimers, N., R\u00fcckl\u00e9, A., Srivastava, A., Gurevych, I.: Beir: a heterogenous benchmark for zero-shot evaluation of information retrieval models (2021). https:\/\/arxiv.org\/abs\/2104.08663"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wu, X., Wu, H.T., Tao, Z., Fang, Y.: Do large language models rank fairly? An empirical study on the fairness of llms as rankers (2024). https:\/\/arxiv.org\/abs\/2404.03192","DOI":"10.18653\/v1\/2024.naacl-long.319"},{"key":"25_CR28","unstructured":"Weller, O., Ricci, K., Yang, E., Yates, A., Lawrie, D., Durme, B.V.: Rank1: test-time compute for reranking in information retrieval (2025). https:\/\/arxiv.org\/abs\/2502.18418"},{"key":"25_CR29","unstructured":"Yang, E., et al.: Rank-k: test-time reasoning for listwise reranking (2025). https:\/\/arxiv.org\/abs\/2505.14432"},{"key":"25_CR30","doi-asserted-by":"publisher","unstructured":"Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., Baeza-Yates, R.: Fa*ir: a fair top-k ranking algorithm. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM \u201917, pp. 1569\u20131578. ACM (2017). https:\/\/doi.org\/10.1145\/3132847.3132938","DOI":"10.1145\/3132847.3132938"},{"key":"25_CR31","unstructured":"Zhang, Y., et al.: Qwen3 embedding: advancing text embedding and reranking through foundation models (2025). https:\/\/arxiv.org\/abs\/2506.05176"},{"key":"25_CR32","unstructured":"Zhuang, S., Ma, X., Koopman, B., Lin, J., Zuccon, G.: Rank-r1: enhancing reasoning in llm-based document rerankers via reinforcement learning (2025). https:\/\/arxiv.org\/abs\/2503.06034"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-21324-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:12:20Z","timestamp":1774307540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21324-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032213235","9783032213242"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21324-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2026.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}