{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:45:52Z","timestamp":1775177152107,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"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":[[2009,7,19]]},"DOI":"10.1145\/1571941.1572114","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"758-759","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":380,"title":["Reciprocal rank fusion outperforms condorcet and individual rank learning methods"],"prefix":"10.1145","author":[{"given":"Gordon V.","family":"Cormack","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Charles L A","family":"Clarke","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Stefan","family":"Buettcher","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_2_1","first-page":"4","author":"Freund Y.","year":"2003","unstructured":"Freund , Y. , Iyer , R. , Schapire , R. E. , and Singer , Y. An efficient boosting algorithm for combining preferences. JMLR 4 ( 2003 ). Freund, Y., Iyer, R., Schapire, R. E., and Singer, Y. An efficient boosting algorithm for combining preferences. JMLR 4 (2003).","journal-title":"JMLR"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584881"},{"key":"e_1_3_2_1_5_1","volume-title":"TREC -- Experiment and Evaluation in IR","author":"Voorhees E. M.","year":"2005","unstructured":"Voorhees , E. M. , and Harman , D. K. , Eds . TREC -- Experiment and Evaluation in IR . MIT Press , 2005 . Voorhees, E. M., and Harman, D. K., Eds. TREC -- Experiment and Evaluation in IR. MIT Press, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"}],"event":{"name":"SIGIR '09: The 32nd International ACM SIGIR conference on research and development in Information Retrieval","location":"Boston MA USA","acronym":"SIGIR '09","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1571941.1572114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1571941.1572114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:33Z","timestamp":1750249413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1571941.1572114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":6,"alternative-id":["10.1145\/1571941.1572114","10.1145\/1571941"],"URL":"https:\/\/doi.org\/10.1145\/1571941.1572114","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}