{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:12:53Z","timestamp":1755839573680,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["A-0008064-00-00"],"award-info":[{"award-number":["A-0008064-00-00"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599482","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"1653-1664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Querywise Fair Learning to Rank through Multi-Objective Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7229-2944","authenticated-orcid":false,"given":"Debabrata","family":"Mahapatra","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4491-0594","authenticated-orcid":false,"given":"Chaosheng","family":"Dong","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4140-2350","authenticated-orcid":false,"given":"Michinari","family":"Momma","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Equity of attention: amortizing individual fairness in rankings. CoRR, abs\/1805.01788. arXiv","author":"Biega Asia J.","year":"1805","unstructured":"Asia J. Biega , Krishna P. Gummadi , and Gerhard Weikum . 2018. Equity of attention: amortizing individual fairness in rankings. CoRR, abs\/1805.01788. arXiv : 1805 .01788. Asia J. Biega, Krishna P. Gummadi, and Gerhard Weikum. 2018. Equity of attention: amortizing individual fairness in rankings. CoRR, abs\/1805.01788. arXiv: 1805.01788."},{"volume-title":"Convex Optimization","author":"Boyd Stephen","key":"e_1_3_2_2_2_1","unstructured":"Stephen Boyd and Lieven Vandenberghe . 2004. Convex Optimization . Cambridge University Press . Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-307-3.50012-5"},{"key":"e_1_3_2_2_5_1","volume-title":"Fairness and transparency in ranking. SIGIR Forum, 52, 2, (Jan","author":"Castillo Carlos","year":"2019","unstructured":"Carlos Castillo . 2019. Fairness and transparency in ranking. SIGIR Forum, 52, 2, (Jan . 2019 ), 64--71. Carlos Castillo. 2019. Fairness and transparency in ranking. SIGIR Forum, 52, 2, (Jan. 2019), 64--71."},{"key":"e_1_3_2_2_6_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2017","unstructured":"L. Elisa Celis , Damian Straszak , and Nisheeth K . Vishnoi . 2017 . Ranking with fairness constraints. CoRR , abs\/1704.06840. arXiv: 1704.06840. L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2017. Ranking with fairness constraints. CoRR, abs\/1704.06840. arXiv: 1704.06840."},{"key":"e_1_3_2_2_7_1","volume-title":"Xgboost: A scalable tree boosting system. CoRR, abs\/1603.02754. arXiv: 1603.02754.","author":"Chen Tianqi","year":"2016","unstructured":"Tianqi Chen and Carlos Guestrin . 2016 . Xgboost: A scalable tree boosting system. CoRR, abs\/1603.02754. arXiv: 1603.02754. Tianqi Chen and Carlos Guestrin. 2016. Xgboost: A scalable tree boosting system. CoRR, abs\/1603.02754. arXiv: 1603.02754."},{"volume-title":"Advances in Neural Information Processing Systems","author":"Chen Wei","key":"e_1_3_2_2_8_1","unstructured":"Wei Chen , Tie-yan Liu, Yanyan Lan , Zhi-ming Ma, and Hang Li. 2009. Ranking measures and loss functions in learning to rank . In Advances in Neural Information Processing Systems . Y. Bengio, D. Schuurmans, J. Lafferty, C. Williams, and A. Culotta, (Eds.) Vol. 22. Curran Associates, Inc. Wei Chen, Tie-yan Liu, Yanyan Lan, Zhi-ming Ma, and Hang Li. 2009. Ranking measures and loss functions in learning to rank. In Advances in Neural Information Processing Systems. Y. Bengio, D. Schuurmans, J. Lafferty, C. Williams, and A. Culotta, (Eds.) Vol. 22. Curran Associates, Inc."},{"key":"e_1_3_2_2_9_1","volume-title":"Research Report. INRIA, (June","author":"D\u00e9sid\u00e9ri Jean-Antoine","year":"2009","unstructured":"Jean-Antoine D\u00e9sid\u00e9ri . 2009 . Multiple-Gradient Descent Algorithm (MGDA) . Research Report. INRIA, (June 2009), 17. Jean-Antoine D\u00e9sid\u00e9ri. 2009. Multiple-Gradient Descent Algorithm (MGDA). Research Report. INRIA, (June 2009), 17."},{"key":"e_1_3_2_2_10_1","volume-title":"International Conference on Machine Learning.","author":"Dong Chaosheng","year":"2020","unstructured":"Chaosheng Dong and Bo Zeng . 2020 . Expert learning through generalized inverse multiobjective optimization: models, insights, and algorithms . In International Conference on Machine Learning. Chaosheng Dong and Bo Zeng. 2020. Expert learning through generalized inverse multiobjective optimization: models, insights, and algorithms. In International Conference on Machine Learning."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"e_1_3_2_2_12_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI machine learning repository. (2017).  Dheeru Dua and Casey Graff. 2017. UCI machine learning repository. (2017)."},{"key":"e_1_3_2_2_13_1","volume-title":"EDBT 2019","author":"Elbassuoni Shady","year":"2019","unstructured":"Shady Elbassuoni , Sihem Amer-Yahia , Christine El Atie , Ahmad Ghizzawi , and Bilel Oualha . 2019 . Exploring fairness of ranking in online job marketplaces. In Advances in Database Technology - 22nd International Conference on Extending Database Technology , EDBT 2019 , Lisbon, Portugal, March 26--29 , 2019. Melanie Herschel, Helena Galhardas, Berthold Reinwald, Irini Fundulaki, Carsten Binnig, and Zoi Kaoudi, (Eds.) OpenProceedings.org, 646--649. Shady Elbassuoni, Sihem Amer-Yahia, Christine El Atie, Ahmad Ghizzawi, and Bilel Oualha. 2019. Exploring fairness of ranking in online job marketplaces. In Advances in Database Technology - 22nd International Conference on Extending Database Technology, EDBT 2019, Lisbon, Portugal, March 26--29, 2019. Melanie Herschel, Helena Galhardas, Berthold Reinwald, Irini Fundulaki, Carsten Binnig, and Zoi Kaoudi, (Eds.) OpenProceedings.org, 646--649."},{"key":"e_1_3_2_2_14_1","article-title":"Greedy function approximation: a gradient boosting machine","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001 . Greedy function approximation: a gradient boosting machine . Annals of statistics, 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics, 1189--1232.","journal-title":"Annals of statistics, 1189--1232."},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17)","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke , Qi Meng , Thomas Finley , Taifeng Wang , Wei Chen , Weidong Ma , Qiwei Ye , and Tie-Yan Liu . 2017 . Lightgbm: a highly efficient gradient boosting decision tree . In Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17) . Curran Associates Inc., Long Beach, California, USA, 3149--3157. Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. Lightgbm: a highly efficient gradient boosting decision tree. In Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17). Curran Associates Inc., Long Beach, California, USA, 3149--3157."},{"volume-title":"Advances in Neural Information Processing Systems","author":"Ke Guolin","key":"e_1_3_2_2_16_1","unstructured":"Guolin Ke , Qi Meng , Thomas Finley , Taifeng Wang , Wei Chen , Weidong Ma , Qiwei Ye , and Tie-Yan Liu . 2017. Lightgbm: a highly efficient gradient boosting decision tree . In Advances in Neural Information Processing Systems . I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, (Eds.) Vol. 30. Curran Associates, Inc. Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. Lightgbm: a highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems. I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, (Eds.) Vol. 30. Curran Associates, Inc."},{"key":"e_1_3_2_2_17_1","first-page":"1","article-title":"Ancestral gumbel-topk sampling for sampling without replacement","volume":"21","author":"Kool Wouter","year":"2020","unstructured":"Wouter Kool , Herke van Hoof , and Max Welling . 2020 . Ancestral gumbel-topk sampling for sampling without replacement . Journal of Machine Learning Research , 21 , 47, 1 -- 36 . Wouter Kool, Herke van Hoof, and Max Welling. 2020. Ancestral gumbel-topk sampling for sampling without replacement. Journal of Machine Learning Research, 21, 47, 1--36.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512247"},{"volume-title":"Advances in Neural Information Processing Systems.","author":"Lin Xi","key":"e_1_3_2_2_19_1","unstructured":"Xi Lin , Hui-Ling Zhen , Zhenhua Li , Qing-Fu Zhang , and Sam Kwong . 2019. Pareto multi-task learning . In Advances in Neural Information Processing Systems. Vol. 32 . Curran Associates, Inc. Xi Lin, Hui-Ling Zhen, Zhenhua Li, Qing-Fu Zhang, and Sam Kwong. 2019. Pareto multi-task learning. In Advances in Neural Information Processing Systems. Vol. 32. Curran Associates, Inc."},{"key":"e_1_3_2_2_20_1","volume-title":"Learning to rank for information retrieval. Found. Trends Inf. Retr., 3, 3, (Mar","author":"Liu Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu . 2009. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3, 3, (Mar . 2009 ), 225--331. Tie-Yan Liu. 2009. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3, 3, (Mar. 2009), 225--331."},{"volume-title":"Individual choice behavior","author":"Luce R. Duncan","key":"e_1_3_2_2_21_1","unstructured":"R. Duncan Luce . 1959. Individual choice behavior ; a theoretical analysis. Wiley , New York . R. Duncan Luce. 1959. Individual choice behavior; a theoretical analysis. Wiley, New York."},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of the 29th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.","author":"Mahapatra Debabrata","year":"2023","unstructured":"Debabrata Mahapatra , Chaosheng Dong , Yetian Chen , and Michinari Momma . 2023 . Multi-label learning to rank through multi-objective optimization . In Proceedings of the 29th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Debabrata Mahapatra, Chaosheng Dong, Yetian Chen, and Michinari Momma. 2023. Multi-label learning to rank through multi-objective optimization. In Proceedings of the 29th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining."},{"key":"e_1_3_2_2_23_1","unstructured":"Debabrata Mahapatra and Vaibhav Rajan. 2021. Exact pareto optimal search for multi-task learning: touring the pareto front. (2021). arXiv: 2108.00597.  Debabrata Mahapatra and Vaibhav Rajan. 2021. Exact pareto optimal search for multi-task learning: touring the pareto front. (2021). arXiv: 2108.00597."},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning.","author":"Mahapatra Debabrata","year":"2020","unstructured":"Debabrata Mahapatra and Vaibhav Rajan . 2020 . Multi-task learning with user preferences: gradient descent with controlled ascent in pareto optimization . In Proceedings of the 37th International Conference on Machine Learning. Debabrata Mahapatra and Vaibhav Rajan. 2020. Multi-task learning with user preferences: gradient descent with controlled ascent in pareto optimization. In Proceedings of the 37th International Conference on Machine Learning."},{"key":"e_1_3_2_2_25_1","unstructured":"Omid Memarrast Ashkan Rezaei Rizal Fathony and Brian Ziebart. 2021. Fairness for robust learning to rank. arXiv preprint arXiv:2112.06288.  Omid Memarrast Ashkan Rezaei Rizal Fathony and Brian Ziebart. 2021. Fairness for robust learning to rank. arXiv preprint arXiv:2112.06288."},{"key":"e_1_3_2_2_26_1","series-title":"International series in operations research and management science","volume-title":"Nonlinear multiobjective optimization","author":"Miettinen Kaisa","unstructured":"Kaisa Miettinen . 1998. Nonlinear multiobjective optimization . International series in operations research and management science . Vol. 12 . Kluwer . Kaisa Miettinen. 1998. Nonlinear multiobjective optimization. International series in operations research and management science. Vol. 12. Kluwer."},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 39th International Conference on Machine Learning.","author":"Momma Michinari","year":"2022","unstructured":"Michinari Momma , Chaosheng Dong , and Jia Liu . 2022 . A multi-objective \/ multi-task learning framework induced by pareto stationarity . In Proceedings of the 39th International Conference on Machine Learning. Michinari Momma, Chaosheng Dong, and Jia Liu. 2022. A multi-objective \/ multi-task learning framework induced by pareto stationarity. In Proceedings of the 39th International Conference on Machine Learning."},{"key":"e_1_3_2_2_28_1","volume-title":"The Web Conference","author":"Momma Michinari","year":"2020","unstructured":"Michinari Momma , Ali Bagheri Garakani , Nanxun Ma , and Yi Sun . 2020 . Multiobjective relevance ranking via constrained optimization . In The Web Conference 2020. Michinari Momma, Ali Bagheri Garakani, Nanxun Ma, and Yi Sun. 2020. Multiobjective relevance ranking via constrained optimization. In The Web Conference 2020."},{"key":"e_1_3_2_2_29_1","volume-title":"Alireza Bagheri Garakani, and Yi Sun","author":"Momma Michinari","year":"2019","unstructured":"Michinari Momma , Alireza Bagheri Garakani, and Yi Sun . 2019 . Multi-objective relevance ranking. In eCOM@ SIGIR. Michinari Momma, Alireza Bagheri Garakani, and Yi Sun. 2019. Multi-objective relevance ranking. In eCOM@ SIGIR."},{"key":"e_1_3_2_2_30_1","unstructured":"Adam Paszke et al. 2019. Pytorch: an imperative style high-performance deep learning library. In Advances in Neural Information Processing Systems 32. H. Wallach H. Larochelle A. Beygelzimer F. d'Alch\u00e9-Buc E. Fox and R. Garnett (Eds.) Curran Associates Inc. 8024--8035.  Adam Paszke et al. 2019. Pytorch: an imperative style high-performance deep learning library. In Advances in Neural Information Processing Systems 32. H. Wallach H. Larochelle A. Beygelzimer F. d'Alch\u00e9-Buc E. Fox and R. Garnett (Eds.) Curran Associates Inc. 8024--8035."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_2_32_1","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. CoRR abs\/ 1306.2597.  Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. CoRR abs\/ 1306.2597."},{"key":"e_1_3_2_2_33_1","unstructured":"Sebastian Ruder. 2017. An overview of multi-task learning in deep neural networks. CoRR abs\/1706.05098. arXiv: 1706.05098.  Sebastian Ruder. 2017. An overview of multi-task learning in deep neural networks. CoRR abs\/1706.05098. arXiv: 1706.05098."},{"volume-title":"Advances in Neural Information Processing Systems.","author":"Sener Ozan","key":"e_1_3_2_2_34_1","unstructured":"Ozan Sener and Vladlen Koltun . 2018. Multi-task learning as multi-objective optimization . In Advances in Neural Information Processing Systems. Vol. 31 . Curran Associates, Inc. Ozan Sener and Vladlen Koltun. 2018. Multi-task learning as multi-objective optimization. In Advances in Neural Information Processing Systems. Vol. 31. Curran Associates, Inc."},{"key":"e_1_3_2_2_35_1","volume-title":"Equality of Opportunity in Rankings. In Workshop on Prioritizing Online Content (WPOC) at NIPs.","author":"Singh Ashudeep","year":"2017","unstructured":"Ashudeep Singh and Thorsten Joachims . 2017 . Equality of Opportunity in Rankings. In Workshop on Prioritizing Online Content (WPOC) at NIPs. Ashudeep Singh and Thorsten Joachims. 2017. Equality of Opportunity in Rankings. In Workshop on Prioritizing Online Content (WPOC) at NIPs."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc.","key":"e_1_3_2_2_37_1","unstructured":"2019. Policy learning for fairness in ranking . Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc. , Red Hook, NY, USA, 11 pages. 2019. Policy learning for fairness in ranking. Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc., Red Hook, NY, USA, 11 pages."},{"key":"e_1_3_2_2_38_1","unstructured":"Ryosuke Sonoda. 2021. A pre-processing method for fairness in ranking. CoRR abs\/2110.15503. arXiv: 2110.15503.  Ryosuke Sonoda. 2021. A pre-processing method for fairness in ranking. CoRR abs\/2110.15503. arXiv: 2110.15503."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2926725"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"The Journal of the Royal Aeronautical Society 1954 58 Statistical theory of extreme values and some practical applications. lectures by emit j. gumbel. national bureau of standards washington 1954. 51 pp. diagrams. 40 cents","DOI":"10.1017\/S0368393100099958"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Ralph E. Steuer. 1989. The Tchebycheff procedure of interactive multiple objective programming. In Multiple Criteria Decision Making and Risk Analysis Using Microcomputers. Birsen Karpak and Stanley Zionts (Eds.) Springer.  Ralph E. Steuer. 1989. The Tchebycheff procedure of interactive multiple objective programming. In Multiple Criteria Decision Making and Risk Analysis Using Microcomputers. Birsen Karpak and Stanley Zionts (Eds.) Springer.","DOI":"10.1007\/978-3-642-74919-3_8"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2012.03.028"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462953"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"},{"key":"e_1_3_2_2_48_1","volume-title":"Article 118, (Dec.","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike , Ke Yang , and Julia Stoyanovich . 2022. Fairness in ranking, part i: score-based ranking. ACM Comput. Surv., 55, 6 , Article 118, (Dec. 2022 ), 36 pages. Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022. Fairness in ranking, part i: score-based ranking. ACM Comput. Surv., 55, 6, Article 118, (Dec. 2022), 36 pages."},{"key":"e_1_3_2_2_49_1","volume-title":"Article 117, (Dec.","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike , Ke Yang , and Julia Stoyanovich . 2022. Fairness in ranking, part ii: learning-to-rank and recommender systems. ACM Comput. Surv., 55, 6 , Article 117, (Dec. 2022 ), 41 pages. Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022. Fairness in ranking, part ii: learning-to-rank and recommender systems. ACM Comput. Surv., 55, 6, Article 117, (Dec. 2022), 41 pages."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Long Beach CA USA","acronym":"KDD '23"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":49,"alternative-id":["10.1145\/3580305.3599482","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599482","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}