{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:40:08Z","timestamp":1768707608691,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Algorithms, Data Structures and Combinatorics for Machine Learning","award":["MIUR-PRIN 2017"],"award-info":[{"award-number":["MIUR-PRIN 2017"]}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["PNRR ECS00000017"],"award-info":[{"award-number":["PNRR ECS00000017"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Precision medicine & personalized healthcare"},{"name":"Tuscany Health Ecosystem","award":["PNRR PE00000013"],"award-info":[{"award-number":["PNRR PE00000013"]}]},{"name":"FAIR - Future Artificial Intelligence Research"},{"name":"Human-centered AI"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,10,1]]},"DOI":"10.1109\/tkde.2023.3267345","type":"journal-article","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T17:32:13Z","timestamp":1681493533000},"page":"10197-10209","source":"Crossref","is-referenced-by-count":3,"title":["An Optimal Algorithm for Finding Champions in Tournament Graphs"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4676-9777","authenticated-orcid":false,"given":"Lorenzo","family":"Beretta","sequence":"first","affiliation":[{"name":"Basic Algorithms Research Copenhagen (BARC), University of Copenhagen, København, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"National Research Council of Italy, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6753-3149","authenticated-orcid":false,"given":"Roberto","family":"Trani","sequence":"additional","affiliation":[{"name":"National Research Council of Italy, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9830-3936","authenticated-orcid":false,"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pisa, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"38:1","article-title":"Sorting with recurrent comparison errors","author":"geissmann","year":"2017","journal-title":"Proc Int Symp Algorithms Comput"},{"key":"ref12","article-title":"A reasonable social welfare function","author":"copeland","year":"1951","journal-title":"Notes Seminar Appl Math Social Sci"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22177-9_18"},{"key":"ref14","first-page":"49:1","article-title":"Optimal sorting with persistent comparison errors","author":"geissmann","year":"2019","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2332752"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702410053"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007887"},{"key":"ref33","first-page":"222","article-title":"Probabilistic computations: Toward a unified measure of complexity (extended abstract)","author":"yao","year":"1977","journal-title":"Proc 18th Annu Symp Found Comput Sci"},{"key":"ref10","first-page":"268","article-title":"Noisy sorting without resampling","author":"braverman","year":"2008","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"ref2","first-page":"87","article-title":"An efficient reduction of ranking to classification","author":"ailon","year":"2008","journal-title":"Proc Annu Conf Learn Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344218"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"ref16","article-title":"Searching for maximum out-degree vertices in tournaments","author":"gutin","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2008.12.002"},{"key":"ref18","article-title":"Approximate selection with unreliable comparisons in optimal expected time","author":"huang","year":"2022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272923"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"ref26","article-title":"MS MARCO: A human generated machine reading comprehension dataset","author":"nguyen","year":"2016","journal-title":"Proc Workshop Cogn Comput Integrating Neural Symbolic Approaches Co-Located 30th Annu Conf Neural Inf Process Syst"},{"key":"ref25","author":"moon","year":"1968","journal-title":"Topics on Tournaments"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_62"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00880-1"},{"key":"ref21","volume":"7","year":"1997","journal-title":"Tournament Solutions and Majority Voting"},{"key":"ref28","article-title":"Multi-stage document ranking with BERT","author":"nogueira","year":"2019"},{"key":"ref27","article-title":"Passage re-ranking with BERT","author":"nogueira","year":"2019"},{"key":"ref29","article-title":"Tournaments","author":"reid","year":"2013","journal-title":"Handbook of Graph Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.08.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32686-9_19"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2701427"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5176-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00649265"},{"key":"ref5","author":"baeza-yates","year":"1999","journal-title":"Modern Information Retrieval"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10251471\/10102661.pdf?arnumber=10102661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T18:12:11Z","timestamp":1696270331000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10102661\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,1]]},"references-count":33,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3267345","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,1]]}}}