{"id":"https://openalex.org/W4376639621","doi":"https://doi.org/10.1145/3564246.3585221","title":"Sum-of-Squares Lower Bounds for Densest k-Subgraph","display_name":"Sum-of-Squares Lower Bounds for Densest k-Subgraph","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639621","doi":"https://doi.org/10.1145/3564246.3585221"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585221","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585221","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/A5034627679","display_name":"C. A. Jones","orcid":"https://orcid.org/0000-0002-1105-3920"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Chris Jones","raw_affiliation_strings":["Bocconi University, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bocconi University, Italy","institution_ids":["https://openalex.org/I71209653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053469573","display_name":"Aaron Potechin","orcid":"https://orcid.org/0009-0008-8205-1608"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Potechin","raw_affiliation_strings":["University of Chicago, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chicago, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052261991","display_name":"Goutham Rajendran","orcid":null},"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":"Goutham Rajendran","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/A5071289810","display_name":"Jeff Xu","orcid":"https://orcid.org/0009-0004-8327-4126"},"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":"Jeff Xu","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"84","last_page":"95"},"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.9991999864578247,"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.9991999864578247,"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.9973000288009644,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6687938570976257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6441295742988586},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.579177737236023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.576943576335907},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.541517972946167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5028769373893738},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4977271854877472},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.49560511112213135},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.45079663395881653},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4116186797618866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3538973331451416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31456828117370605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3142548203468323},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12889882922172546},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09266349673271179},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.08225086331367493},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.07180449366569519}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6687938570976257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6441295742988586},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.579177737236023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.576943576335907},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.541517972946167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5028769373893738},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4977271854877472},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.49560511112213135},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.45079663395881653},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4116186797618866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3538973331451416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31456828117370605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3142548203468323},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12889882922172546},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09266349673271179},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.08225086331367493},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.07180449366569519},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585221","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585221","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":[],"awards":[{"id":"https://openalex.org/G2485349017","display_name":null,"funder_award_id":"CCF-2008920","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3177171667","display_name":"AF: Small: Parallels in Approximability of Discrete and Continuous Optimization Problems","funder_award_id":"1816372","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3638057439","display_name":null,"funder_award_id":"CCF-2008920, CCF-1816372, CAREER Award #2047933","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6591094171","display_name":"AF: SMALL: Further Investigation of the Sum of Squares Hierarchy","funder_award_id":"2008920","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"},{"id":"https://openalex.org/G7826011605","display_name":null,"funder_award_id":"CCF-1816372","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/F4320309626","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W16941573","https://openalex.org/W772053521","https://openalex.org/W1494252438","https://openalex.org/W1572312821","https://openalex.org/W1806104592","https://openalex.org/W1888358353","https://openalex.org/W1972913305","https://openalex.org/W1981566278","https://openalex.org/W1985123706","https://openalex.org/W2002025272","https://openalex.org/W2017280430","https://openalex.org/W2019404063","https://openalex.org/W2030365814","https://openalex.org/W2031923588","https://openalex.org/W2033515640","https://openalex.org/W2034543148","https://openalex.org/W2036199750","https://openalex.org/W2036322374","https://openalex.org/W2036836182","https://openalex.org/W2072802070","https://openalex.org/W2083858754","https://openalex.org/W2088844265","https://openalex.org/W2091602684","https://openalex.org/W2100721890","https://openalex.org/W2109384905","https://openalex.org/W2110871651","https://openalex.org/W2112351105","https://openalex.org/W2115659887","https://openalex.org/W2153952206","https://openalex.org/W2161922819","https://openalex.org/W2200725028","https://openalex.org/W2521628013","https://openalex.org/W2529974411","https://openalex.org/W2552383377","https://openalex.org/W2567866584","https://openalex.org/W2568531528","https://openalex.org/W2572273493","https://openalex.org/W2574497079","https://openalex.org/W2619061098","https://openalex.org/W2883109957","https://openalex.org/W2950509221","https://openalex.org/W2951914620","https://openalex.org/W2952332314","https://openalex.org/W2962721953","https://openalex.org/W2962820675","https://openalex.org/W2962853446","https://openalex.org/W2963010019","https://openalex.org/W2963256102","https://openalex.org/W2963725737","https://openalex.org/W2964738308","https://openalex.org/W2996640527","https://openalex.org/W3032696844","https://openalex.org/W3034256405","https://openalex.org/W3047315550","https://openalex.org/W3085521625","https://openalex.org/W3093272495","https://openalex.org/W3093456580","https://openalex.org/W3126881019","https://openalex.org/W3167602277","https://openalex.org/W3170087187","https://openalex.org/W3170397223","https://openalex.org/W3184476290","https://openalex.org/W3200992273","https://openalex.org/W3215423215","https://openalex.org/W4214847992","https://openalex.org/W4249586771","https://openalex.org/W4255529553","https://openalex.org/W4302769223","https://openalex.org/W4316652372"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W2282273380","https://openalex.org/W2113826940","https://openalex.org/W4296570398","https://openalex.org/W2076040942","https://openalex.org/W2031967239","https://openalex.org/W2367468405","https://openalex.org/W1498460077","https://openalex.org/W2952985052","https://openalex.org/W2288163449"],"abstract_inverted_index":{"Given":[0],"a":[1,28,43,100,110],"graph":[2],"and":[3],"an":[4,52,83,88],"integer":[5],"k,":[6],"Densest":[7,97],"k-Subgraph":[8,98],"is":[9,27,51,76,80,99,106],"the":[10,15,21,69,94],"algorithmic":[11],"task":[12,104],"of":[13,24,46],"finding":[14],"subgraph":[16],"on":[17],"k":[18],"vertices":[19],"with":[20,40],"maximum":[22],"number":[23],"edges.":[25],"This":[26],"fundamental":[29],"problem":[30],"that":[31,74],"has":[32],"been":[33],"subject":[34],"to":[35,62,86,108],"intense":[36],"study":[37],"for":[38,82],"decades,":[39],"applications":[41],"spanning":[42],"wide":[44],"variety":[45],"fields.":[47],"The":[48],"state-of-the-art":[49],"algorithm":[50,85],"O(n1/4":[53,89],"+":[54],")-factor":[55,91],"approximation":[56],"(for":[57],"any":[58],">":[59],"0)":[60],"due":[61],"Bhaskara":[63],"et":[64],"al.":[65],"[STOC":[66],"\u201910].":[67],"Moreover,":[68],"so-called":[70],"log-density":[71],"framework":[72],"predicts":[73],"this":[75],"optimal,":[77],"i.e.":[78],"it":[79],"impossible":[81],"efficient":[84],"achieve":[87],"\u2212":[90],"approximation.":[92],"In":[93],"average":[95],"case,":[96],"prototypical":[101],"noisy":[102],"inference":[103],"which":[105],"conjectured":[107],"exhibit":[109],"statistical-computational":[111],"gap.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}