{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:51:43Z","timestamp":1780635103772,"version":"3.54.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772215"],"award-info":[{"award-number":["61772215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010888","name":"Wuhan Municipal Science and Technology Bureau","doi-asserted-by":"publisher","award":["2018010401011274"],"award-info":[{"award-number":["2018010401011274"]}],"id":[{"id":"10.13039\/501100010888","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2952452","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T21:45:48Z","timestamp":1573249548000},"page":"164304-164319","source":"Crossref","is-referenced-by-count":12,"title":["DP-FT: A Differential Privacy Graph Generation With Field Theory for Social Network Data Release"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9815-3934","authenticated-orcid":false,"given":"Hong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3978-6886","authenticated-orcid":false,"given":"Xin","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1973-7470","authenticated-orcid":false,"given":"Meiyi","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687714"},{"key":"ref38","volume":"7","author":"jooreskog","year":"2004","journal-title":"ChapmanKolmogorov Equation"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"ref31","first-page":"623","article-title":"Link prediction based on local random walk","volume":"71","author":"liu","year":"2009","journal-title":"Eur Phys J B"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4229-9","author":"spitzer","year":"1964","journal-title":"Principles of Random Walk"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/PASSAT\/SocialCom.2011.166"},{"key":"ref34","author":"rogers","year":"2002"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.procs.2018.10.388","article-title":"Node differential privacy in social graph degree publishing","volume":"143","author":"macwan","year":"2018","journal-title":"Procedia Comput Sci"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2174\/1874919400801010001"},{"key":"ref2","first-page":"1","article-title":"Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression","author":"samarati","year":"1998","journal-title":"Proc IEEE Symp Res Secur Privacy"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281195"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915215"},{"key":"ref22","first-page":"290","article-title":"Differentially private network data release via stochastic Kronecker graph","volume":"10042","author":"li","year":"2016","journal-title":"Proc Int Conf Web Inf Syst Eng"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732300"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.74"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s00778-013-0344-8","article-title":"Correlated network data publication via differential privacy","volume":"23","author":"chen","year":"2014","journal-title":"VLDB J"},{"key":"ref26","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Proc Conf Theory of Cryptography"},{"key":"ref25","first-page":"338","article-title":"Differential privacy","author":"dwork","year":"2006","journal-title":"Proc 33rd Int Conf Automata Lang Program (ICALP)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623642"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020599"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422449"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2611523"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737785"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487601"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.96"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068825"},{"key":"ref18","first-page":"127","article-title":"Preserving differential privacy in degree-correlation based graph generation","volume":"6","author":"wang","year":"2013","journal-title":"Trans Data Privacy"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623683"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807218"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1533057.1533088"},{"key":"ref7","first-page":"204","article-title":"Privacy-preserving on graphs using randomization and edge-relevance","author":"casas-roma","year":"2014","journal-title":"Modeling Decisions for Artificial Intelligence"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2926745"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78478-4_9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.92"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134086"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567993"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2529591"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739058"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.130"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/130914218"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08894461.pdf?arnumber=8894461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T14:33:38Z","timestamp":1643294018000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8894461\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2952452","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}