{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:10Z","timestamp":1750308550652,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,27]],"date-time":"2015-09-27T00:00:00Z","timestamp":1443312000000},"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":[[2015,9,27]]},"DOI":"10.1145\/2808194.2809490","type":"proceedings-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T19:31:27Z","timestamp":1442950287000},"page":"353-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Optimal Rank Aggregation"],"prefix":"10.1145","author":[{"given":"Shayan A.","family":"Tabrizi","sequence":"first","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javid","family":"Dadashkarimi","sequence":"additional","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Dehghani","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Nasr Esfahani","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azadeh","family":"Shakery","sequence":"additional","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,9,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:INRT.0000009445.19495.46"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45237-9_13"},{"key":"e_1_3_2_1_3_1","volume-title":"Distributed Information Retrieval","author":"Callan J.","year":"2000","unstructured":"J. Callan . Distributed Information Retrieval , volume 7 . 2000 . J. Callan. Distributed Information Retrieval, volume 7. 2000."},{"key":"e_1_3_2_1_4_1","first-page":"28","volume-title":"CLEF","author":"Chen A.","year":"2002","unstructured":"A. Chen . Cross-language retrieval experiments at clef-2002 . In CLEF , pages 28 -- 48 , 2002 . A. Chen. Cross-language retrieval experiments at clef-2002. In CLEF, pages 28--48, 2002."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:INRT.0000009444.89549.90"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3019285"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45237-9_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30222-3_19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-005-2659-y"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30222-3_18"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-005-5722-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.03.023"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/872017.872240"}],"event":{"name":"ICTIR '15: ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Northampton Massachusetts USA","acronym":"ICTIR '15"},"container-title":["Proceedings of the 2015 International Conference on The Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808194.2809490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808194.2809490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:46Z","timestamp":1750273426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808194.2809490"}},"subtitle":["A Dynamic Programming Approach"],"short-title":[],"issued":{"date-parts":[[2015,9,27]]},"references-count":13,"alternative-id":["10.1145\/2808194.2809490","10.1145\/2808194"],"URL":"https:\/\/doi.org\/10.1145\/2808194.2809490","relation":{},"subject":[],"published":{"date-parts":[[2015,9,27]]},"assertion":[{"value":"2015-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}