{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:35:09Z","timestamp":1787013309311,"version":"build-2736575974"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Foundation","award":["2008684"],"award-info":[{"award-number":["2008684"]}]},{"name":"National Science Foundation","award":["2148211"],"award-info":[{"award-number":["2148211"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2025.3650703","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:39:39Z","timestamp":1767638379000},"page":"5768-5779","source":"Crossref","is-referenced-by-count":1,"title":["Differentially Private Community Detection in $h$-Uniform Hypergraphs"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7313-9957","authenticated-orcid":false,"given":"Javad Zahedi","family":"Moghaddam","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Dallas, Richardson, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3751-0165","authenticated-orcid":false,"given":"Aria","family":"Nosratinia","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Dallas, Richardson, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2901716"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3106673"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3140274"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3224731"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3247626"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3309250"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3329379"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2025.3539008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3588717"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2025.3557041"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2985096"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3309988"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref16","first-page":"247","article-title":"Privacy-integrated graph clustering through differential privacy.","volume-title":"Proc. EDBT\/ICDT Workshops","volume":"157","author":"Mlle","year":"2015"},{"key":"ref17","first-page":"15858","article-title":"Differentially private community detection for stochastic block models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mohamed","year":"2022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CISS56502.2023.10089679"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref21","article-title":"Accurate community detection in the stochastic block model via spectral algorithms","author":"Yun"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178602"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746603"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2934157"},{"key":"ref25","first-page":"13422","article-title":"Optimal sampling and clustering in the stochastic block model","volume-title":"Proc. Adv. Neural Inform. Process. Syst.","volume":"32","author":"Yun","year":"2019"},{"key":"ref26","first-page":"10364","article-title":"Efficient near-optimal testing of community changes in balanced stochastic block models","volume-title":"Proc. Adv. Neural Inform. Process. Syst.","volume":"32","author":"Gangrade","year":"2019"},{"key":"ref27","first-page":"2183","article-title":"Exact community recovery in correlated stochastic block models","volume-title":"Proc. Conf. Learn. Theory","author":"Gaudio","year":"2022"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3425581"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591857"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2546280"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2594812"},{"key":"ref32","first-page":"4871","article-title":"Exploiting tradeoffs for exact recovery in heterogeneous stochastic block models","volume-title":"Proc. Adv. Neural Inform. Process. Syst.","volume":"29","author":"Jalali","year":"2016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3078612"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2019.1706541"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834456"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3520130"},{"key":"ref37","article-title":"Community detection in the stochastic block model: Fundamental limits","author":"Sandon","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/jpr.2018.22"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2834874"},{"key":"ref40","first-page":"26976","article-title":"Streaming belief propagation for community detection","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Wu","year":"2021"},{"issue":"1","key":"ref41","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":"ref42","article-title":"A comprehensive review of community detection in graphs","author":"Ning","year":"2023"},{"key":"ref43","first-page":"397","article-title":"Consistency of spectral partitioning of uniform hypergraphs under planted partition model","volume-title":"Proc. Adv. Neural Inform. Process. Syst.","volume":"27","author":"Ghoshdastidar","year":"2014"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024470"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006915"},{"key":"ref47","article-title":"Stochastic block model for hypergraphs: Statistical limits and a semidefinite programming approach","author":"Kim","year":"2018"},{"key":"ref48","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","year":"2018"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920637"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928301"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2020.01.039"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3037170"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3205959"},{"key":"ref55","first-page":"469","article-title":"Community detection in the hypergraph SBM: Exact recovery given the similarity matrix","volume-title":"Proc. 36th Annu. Conf. Learn. Theory","author":"Gaudio","year":"2023"},{"key":"ref56","first-page":"36285","article-title":"Projected tensor power method for hypergraph community recovery","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2023"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3302283"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2994620.2994624"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134086"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2957795"},{"key":"ref61","article-title":"Consistency of privacy-preserving spectral clustering under the stochastic block model","author":"Hehir","year":"2021"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2025.103621"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/BigData62323.2024.10825799"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"3002","DOI":"10.1145\/3442381.3449813","article-title":"Graph embedding for recommendation against attribute inference attacks","volume-title":"Proc. Web Conf. 2021","author":"Zhang","year":"2021"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2021.100696"},{"key":"ref66","first-page":"983","article-title":"Locally differentially private analysis of graph statistics","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Imola","year":"2021"},{"key":"ref67","first-page":"16","article-title":"Differentially private community detection in attributed social networks","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Ji","year":"2019"},{"issue":"50","key":"ref68","first-page":"1","article-title":"Uniform hypergraph partitioning: Provable tensor methods and sampling techniques","volume":"18","author":"Ghoshdastidar","year":"2017","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6488902\/11264281\/11328897-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11328897.pdf?arnumber=11328897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:45:27Z","timestamp":1770065127000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11328897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":68,"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3650703","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}