{"id":"https://openalex.org/W4376891303","doi":"https://doi.org/10.1145/3564246.3585131","title":"Optimal Bounds for Noisy Sorting","display_name":"Optimal Bounds for Noisy Sorting","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376891303","doi":"https://doi.org/10.1145/3564246.3585131"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585131","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585131","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585131","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585131","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062979441","display_name":"Yuzhou Gu","orcid":"https://orcid.org/0000-0002-9187-9190"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuzhou Gu","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005932872","display_name":"Yinzhan Xu","orcid":"https://orcid.org/0009-0002-6809-2514"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinzhan Xu","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062979441"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.9662,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88228461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1502","last_page":"1515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.8477391004562378},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.8134651184082031},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.6806663870811462},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.6368285417556763},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6360405683517456},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5495936274528503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.541667640209198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5217928886413574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46543896198272705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4518732726573944},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4394548535346985},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36458203196525574},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15651652216911316},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15222251415252686}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.8477391004562378},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8134651184082031},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6806663870811462},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.6368285417556763},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6360405683517456},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5495936274528503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.541667640209198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5217928886413574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46543896198272705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4518732726573944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4394548535346985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36458203196525574},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15651652216911316},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15222251415252686},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585131","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585131","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585131","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585131","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585131","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585131","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1013154005","display_name":null,"funder_award_id":"2129139","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3611442959","display_name":null,"funder_award_id":"CCF-2129139","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4376891303.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1977182854","https://openalex.org/W1999136518","https://openalex.org/W2019397615","https://openalex.org/W2038435918","https://openalex.org/W2040877654","https://openalex.org/W2048175848","https://openalex.org/W2052207834","https://openalex.org/W2062563944","https://openalex.org/W2076759821","https://openalex.org/W2111790732","https://openalex.org/W2131306093","https://openalex.org/W2301054524","https://openalex.org/W2752908210","https://openalex.org/W2794095571","https://openalex.org/W2912254316","https://openalex.org/W2962892929","https://openalex.org/W2977256954","https://openalex.org/W4210727445","https://openalex.org/W4288049756","https://openalex.org/W4289655199","https://openalex.org/W4384648706","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W4322772558","https://openalex.org/W2095055219","https://openalex.org/W2482527088","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682"],"abstract_inverted_index":{"Sorting":[0,40],"is":[1,13,46,100],"a":[2,28],"fundamental":[3],"problem":[4],"in":[5],"computer":[6],"science.":[7],"In":[8,33],"the":[9,38,112],"classical":[10],"setting,":[11],"it":[12],"well-known":[14],"that":[15,64],"(1\u00b1":[16,65],"o(1))":[17,66],"nlog2":[18,74],"n":[19,31,75,85],"comparisons":[20,77],"are":[21,78],"both":[22,79],"necessary":[23,80],"and":[24,81,116,121],"sufficient":[25,82],"to":[26,83],"sort":[27,84],"list":[29],"of":[30,102],"elements.":[32],"this":[34,126],"paper,":[35],"we":[36,62],"study":[37],"Noisy":[39],"problem,":[41],"where":[42,94],"each":[43],"comparison":[44],"result":[45],"flipped":[47],"independently":[48],"with":[49,87,105],"probability":[50,89,107],"p":[51],"for":[52,125],"some":[53],"fixed":[54],"p\u2208":[55],"(0,":[56],"1/2).":[57],"As":[58],"our":[59],"main":[60],"result,":[61],"show":[63],"(":[67],"1/I(p)":[68],"+":[69,96],"1/(1\u22122p)":[70],"log2":[71],"(1\u2212p/p)":[72],")":[73],"noisy":[76,92],"elements":[86],"error":[88],"o(1)":[90],"using":[91],"comparisons,":[93],"I(p)=1":[95],"plog2":[97],"p+(1\u2212p)log2":[98],"(1\u2212p)":[99],"capacity":[101],"BSC":[103],"channel":[104],"crossover":[106],"p.":[108],"This":[109],"simultaneously":[110],"improves":[111],"previous":[113],"best":[114],"lower":[115],"upper":[117],"bounds":[118],"(Wang,":[119],"Ghaddar":[120],"Wang,":[122],"ISIT":[123],"2022)":[124],"problem.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}