{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:22:00Z","timestamp":1772641320306,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation Fellowship","doi-asserted-by":"publisher","award":["A-0005077-01-00"],"award-info":[{"award-number":["A-0005077-01-00"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tit.2022.3205959","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T19:56:03Z","timestamp":1663012563000},"page":"453-471","source":"Crossref","is-referenced-by-count":15,"title":["Exact Recovery in the General Hypergraph Stochastic Block Model"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6114-8453","authenticated-orcid":false,"given":"Qiaosheng","family":"Zhang","sequence":"first","affiliation":[{"name":"Shanghai Artificial Intelligence Laboratory, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National University of Singapore, Queenstown, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746603"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref5","article-title":"Recovering communities in the general stochastic block model without knowing the parameters","author":"Abbe","year":"2015","journal-title":"arXiv:1506.03729"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653804"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849594"},{"key":"ref8","article-title":"Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence","author":"Jog","year":"2015","journal-title":"arXiv:1509.06418"},{"key":"ref9","first-page":"965","article-title":"Optimal cluster recovery in the labeled stochastic block model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Yun"},{"key":"ref10","article-title":"Accurate community detection in the stochastic block model via spectral algorithms","author":"Yun","year":"2014","journal-title":"arXiv:1412.7335"},{"key":"ref11","first-page":"391","article-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","volume-title":"Proc. Conf. Learn. Theory","author":"Chin"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2546280"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2594812"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897548"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2758201"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69802-1_4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024399"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006796"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2834874"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030764"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2889920"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919733"},{"issue":"1","key":"ref23","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.51"},{"key":"ref25","first-page":"1414","article-title":"Robust clustering as ensembles of affinity relations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Liu"},{"key":"ref26","first-page":"397","article-title":"Consistency of spectral partitioning of uniform hypergraphs under planted partition model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Ghoshdastidar"},{"key":"ref27","first-page":"400","article-title":"A provable generalized tensor spectral method for uniform hypergraph partitioning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ghoshdastidar"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9556"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2020.01.039"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006974"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"ref34","article-title":"Stochastic block model for hypergraphs: Statistical limits and a semidefinite programming approach","author":"Kim","year":"2018","journal-title":"arXiv:1807.02884"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3037170"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024470"},{"key":"ref37","article-title":"Community detection for hypergraph networks via regularized tensor power iteration","author":"Tracy Ke","year":"2019","journal-title":"arXiv:1909.06503"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446987"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006580"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928301"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006915"},{"key":"ref42","first-page":"871","article-title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Chien"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920637"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517728"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/sta4.407"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/15-aos1428"},{"issue":"60","key":"ref48","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"Gao","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3174423"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/s0963548317000463"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456804"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2099"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/16M1078471"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9997158\/09887955.pdf?arnumber=9887955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:26:16Z","timestamp":1705958776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9887955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":57,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3205959","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}