{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:23Z","timestamp":1740131663670,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"William R. Hewlett Stanford Graduate Fellowship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319979","DMS-1106627"],"award-info":[{"award-number":["CCF-1319979","DMS-1106627"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0036"],"award-info":[{"award-number":["FA9550-13-1-0036"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/tit.2018.2870853","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T19:09:27Z","timestamp":1537297767000},"page":"7594-7612","source":"Crossref","is-referenced-by-count":0,"title":["A Statistical Model for Motifs Detection"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4424-7120","authenticated-orcid":false,"given":"Hamid","family":"Javadi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0267-8574","authenticated-orcid":false,"given":"Andrea","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-467"},{"journal-title":"On the Uniform Generation of Random Graphs with Prescribed Degree Sequences","year":"2003","author":"milo","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1080"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/1.9781611973099.34","article-title":"Polynomial integrality gaps for strong SDP relaxations of densest k-subgraph","author":"bhaskara","year":"2012","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"journal-title":"Inapproximability of densest \\(\\kappa \\) -subgraph from average-case hardness","year":"2011","author":"alon","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653804"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-015-1338-2"},{"key":"ref35","first-page":"899","article-title":"Computational lower bounds for community detection on random graphs","volume":"40","author":"hajek","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1208"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2010.557277"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100051124"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959936"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488692"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9215-y"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746600"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509985"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0503610102"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055412"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0306752101"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0030068"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"ref20","first-page":"523","article-title":"Improved sum-of-squares lower bounds for hidden clique and hidden submatrix problems","volume":"40","author":"deshpande","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"journal-title":"Spectral Graph Theory","year":"1997","author":"chung","key":"ref45"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.53"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3178538"},{"journal-title":"The Quadratic Assignment Problem","year":"2013","author":"burkard","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591820"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009795911987"},{"key":"ref23","first-page":"1046","article-title":"Complexity theoretic lower bounds for sparse principal component detection","author":"berthet","year":"2013","journal-title":"Proc Conf Learn Theory"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/132"},{"key":"ref26","first-page":"201","article-title":"Detecting high log-densities: An $O(n ^{1\/4}$ ) approximation for densest k-subgraph","author":"bhaskara","year":"2010","journal-title":"Proc 42nd ACM Symp Theory Comput"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref25","first-page":"69","article-title":"Oracle inequalities for computationally budgeted model selection","author":"agarwal","year":"2011","journal-title":"Proc 24th Annu Conf Learn Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8541083\/8467373-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8541083\/08467373.pdf?arnumber=8467373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:44Z","timestamp":1649444024000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8467373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":45,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2870853","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}