{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:23:28Z","timestamp":1760711008841,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFB2100302"],"award-info":[{"award-number":["2018YFB2100302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSF China","doi-asserted-by":"publisher","award":["42050105","61960206002","61822206","61832013","62020106005","61829201"],"award-info":[{"award-number":["42050105","61960206002","61822206","61832013","62020106005","61829201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015803","name":"2021 Tencent AI Laboratory RhinoBird Focused Research Program","doi-asserted-by":"publisher","award":["JR202132"],"award-info":[{"award-number":["JR202132"]}],"id":[{"id":"10.13039\/100015803","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012247","name":"Program of Shanghai Academic\/Technology Research Leader","doi-asserted-by":"publisher","award":["18XD1401800"],"award-info":[{"award-number":["18XD1401800"]}],"id":[{"id":"10.13039\/501100012247","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tnet.2022.3180158","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T20:30:51Z","timestamp":1655152251000},"page":"2744-2759","source":"Crossref","is-referenced-by-count":3,"title":["Measuring Social Network De-Anonymizability by Means of Morphism Property"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7796-9168","authenticated-orcid":false,"given":"Luoyi","family":"Fu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0364-3568","authenticated-orcid":false,"given":"Jiapeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9743-0485","authenticated-orcid":false,"given":"Shan","family":"Qu","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huquan","family":"Kang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering and the Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2014","author":"leskovec","journal-title":"SNAP Datasets Stanford large network dataset collection","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TNET.2016.2553843"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.14778\/2732269.2732274"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2817946.2817953"},{"key":"ref13","article-title":"De-anonymization of social networks with communities: When quantifications meet algorithms","author":"fu","year":"2017","journal-title":"arXiv 1703 09028"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TNET.2019.2962731"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1002\/rsa.20934"},{"key":"ref16","first-page":"2985","article-title":"Spectral graph matching and regularized quadratic relaxation: Algorithm and theory","volume":"119","author":"fan","year":"2020","journal-title":"Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/s00440-020-00997-4"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/s41019-019-0086-8"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1137\/070710111"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/2896377.2901460"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1137\/0137041"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/ALLERTON.2015.7446983"},{"year":"1988","author":"hardy","journal-title":"Inequalities[M]","key":"ref27"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.14722\/ndss.2015.23096"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TPAMI.2008.245"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2660267.2660278"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/2512938.2512952"},{"key":"ref7","first-page":"709","article-title":"Optimal de-anonymization in random graphs with community structure","author":"onaran","year":"2016","journal-title":"Proc IEEE 50th Asilomar Conf Signals Syst Comput"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2020408.2020596"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/SP.2009.22"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.14778\/2794367.2794371"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1038\/s41467-019-08746-5"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1038\/nature03607"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/s10115-013-0693-z"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/2740908.2742839"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1103\/PhysRevE.84.066106"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1214\/10-AOAS382"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9990997\/09795104.pdf?arnumber=9795104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:19:15Z","timestamp":1673896755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9795104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2022.3180158","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}