{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:20:05Z","timestamp":1725614405097},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1145\/3121050.3121095","type":"proceedings-article","created":{"date-parts":[[2017,9,29]],"date-time":"2017-09-29T08:48:56Z","timestamp":1506674936000},"page":"277-280","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Merge-Tie-Judge<\/i>"],"prefix":"10.1145","author":[{"given":"Kai","family":"Hui","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Klaus","family":"Berberich","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2017,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"N. Ailon and M. Mohri. An efficient reduction of ranking to classification. arXiv preprint arXiv:0710.2889 2007. N. Ailon and M. Mohri. An efficient reduction of ranking to classification. arXiv preprint arXiv:0710.2889 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484170"},{"key":"e_1_3_2_1_3_1","first-page":"16","volume-title":"ECIR '08","author":"Carterette B.","year":"2008"},{"key":"e_1_3_2_1_4_1","first-page":"626","volume-title":"ECIR '17","author":"Hui K.","year":"2017"},{"key":"e_1_3_2_1_5_1","first-page":"239","volume-title":"ECIR '17","author":"Hui K.","year":"2017"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396779"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348384"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935850"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199012)41:8<590::AID-ASI5>3.0.CO;2-T"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.02.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760185243"}],"event":{"name":"ICTIR '17: ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Amsterdam The Netherlands","acronym":"ICTIR '17"},"container-title":["Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3121050.3121095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T06:01:23Z","timestamp":1672984883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3121050.3121095"}},"subtitle":["Low-Cost Preference Judgments with Ties"],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":11,"alternative-id":["10.1145\/3121050.3121095","10.1145\/3121050"],"URL":"https:\/\/doi.org\/10.1145\/3121050.3121095","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]},"assertion":[{"value":"2017-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}