{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:30:59Z","timestamp":1759883459327,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":4,"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\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,8]]},"DOI":"10.1145\/3701716.3715507","type":"proceedings-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T16:06:11Z","timestamp":1748016371000},"page":"957-960","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["What is the Chance of Being so Unfair?"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8130-6631","authenticated-orcid":false,"given":"Hossein","family":"Esfandiari","sequence":"first","affiliation":[{"name":"Google Research, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-3181","authenticated-orcid":false,"given":"Samira","family":"Hossein Ghorban","sequence":"additional","affiliation":[{"name":"School of Computer Science, Institute for Research in Fundamental Sciences, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0928-7499","authenticated-orcid":false,"given":"Reza","family":"Hosseini Dolatabadi","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5866-6565","authenticated-orcid":false,"given":"Mahdi","family":"Qaempanah","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}]}],"member":"320","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433949"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_1_3_1","volume-title":"Fair Top-k Ranking with multiple protected groups. Information processing & management","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Tom S\u00fchr, Ricardo Baeza-Yates, Francesco Bonchi, Carlos Castillo, and Sara Hajian. 2022. Fair Top-k Ranking with multiple protected groups. Information processing & management, Vol. 59, 1 (2022), 102707."},{"key":"e_1_3_2_1_4_1","volume-title":"Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000","author":"Zehlike Meike","year":"2021","unstructured":"Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2021. Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000 (2021)."}],"event":{"name":"WWW '25: The ACM Web Conference 2025","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Sydney NSW Australia","acronym":"WWW '25"},"container-title":["Companion Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701716.3715507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701716.3715507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T17:45:48Z","timestamp":1759859148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701716.3715507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":4,"alternative-id":["10.1145\/3701716.3715507","10.1145\/3701716"],"URL":"https:\/\/doi.org\/10.1145\/3701716.3715507","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"}}]}}