{"id":"https://openalex.org/W7214044646","doi":"https://doi.org/10.48550/arxiv.2609.24780","title":"Improved polynomial-time algorithms for detecting and recovering planted $\u0398(\\sqrt{n})$-cliques","display_name":"Improved polynomial-time algorithms for detecting and recovering planted $\u0398(\\sqrt{n})$-cliques","publication_year":2026,"publication_date":"2026-09-21","ids":{"openalex":"https://openalex.org/W7214044646","doi":"https://doi.org/10.48550/arxiv.2609.24780"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.24780","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.24780","pdf_url":"https://arxiv.org/pdf/2609.24780","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.24780","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044093947","display_name":"Dmitriy Kunisky","orcid":"https://orcid.org/0000-0002-0854-4067","observed_orcids":["https://orcid.org/0000-0002-0854-4067"]},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunisky, Dmitriy","raw_affiliation_strings":["Department of Applied Mathematics & Statistics , Johns Hopkins University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics & Statistics , Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5133595282","display_name":"Songtao Mao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mao, Songtao","raw_affiliation_strings":["Department of Computer Science , Johns Hopkins University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7455999851226807,"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.7455999851226807,"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.14470000565052032,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07779999822378159,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/erdos-renyi-graphs","display_name":"Erd\u0151s-R\u00e9nyi random graphs","score":0.8320000171661377},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.703000009059906},{"id":"https://openalex.org/keywords/color-coding","display_name":"color coding","score":0.7440000176429749},{"id":"https://openalex.org/keywords/treewidth","display_name":"treewidth","score":0.8190000057220459},{"id":"https://openalex.org/keywords/fast-matrix-multiplication","display_name":"fast matrix multiplication","score":0.8080000281333923},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.6489999890327454},{"id":"https://openalex.org/keywords/message-passing-algorithm","display_name":"message passing algorithm","score":0.6809999942779541},{"id":"https://openalex.org/keywords/boosting","display_name":"boosting","score":0.5820000171661377},{"id":"https://openalex.org/keywords/signal-strength","display_name":"signal strength","score":0.5230000019073486},{"id":"https://openalex.org/keywords/nearly-linear-time-algorithms","display_name":"near-linear time algorithms","score":0.5109999775886536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6829000115394592},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6044999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5835000276565552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5745999813079834},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4959999918937683},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47040000557899475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41760000586509705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3912000060081482},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.36340001225471497},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.3068000078201294},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.29660001397132874},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.29159998893737793},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25870001316070557},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.24780","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.24780","pdf_url":"https://arxiv.org/pdf/2609.24780","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.24780","doi":"https://doi.org/10.48550/arxiv.2609.24780","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.24780","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.24780","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.24780","pdf_url":"https://arxiv.org/pdf/2609.24780","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214044646.pdf","grobid_xml":"https://content.openalex.org/works/W7214044646.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1859301526","https://openalex.org/W1949284707","https://openalex.org/W2770109286","https://openalex.org/W2952763318","https://openalex.org/W3101305088","https://openalex.org/W3158867271","https://openalex.org/W3185396325","https://openalex.org/W4403401831","https://openalex.org/W4406141849","https://openalex.org/W4410309659","https://openalex.org/W4414593584","https://openalex.org/W4416290608","https://openalex.org/W4417301014","https://openalex.org/W4417355683","https://openalex.org/W7203702364"],"related_works":["https://openalex.org/W3020724744","https://openalex.org/W1028870867","https://openalex.org/W4417513650","https://openalex.org/W4399522123","https://openalex.org/W4391709675","https://openalex.org/W4286815407","https://openalex.org/W4244724628","https://openalex.org/W4376639649","https://openalex.org/W2917132665","https://openalex.org/W3081828529"],"abstract_inverted_index":{"In":[0],"the":[1,33,44,91,96,146,149,169,198,214,226,235,239,251,262,283],"planted":[2,112],"clique":[3,20,46],"problem,":[4],"one":[5],"observes":[6],"either":[7],"an":[8],"Erd\u0151s--R\u00e9nyi":[9],"graph":[10,17],"on":[11,180],"$n$":[12],"vertices":[13],"or":[14,31],"such":[15],"a":[16,19,87,114,183],"with":[18,72,117,261],"added":[21],"to":[22,29,65,90],"$k":[23,40,109],"=":[24,41,110,138,203,256],"k(n)$":[25],"vertices,":[26],"and":[27,125,220,289],"seeks":[28],"detect":[30],"recover":[32],"clique.":[34],"It":[35],"is":[36,43,174],"widely":[37],"believed":[38],"that":[39,156,189,197,229,250],"\u0398(\\sqrt{n})$":[42],"smallest":[45],"size":[47,108],"for":[48,53,80,85,191,201,212,254,275],"which":[49],"polynomial-time":[50,187],"algorithms":[51,59,188],"exist":[52],"these":[54],"tasks.":[55],"We":[56,76,194],"develop":[57],"new":[58],"in":[60,113,127,208,234],"this":[61,140,232],"regime":[62],"using":[63,268],"color-coding":[64],"estimate":[66],"signed":[67,144],"subgraph":[68],"counts,":[69],"further":[70,195],"accelerated":[71],"fast":[73],"matrix":[74,218,270],"multiplication.":[75],"first":[77],"show":[78,196,249],"that,":[79],"each":[81],"$t":[82,166,202,255],"\\geq":[83,167],"1$,":[84],"$c(t)$":[86,173],"constant":[88,215],"associated":[89],"order":[92],"of":[93,95,98,101,107,148,153,172,185,216,238,241,265],"growth":[94],"number":[97],"connected":[99],"graphs":[100],"treewidth":[102],"at":[103],"most":[104],"$t$,":[105],"cliques":[106],"\u03bb\\sqrt{n}$":[111],"random":[115],"location":[116],"$\u03bb>":[118,159,223],"1":[119,131,160],"/":[120,161],"\\sqrt{c(t)}$":[121],"can":[122,205,258],"be":[123,206,259],"detected":[124],"recovered":[126],"time":[128,209,237],"$n^{t":[129],"+":[130,132],"o(1)}$.":[133],"For":[134,165],"instance,":[135],"since":[136],"$c(1)":[137],"e$,":[139],"recovers":[141],"by":[142],"counting":[143],"trees":[145],"performance":[147],"$\\widetilde{O}(n^2)$-time":[150],"message-passing":[151],"algorithm":[152,200,240,253],"Deshpande--Montanari":[154,242],"(2015)":[155],"succeeds":[157,221],"when":[158,222],"\\sqrt{e}":[162],"\\approx":[163],"0.6066$.":[164],"3$,":[168],"exact":[170],"value":[171],"not":[175],"known,":[176],"but":[177],"lower":[178],"bounds":[179],"it":[181],"give":[182],"hierarchy":[184],"slower":[186],"succeed":[190],"smaller":[192,245,276],"$\u03bb$.":[193,277,292],"above":[199,252],"2$":[204],"implemented":[207],"$n^{\u03c9+":[210],"o(1)}$":[211],"$\u03c9$":[213],"square":[217],"multiplication":[219],"0.3320$;":[224],"under":[225],"folklore":[227],"conjecture":[228],"$\u03c9=":[230],"2$,":[231],"runs":[233],"nearly-linear":[236],"while":[243],"finding":[244],"cliques.":[246],"Second,":[247],"we":[248],"1$":[257],"combined":[260],"boosting":[263],"scheme":[264],"Alon--Krivelevich--Sudakov":[266],"(1998)":[267],"rectangular":[269],"multiplication,":[271],"giving":[272],"improved":[273],"runtimes":[274],"Taken":[278],"together,":[279],"our":[280],"results":[281],"achieve":[282],"best":[284],"known":[285],"tradeoff":[286],"between":[287],"runtime":[288],"signal":[290],"strength":[291]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-23T00:00:00"}