{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:56Z","timestamp":1750219796302,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":103,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,19]]},"DOI":"10.1145\/3539618.3591935","type":"proceedings-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:22:59Z","timestamp":1689726179000},"page":"2669-2680","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Metric-agnostic Ranking Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5030-709X","authenticated-orcid":false,"given":"Qingyao","family":"Ai","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1388-1423","authenticated-orcid":false,"given":"Xuanhui","family":"Wang","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2941-6240","authenticated-orcid":false,"given":"Michael","family":"Bendersky","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3308558.3313697"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3209978.3209985"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3209978.3209986"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 2305--2306","author":"Ai Qingyao","year":"2018","unstructured":"Qingyao Ai, Jiaxin Mao, Yiqun Liu, and W Bruce Croft. 2018c. Unbiased learning to rank: Theory and practice. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 2305--2306."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3341981.3344218"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/3439861"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1277741.1277902"},{"key":"e_1_3_2_1_8_1","volume-title":"Shallow pooling for sparse labels. arXiv preprint arXiv:2109.00062","author":"Arabzadeh Negar","year":"2021","unstructured":"Negar Arabzadeh, Alexandra Vtyurina, Xinyi Yan, and Charles LA Clarke. 2021. Shallow pooling for sparse labels. arXiv preprint arXiv:2109.00062 (2021)."},{"volume-title":"The 41st international acm sigir conference on research & development in information retrieval. 405--414.","author":"Biega Asia J","unstructured":"Asia J Biega, Krishna P Gummadi, and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In The 41st international acm sigir conference on research & development in information retrieval. 405--414.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-030-77980-1_34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/978-3-7908-2604-3_16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1137\/16M1080173"},{"volume-title":"Science and information theory","author":"Brillouin Leon","unstructured":"Leon Brillouin. 2013. Science and information theory. Courier Corporation.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Foundations and Trends in Machine Learning","volume":"8","author":"Bubeck S\u00e9bastien","year":"2017","unstructured":"S\u00e9bastien Bubeck. 2017. Convex Optimization: Algorithms and Complexity. Foundations and Trends in Machine Learning, Vol. 8 (2017)."},{"key":"e_1_3_2_1_15_1","volume-title":"Bias and the limits of pooling for large collections. Information retrieval","author":"Buckley Chris","year":"2007","unstructured":"Chris Buckley, Darrin Dimmick, Ian Soboroff, and Ellen Voorhees. 2007. Bias and the limits of pooling for large collections. Information retrieval, Vol. 10, 6 (2007), 491--508."},{"key":"e_1_3_2_1_16_1","volume-title":"The importance of pessimism in fixed-dataset policy optimization. arXiv preprint arXiv:2009.06799","author":"Buckman Jacob","year":"2020","unstructured":"Jacob Buckman, Carles Gelada, and Marc G Bellemare. 2020. The importance of pessimism in fixed-dataset policy optimization. arXiv preprint arXiv:2009.06799 (2020)."},{"key":"e_1_3_2_1_17_1","volume-title":"Learning to rank with nonsmooth cost functions. Advances in neural information processing systems","author":"Burges Christopher","year":"2006","unstructured":"Christopher Burges, Robert Ragno, and Quoc Le. 2006. Learning to rank with nonsmooth cost functions. Advances in neural information processing systems, Vol. 19 (2006), 193--200."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1102351.1102363"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/3511808.3557343"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_21_1","volume-title":"Joaquim Carreira, Jo ao Pedro Fonseca, Teresa Gomes, and Pedro Camacho.","author":"Carvalho Paula","year":"2021","unstructured":"Paula Carvalho, Danielle Caled, M\u00e1rio J Silva, Bruno Martins, Jo\u00e3o Paulo Carvalho, Joaquim Carreira, Jo ao Pedro Fonseca, Teresa Gomes, and Pedro Camacho. 2021. Assessing News Credibility: Misinformation Content Indicators. (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1645953.1646033"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/TKDE.2017.2739151"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2484028.2484071"},{"volume-title":"Aslib proceedings","author":"Cleverdon Cyril","unstructured":"Cyril Cleverdon. 1967. The Cranfield tests on index language devices. In Aslib proceedings. MCB UP Ltd.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/3404835.3462951"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.5555\/1622737.1622744"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. HCIR","author":"Cole Michael","year":"2009","unstructured":"Michael Cole, Jingjing Liu, Nicholas Belkin, Ralf Bierig, Jacek Gwizdka, C Liu, Jin Zhang, and X Zhang. 2009. Usefulness as the criterion for evaluation of interactive information retrieval. Proc. HCIR (2009), 1--4."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_30_1","volume-title":"Offline Reinforcement Learning with Pseudometric Learning. arXiv preprint arXiv:2103.01948","author":"Dadashi Robert","year":"2021","unstructured":"Robert Dadashi, Shideh Rezaeifar, Nino Vieillard, L\u00e9onard Hussenot, Olivier Pietquin, and Matthieu Geist. 2021. Offline Reinforcement Learning with Pseudometric Learning. arXiv preprint arXiv:2103.01948 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3077136.3080832"},{"key":"e_1_3_2_1_32_1","volume-title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL-HLT (1).","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 NAACL-HLT (1)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/860435.860550"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/1014052.1014067"},{"key":"e_1_3_2_1_35_1","volume-title":"international conference on machine learning. PMLR, 1050--1059","author":"Gal Yarin","year":"2016","unstructured":"Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning. PMLR, 1050--1059."},{"key":"e_1_3_2_1_36_1","volume-title":"Few-shot learning with graph neural networks. arXiv preprint arXiv:1711.04043","author":"Garcia Victor","year":"2017","unstructured":"Victor Garcia and Joan Bruna. 2017. Few-shot learning with graph neural networks. arXiv preprint arXiv:1711.04043 (2017)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.5555\/188490.188560"},{"volume-title":"Deep learning","author":"Goodfellow Ian","unstructured":"Ian Goodfellow, Yoshua Bengio, and Aaron Courville. 2016. Deep learning. MIT press.","key":"e_1_3_2_1_38_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1145\/1718487.1718515"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1007\/978-3-642-00958-7_28"},{"key":"e_1_3_2_1_41_1","article-title":"Stochastic variational inference","volume":"14","author":"Hoffman Matthew D","year":"2013","unstructured":"Matthew D Hoffman, David M Blei, Chong Wang, and John Paisley. 2013. Stochastic variational inference. Journal of Machine Learning Research, Vol. 14, 5 (2013).","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/3331184.3331269"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1561\/9781680833690"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/582415.582418"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/2854946.2855005"},{"key":"e_1_3_2_1_46_1","volume-title":"Beyond greedy ranking: Slate optimization via list-CVAE. arXiv preprint arXiv:1803.01682","author":"Jiang Ray","year":"2018","unstructured":"Ray Jiang, Sven Gowal, Timothy A Mann, and Danilo J Rezende. 2018. Beyond greedy ranking: Slate optimization via list-CVAE. arXiv preprint arXiv:1803.01682 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1145\/775047.775067"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1145\/1150402.1150429"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1145\/3018661.3018699"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.5555\/1622737.1622748"},{"volume-title":"Effects of rank and precision of search results on users' evaluations of system performance","author":"Kelly Diane","unstructured":"Diane Kelly, Xin Fu, and Chirag Shah. 2007. Effects of rank and precision of search results on users' evaluations of system performance. University of North Carolina (2007).","key":"e_1_3_2_1_51_1"},{"key":"e_1_3_2_1_52_1","volume-title":"Latency and Engagement in Large-scale Recommendation Systems. In Fifteenth ACM Conference on Recommender Systems. 559--561","author":"Khandelwal Hitesh","year":"2021","unstructured":"Hitesh Khandelwal, Viet Ha-Thuc, Avishek Dutta, Yining Lu, Nan Du, Zhihao Li, and Qi Hu. 2021. Jointly Optimize Capacity, Latency and Engagement in Large-scale Recommendation Systems. In Fifteenth ACM Conference on Recommender Systems. 559--561."},{"key":"e_1_3_2_1_53_1","volume-title":"International Conference on Machine Learning. PMLR, 5436--5446","author":"Kristiadi Agustinus","year":"2020","unstructured":"Agustinus Kristiadi, Matthias Hein, and Philipp Hennig. 2020. Being bayesian, even just a bit, fixes overconfidence in relu networks. In International Conference on Machine Learning. PMLR, 5436--5446."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1145\/2600428.2609631"},{"key":"e_1_3_2_1_55_1","volume-title":"Proceedings of the 2018 World Wide Web Conference. 1533--1542","author":"Liu Mengyang","year":"2018","unstructured":"Mengyang Liu, Yiqun Liu, Jiaxin Mao, Cheng Luo, Min Zhang, and Shaoping Ma. 2018. \"Satisfaction with Failure\" or\" Unsatisfied Success\" Investigating the Relationship between Search Success and User Satisfaction. In Proceedings of the 2018 World Wide Web Conference. 1533--1542."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1561\/1500000016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_57_1","DOI":"10.1145\/2766462.2767721"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1145\/1081870.1081950"},{"key":"e_1_3_2_1_59_1","volume-title":"Learning-to-Rank with Partitioned Preference: Fast Estimation for the Plackett-Luce Model. In International Conference on Artificial Intelligence and Statistics. PMLR, 928--936","author":"Ma Jiaqi","year":"2021","unstructured":"Jiaqi Ma, Xinyang Yi, Weijing Tang, Zhe Zhao, Lichan Hong, Ed Chi, and Qiaozhu Mei. 2021. Learning-to-Rank with Partitioned Preference: Fast Estimation for the Plackett-Luce Model. In International Conference on Artificial Intelligence and Statistics. PMLR, 928--936."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_60_1","DOI":"10.1145\/2911451.2911507"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_61_1","DOI":"10.1145\/1076034.1076115"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_62_1","DOI":"10.1145\/3397271.3401100"},{"unstructured":"Vinod Nair and Geoffrey E Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In Icml.","key":"e_1_3_2_1_63_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_64_1","DOI":"10.1145\/2806416.2806488"},{"key":"e_1_3_2_1_65_1","volume-title":"Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness. arXiv preprint arXiv:2105.00855","author":"Oosterhuis Harrie","year":"2021","unstructured":"Harrie Oosterhuis. 2021. Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness. arXiv preprint arXiv:2105.00855 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_66_1","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_1_67_1","volume-title":"Workshop on Automatic Machine Learning. PMLR, 75--82","author":"Orabona Francesco","year":"2016","unstructured":"Francesco Orabona and D\u00e1vid P\u00e1l. 2016. Parameter-Free Convex Learning through Coin Betting. In Workshop on Automatic Machine Learning. PMLR, 75--82."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_68_1","DOI":"10.1145\/3397271.3401104"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_69_1","DOI":"10.1145\/3409256.3409819"},{"unstructured":"Sachin Ravi and Hugo Larochelle. 2016. Optimization as a model for few-shot learning. (2016).","key":"e_1_3_2_1_70_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_71_1","DOI":"10.1002\/asi.4630270302"},{"key":"e_1_3_2_1_72_1","volume-title":"An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747","author":"Ruder Sebastian","year":"2016","unstructured":"Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016)."},{"key":"e_1_3_2_1_73_1","volume-title":"An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098","author":"Ruder Sebastian","year":"2017","unstructured":"Sebastian Ruder. 2017. An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098 (2017)."},{"volume-title":"Gaussian Markov random fields: theory and applications","author":"Rue Havard","unstructured":"Havard Rue and Leonhard Held. 2005. Gaussian Markov random fields: theory and applications. CRC press.","key":"e_1_3_2_1_74_1"},{"key":"e_1_3_2_1_75_1","volume-title":"Proceedings of the second conference on conceptions of library and information science (CoLIS 2). ACM New York, 201--218","author":"Saracevic Tefko","year":"1996","unstructured":"Tefko Saracevic. 1996. Relevance reconsidered. In Proceedings of the second conference on conceptions of library and information science (CoLIS 2). ACM New York, 201--218."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_76_1","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_1_77_1","volume-title":"Learning Rich Rankings. Advances in Neural Information Processing Systems","author":"Seshadri Arjun","year":"2020","unstructured":"Arjun Seshadri, Stephen Ragain, and Johan Ugander. 2020. Learning Rich Rankings. Advances in Neural Information Processing Systems (2020)."},{"unstructured":"Burr Settles. 2009. Active learning literature survey. (2009).","key":"e_1_3_2_1_78_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_79_1","DOI":"10.1145\/3219819.3220088"},{"volume-title":"Optimization for machine learning","author":"Sra Suvrit","unstructured":"Suvrit Sra, Sebastian Nowozin, and Stephen J Wright. 2012. Optimization for machine learning. Mit Press.","key":"e_1_3_2_1_80_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_81_1","DOI":"10.1109\/CVPR.2018.00131"},{"volume-title":"Reinforcement learning: An introduction","author":"Sutton Richard S","unstructured":"Richard S Sutton and Andrew G Barto. 2018. Reinforcement learning: An introduction. MIT press.","key":"e_1_3_2_1_82_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_83_1","DOI":"10.1145\/2983323.2983763"},{"volume-title":"Simulated annealing: Theory and applications","author":"Van Laarhoven Peter JM","unstructured":"Peter JM Van Laarhoven and Emile HL Aarts. 1987. Simulated annealing. In Simulated annealing: Theory and applications. Springer, 7--15.","key":"e_1_3_2_1_84_1"},{"unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998--6008.","key":"e_1_3_2_1_85_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_86_1","DOI":"10.1002\/asi.22948"},{"key":"e_1_3_2_1_87_1","volume-title":"Workshop of the cross-language evaluation forum for european languages. Springer, 355--370","author":"Voorhees Ellen M","year":"2001","unstructured":"Ellen M Voorhees. 2001. The philosophy of information retrieval evaluation. In Workshop of the cross-language evaluation forum for european languages. Springer, 355--370."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_88_1","DOI":"10.1145\/3331184.3331264"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_89_1","DOI":"10.1145\/3209978.3210045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_90_1","DOI":"10.1109\/JAS.2017.7510583"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_91_1","DOI":"10.1145\/2911451.2911537"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_92_1","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_1_93_1","volume-title":"Uncertainty Weighted Actor-Critic for Offline Reinforcement Learning. arXiv preprint arXiv:2105.08140","author":"Wu Yue","year":"2021","unstructured":"Yue Wu, Shuangfei Zhai, Nitish Srivastava, Joshua Susskind, Jian Zhang, Ruslan Salakhutdinov, and Hanlin Goh. 2021. Uncertainty Weighted Actor-Critic for Offline Reinforcement Learning. arXiv preprint arXiv:2105.08140 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_94_1","DOI":"10.1145\/1390156.1390306"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_95_1","DOI":"10.1609\/aaai.v35i5.16579"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_96_1","DOI":"10.1145\/3340531.3412128"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_97_1","DOI":"10.1145\/3477495.3531948"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_98_1","DOI":"10.1145\/2661829.2661953"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_99_1","DOI":"10.1145\/1772690.1772793"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_100_1","DOI":"10.1145\/3278721.3278779"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_101_1","DOI":"10.1007\/978-3-540-78646-7_8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_102_1","DOI":"10.1145\/3394486.3403329"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_103_1","DOI":"10.1145\/1277741.1277835"}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"SIGIR '23","name":"SIGIR '23: The 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Taipei Taiwan"},"container-title":["Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539618.3591935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:38:07Z","timestamp":1750178287000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":103,"alternative-id":["10.1145\/3539618.3591935","10.1145\/3539618"],"URL":"https:\/\/doi.org\/10.1145\/3539618.3591935","relation":{},"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"2023-07-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}