{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:14:53Z","timestamp":1763705693325,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1526736"],"award-info":[{"award-number":["1526736"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tnet.2019.2940377","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T19:29:56Z","timestamp":1569266996000},"page":"2125-2136","source":"Crossref","is-referenced-by-count":6,"title":["Spectral Graph Forge: A Framework for Generating Synthetic Graphs With a Target Modularity"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8062-0343","authenticated-orcid":false,"given":"Luca","family":"Baldesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athina","family":"Markopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carter T.","family":"Buttsc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"303","article-title":"SecGraph: A uniform and open-source evaluation system for graph data anonymization and de-anonymization","author":"ji","year":"2015","journal-title":"Proc 24th USENIX Conf Security Symp"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(99)00019-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900004"},{"key":"ref35","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"mcauley","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"The National Longitudinal Study of Adolescent Health Research Design","year":"2009","author":"harris","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2015.05.028"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382262"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/b97662"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/11.1.50"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2006.08.002"},{"key":"ref16","first-page":"2960","article-title":"Forging the graphs: A low rank and positive semidefinite graph learning approach","author":"luo","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.10.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1198\/016214502388618906"},{"journal-title":"Introduction to Mathematical Sociology","year":"1964","author":"coleman","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218534"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2007.4444750"},{"journal-title":"The Development of Social Network Analysis A Study in the Sociology of Science","year":"2004","author":"freeman","key":"ref29"},{"key":"ref5","article-title":"Revealing the hidden language of complex networks","volume":"4","author":"yavero?lu","year":"2014","journal-title":"Sci Rep"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.162"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms9627"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644900"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159930"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753208735"},{"journal-title":"Multinet Version 4 38 for Windows","year":"2003","author":"richards","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042822"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2329453"},{"journal-title":"Python NetworkX Library","year":"2018","author":"baldesi","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.143"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208688"},{"key":"ref25","first-page":"1969","article-title":"The constrained laplacian rank algorithm for graph-based clustering","author":"nie","year":"2016","journal-title":"Proc 13th AAAI Conf Artif Intell"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/8869948\/8846600-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8869948\/08846600.pdf?arnumber=8846600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:44:24Z","timestamp":1657745064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8846600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":41,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2940377","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}