{"id":"https://openalex.org/W4376639649","doi":"https://doi.org/10.1145/3564246.3585184","title":"Algorithms Approaching the Threshold for Semi-random Planted Clique","display_name":"Algorithms Approaching the Threshold for Semi-random Planted Clique","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639649","doi":"https://doi.org/10.1145/3564246.3585184"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585184","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585184","pdf_url":null,"source":null,"license":null,"license_id":null,"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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034456378","display_name":"Rares-Darius Buhai","orcid":"https://orcid.org/0000-0001-6667-0304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rares-Darius Buhai","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pravesh K. Kothari","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1918","last_page":"1926"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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.9955999851226807,"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/clique","display_name":"Clique","score":0.6787554621696472},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.6652204990386963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.521033525466919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5120652318000793},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5089483261108398},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5041252374649048},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49712613224983215},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4889320433139801},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4309491217136383},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4254096448421478},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41938692331314087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41345447301864624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40235841274261475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36281442642211914},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.09126237034797668},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09092250466346741},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06612846255302429}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6787554621696472},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.6652204990386963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.521033525466919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5120652318000793},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5089483261108398},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5041252374649048},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49712613224983215},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4889320433139801},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4309491217136383},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4254096448421478},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41938692331314087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41345447301864624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40235841274261475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36281442642211914},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.09126237034797668},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09092250466346741},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06612846255302429},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585184","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585184","pdf_url":null,"source":null,"license":null,"license_id":null,"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":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G6291162331","display_name":"Collaborative Research: AF: Medium: Polynomial Optimization: Algorithms, Certificates and Applications","funder_award_id":"2211971","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","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"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1869978370","https://openalex.org/W1972894929","https://openalex.org/W1985123706","https://openalex.org/W1987178221","https://openalex.org/W2010601719","https://openalex.org/W2062307640","https://openalex.org/W2065563937","https://openalex.org/W2081254453","https://openalex.org/W2082029531","https://openalex.org/W2088272899","https://openalex.org/W2095315734","https://openalex.org/W2216459995","https://openalex.org/W2242403914","https://openalex.org/W2554864439","https://openalex.org/W2574497079","https://openalex.org/W2607171573","https://openalex.org/W2610183793","https://openalex.org/W2770109286","https://openalex.org/W2808754399","https://openalex.org/W2943555824","https://openalex.org/W2949580236","https://openalex.org/W2962721953","https://openalex.org/W2962820675","https://openalex.org/W2963865651","https://openalex.org/W3001449442","https://openalex.org/W3002207671","https://openalex.org/W3093456580","https://openalex.org/W3127100532","https://openalex.org/W3129046222","https://openalex.org/W3167602277","https://openalex.org/W3170087187","https://openalex.org/W4205196152","https://openalex.org/W4214847992","https://openalex.org/W4249343322","https://openalex.org/W4253491426","https://openalex.org/W4255529553","https://openalex.org/W4281667950","https://openalex.org/W4300628147","https://openalex.org/W4313227228"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W2219991221","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W2052760902"],"abstract_inverted_index":{"We":[0],"design":[1],"new":[2],"polynomial-time":[3],"algorithms":[4,22,43],"for":[5,23,45],"recovering":[6],"planted":[7,29],"cliques":[8],"in":[9,36,54,64],"the":[10,28,51,55,65],"semi-random":[11,56],"graph":[12,38],"model":[13,25,57],"introduced":[14],"by":[15,77],"Feige":[16,78],"and":[17,58,79],"Kilian.":[18],"The":[19],"previous":[20],"best":[21],"this":[24],"succeed":[26],"if":[27],"clique":[30],"has":[31],"size":[32],"at":[33],"least":[34],"n2/3":[35],"a":[37,59],"with":[39],"n":[40],"vertices.":[41],"Our":[42],"work":[44],"planted-clique":[46],"sizes":[47],"approaching":[48],"n1/2":[49],"\u2014":[50],"information-theoretic":[52],"threshold":[53,62],"conjectured":[60],"computational":[61],"even":[63],"easier":[66],"fully-random":[67],"model.":[68],"This":[69],"result":[70],"comes":[71],"close":[72],"to":[73],"resolving":[74],"open":[75],"questions":[76],"Steinhardt.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}