{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:05:17Z","timestamp":1740175517770,"version":"3.37.3"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1734\/21"],"award-info":[{"award-number":["1734\/21"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsipn.2022.3211208","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T19:39:37Z","timestamp":1665689977000},"page":"855-867","source":"Crossref","is-referenced-by-count":5,"title":["Inferring Hidden Structures in Random Graphs"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7500-1911","authenticated-orcid":false,"given":"Wasim","family":"Huleihel","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0027-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1017939142"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511802256"},{"key":"ref5","first-page":"1046","article-title":"Complexity theoretic lower bounds for sparse principal component detection","volume-title":"Proc. 26th Annu. Conf. Learn. Theory","volume":"30","author":"Berthet","year":"2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1300"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1488"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1310"},{"key":"ref9","first-page":"899","article-title":"Computational lower bounds for community detection on random graphs","volume-title":"Proc. 28th Conf. Learn. Theory","volume":"40","author":"Hajek","year":"2015"},{"issue":"27","key":"ref10","first-page":"1","article-title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref11","first-page":"3819","article-title":"Average-case hardness of rip certification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1369"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1519"},{"key":"ref14","first-page":"48","article-title":"Reducibility and computational lower bounds for problems with planted sparse structure","volume-title":"Proc. 31st Conf. Learn. Theory","volume":"75","author":"Brennan","year":"2018"},{"key":"ref15","first-page":"417","article-title":"Universality of computational lower bounds for submatrix detection","volume-title":"Proc. 32ond Conf. Learn. Theory","volume":"99","author":"Brennan","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/9781108616799.014"},{"key":"ref17","first-page":"648","article-title":"Reducibility and statistical-computational gaps from secret leakage","volume-title":"Proc. 33rd Conf. Learn. Theory","volume":"125","author":"Brennan","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.42"},{"article-title":"Statistical inference and the sum of squares method","year":"2018","author":"Hopkins B.","key":"ref19"},{"key":"ref20","first-page":"1","article-title":"Computational hardness of certifying bounds on constrained PCA problems","volume-title":"Proc. 11th Innov. Theor. Comput. Sci. Conf.","volume":"151","author":"Bandeira","year":"2020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384329"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.53"},{"key":"ref24","first-page":"523","article-title":"Improved sum-of-squares lower bounds for hidden clique and hidden submatrix problems","volume-title":"Proc. 28th Conf. Learn. Theory, Ser. Mach. Learn. Res.","volume":"40","author":"Deshpande","year":"2015"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746600"},{"key":"ref26","first-page":"1612","article-title":"Sum-of-squares lower bounds for sparse PCA","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","volume":"1","author":"Ma","year":"2015"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055485"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3178538"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1142\/9789813272880_0186"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.72"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384319"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3046674"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746577"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.16"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.170"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447070"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852287"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0703685104"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.042109"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.4171\/PM\/2014"},{"key":"ref42","first-page":"2341","article-title":"Planting trees in graphs, and finding them back","volume-title":"Proc. 32nd Conf. Learn. Theory","volume":"99","author":"Massouli","year":"2019"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2004.1368131"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/S096354831300045X"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-015-1338-2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ470"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1208"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1080"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref51","article-title":"On the evolution of random graphs","volume":"5","year":"1960","journal-title":"Pub. Math. Inst. Hungian Acad. Sci."},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100058655"},{"key":"ref53","first-page":"181","article-title":"Balanced graphs and the problem of subgraphs of random graphs","volume-title":"Proc. 16th Southeast, Combinatorics, Graph Theory, Comput.","author":"Ruciski","year":"1985"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(90)90061-Z"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1886"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3211208"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1923-9"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97127-4_1"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/9666472\/09917525.pdf?arnumber=9917525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T03:01:38Z","timestamp":1706065298000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9917525\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2022.3211208","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2022]]}}}