{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:42:49Z","timestamp":1761129769284,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"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":[[2020,7]]},"DOI":"10.1109\/infocom41043.2020.9155499","type":"proceedings-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:29:35Z","timestamp":1596580175000},"page":"89-98","source":"Crossref","is-referenced-by-count":6,"title":["De-anonymization of Social Networks: the Power of Collectiveness"],"prefix":"10.1109","author":[{"given":"Jiapeng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Songwu","family":"Lu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Random graph dynamics","year":"2007","author":"durrett","key":"ref30"},{"key":"ref10","first-page":"298","article-title":"Ueber eine gewisse Determinante","volume":"3","author":"zehfuss","year":"1858","journal-title":"Zeitschrift f&#x00FC r Mathematik und Physik"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1086\/229693"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-014-0946-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660324"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446983"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref28","article-title":"Sinkhorn distance: lightspeed computation of optimal transport","author":"cuturi","year":"2013","journal-title":"NeurIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2553843"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0121002"},{"key":"ref7","article-title":"Generalizing graph matching beyond quadratic assignment model","author":"yu","year":"2018","journal-title":"NeurIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1145\/3341617.3326151","article-title":"Analysis of a canonical labeling algorithm for the alignment of correlated Erd?s-Rényi graphs","volume":"3","author":"dai","year":"2019","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"article-title":"De-anonymization of social networks with communities: when quantifications meet algorithms","year":"2017","author":"fu","key":"ref20"},{"article-title":"Contagions in social networks: effects of monophilic contagion, friendship paradox and reactice networks","year":"2018","author":"nettasinghe","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486260"},{"article-title":"Seeded graph matching via large neighborhood statistics","year":"2018","author":"mossel","key":"ref24"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"morone","year":"2015","journal-title":"Nature"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref25","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":"ACM SIGMETRICS"}],"event":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications","start":{"date-parts":[[2020,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2020,7,9]]}},"container-title":["IEEE INFOCOM 2020 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9146503\/9155217\/09155499.pdf?arnumber=9155499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T08:22:37Z","timestamp":1696494157000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9155499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/infocom41043.2020.9155499","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}