{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T05:45:50Z","timestamp":1743399950661},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/glocom.2017.8254107","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T22:50:54Z","timestamp":1516056654000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["De-Anonymization of Networks with Communities: When Quantifications Meet Algorithms"],"prefix":"10.1109","author":[{"given":"Xinzhe","family":"Fu","sequence":"first","affiliation":[]},{"given":"Zhongzhao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Zhiying","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.220"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"journal-title":"Optimal de-anonymization in random graphs with community structure","year":"2016","author":"onaran","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066106"},{"year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100271"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401651112"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(87)90102-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2109042"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/2964791.2901460","article-title":"Improved achievability and converse bounds for Erd?s-Rényi graph matching","author":"cullina","year":"2016","journal-title":"Proc ACM SIGMETRICS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129081"},{"key":"ref7","first-page":"290","article-title":"On random graphs","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229027"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110415"}],"event":{"name":"2017 IEEE Global Communications Conference (GLOBECOM 2017)","start":{"date-parts":[[2017,12,4]]},"location":"Singapore","end":{"date-parts":[[2017,12,8]]}},"container-title":["GLOBECOM 2017 - 2017 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253768\/8253909\/08254107.pdf?arnumber=8254107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T11:08:21Z","timestamp":1570619301000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8254107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/glocom.2017.8254107","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}