{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:28Z","timestamp":1773376648972,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206786","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1237-1242","source":"Crossref","is-referenced-by-count":0,"title":["Detecting a Planted Bipartite Graph"],"prefix":"10.1109","author":[{"given":"Asaf","family":"Rotenberg","sequence":"first","affiliation":[{"name":"Tel Aviv University,Tel Aviv,Israel,6997801"}]},{"given":"Wasim","family":"Huleihel","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Tel Aviv,Israel,6997801"}]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Tel Aviv,Israel,6997801"}]}],"member":"263","reference":[{"key":"ref13","first-page":"2341","article-title":"Planting trees in graphs, and finding them back","volume":"99","author":"massoulie","year":"2019","journal-title":"Proceedings of the 32nd Conference on Learning Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100058655"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1080"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1208"},{"key":"ref11","first-page":"1761","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"ref10","first-page":"48","article-title":"Reducibility and computational lower bounds for problems with planted sparse structure","volume":"75","author":"brennan","year":"2016","journal-title":"Proceedings of the 31st Conference On Learning Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"ref1","article-title":"Statistical and computational limits for sparse matrix detection","volume":"48","author":"cai","year":"2018","journal-title":"Annals of Statistics"},{"key":"ref17","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"abbe","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref16","first-page":"1046","article-title":"Complexity theoretic lower bounds for sparse principal component detection","volume":"30","author":"berthet","year":"2013","journal-title":"Proceedings of the 26th Annual Conference on Learning Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3211208"},{"key":"ref18","author":"wu","year":"2018","journal-title":"Statistical problems with planted structures Information-theoretical and computational limits"},{"key":"ref24","author":"feige","year":"2021","journal-title":"A tight bound for the clique query problem in two rounds"},{"key":"ref23","first-page":"1","article-title":"On the subgraph query problem","author":"alweiss","year":"2020","journal-title":"Combinatorics Probability Computing"},{"key":"ref26","author":"huleihel","year":"2021","journal-title":"Random subgraph detection using queries"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.30757\/ALEA.v17-30"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511984068"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20896"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/gigascience\/giy014"},{"key":"ref8","first-page":"899","article-title":"Computational lower bounds for community detection on random graphs","volume":"40","author":"hajek","year":"2015","journal-title":"Proceedings of The 28th Conference on Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3046674"},{"key":"ref9","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":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S096354831300045X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.53"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206786.pdf?arnumber=10206786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:18Z","timestamp":1773347238000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206786\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206786","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}