{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:41:14Z","timestamp":1774917674164,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2011845"],"award-info":[{"award-number":["2011845"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2244219"],"award-info":[{"award-number":["2244219"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2315596"],"award-info":[{"award-number":["2315596"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1016\/j.hcc.2023.100186","type":"journal-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T14:26:03Z","timestamp":1700663163000},"page":"100186","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Neural-based inexact graph de-anonymization"],"prefix":"10.1016","volume":"4","author":[{"given":"Guangxi","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyue","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1837-4759","authenticated-orcid":false,"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.hcc.2023.100186_b1","first-page":"577","article-title":"Collective data-sanitization for preventing sensitive information inference attacks in social networks","volume":"15","author":"Cai","year":"2016","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.hcc.2023.100186_b2","series-title":"Advances in Experimental Social Psychology, Vol. 1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0065-2601(08)60050-7","article-title":"Communication networks","author":"Shaw","year":"1964"},{"issue":"5","key":"10.1016\/j.hcc.2023.100186_b3","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/JSAC.2020.2980802","article-title":"Privacy-preserved data sharing towards multiple parties in industrial IoTs","volume":"38","author":"Zheng","year":"2020","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"10.1016\/j.hcc.2023.100186_b4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0959-440X(03)00031-9","article-title":"Biological networks","volume":"13","author":"Alm","year":"2003","journal-title":"Curr. Opin. Struct. Biol."},{"issue":"8","key":"10.1016\/j.hcc.2023.100186_b5","doi-asserted-by":"crossref","first-page":"6904","DOI":"10.1109\/JIOT.2020.3036583","article-title":"Adversarial privacy-preserving graph embedding against inference attack","volume":"8","author":"Li","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.hcc.2023.100186_b6","series-title":"2019 IEEE 39th International Conference on Distributed Computing Systems","first-page":"144","article-title":"Trading private range counting over big IoT data","author":"Cai","year":"2019"},{"key":"10.1016\/j.hcc.2023.100186_b7","article-title":"Private data trading towards range counting queries in internet of things","author":"Cai","year":"2022","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"2","key":"10.1016\/j.hcc.2023.100186_b8","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/TNSE.2018.2830307","article-title":"A private and efficient mechanism for data uploading in smart cyber-physical systems","volume":"7","author":"Cai","year":"2018","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.hcc.2023.100186_b9","series-title":"2009 30th IEEE Symposium on Security and Privacy","first-page":"173","article-title":"De-anonymizing social networks","author":"Narayanan","year":"2009"},{"key":"10.1016\/j.hcc.2023.100186_b10","series-title":"An efficient reconciliation algorithm for social networks","author":"Korula","year":"2013"},{"issue":"4","key":"10.1016\/j.hcc.2023.100186_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2894760","article-title":"General graph data de-anonymization: From mobility traces to social networks","volume":"18","author":"Ji","year":"2016","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"10.1016\/j.hcc.2023.100186_b12","series-title":"2013 51st Annual Allerton Conference on Communication, Control, and Computing","first-page":"1598","article-title":"A bayesian method for matching two similar graphs without seeds","author":"Pedarsani","year":"2013"},{"key":"10.1016\/j.hcc.2023.100186_b13","doi-asserted-by":"crossref","unstructured":"S. Ji, W. Li, M. Srivatsa, R. Beyah, Structural data de-anonymization: Quantification, practice, and implications, in: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014, pp. 1040\u20131053.","DOI":"10.1145\/2660267.2660278"},{"issue":"6","key":"10.1016\/j.hcc.2023.100186_b14","doi-asserted-by":"crossref","first-page":"3523","DOI":"10.1109\/TNET.2016.2536479","article-title":"Structural data de-anonymization: Theory and practice","volume":"24","author":"Ji","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2023.100186_b15","doi-asserted-by":"crossref","unstructured":"K. Li, G. Lu, G. Luo, Z. Cai, Seed-free graph de-anonymiztiation with adversarial learning, in: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, pp. 745\u2013754.","DOI":"10.1145\/3340531.3411970"},{"key":"10.1016\/j.hcc.2023.100186_b16","series-title":"Neural subgraph matching","author":"Lou","year":"2020"},{"key":"10.1016\/j.hcc.2023.100186_b17","series-title":"2020 IEEE International Conference on Big Data","first-page":"2575","article-title":"Inexact attributed subgraph matching","author":"Tu","year":"2020"},{"key":"10.1016\/j.hcc.2023.100186_b18","series-title":"Blockchain and Trustworthy Systems: Third International Conference, BlockSys 2021, Guangzhou, China, August 5\u20136, 2021, Revised Selected Papers 3","first-page":"3","article-title":"Identity inference on blockchain using graph neural network","author":"Shen","year":"2021"},{"key":"10.1016\/j.hcc.2023.100186_b19","doi-asserted-by":"crossref","first-page":"3433","DOI":"10.1109\/TIFS.2022.3208471","article-title":"Behavior-aware account de-anonymization on ethereum interaction graph","volume":"17","author":"Zhou","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.hcc.2023.100186_b20","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.hcc.2023.100186_b21","article-title":"Reasoning with neural tensor networks for knowledge base completion","volume":"26","author":"Socher","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.hcc.2023.100186_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2898361","article-title":"Snap: A general-purpose network analysis and graph-mining library","volume":"8","author":"Leskovec","year":"2016","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"4","key":"10.1016\/j.hcc.2023.100186_b23","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1162\/qss_a_00162","article-title":"AIDA: A knowledge graph about research dynamics in academia and industry","volume":"2","author":"Angioni","year":"2021","journal-title":"Quant. Sci. Stud."}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295223000843?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295223000843?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T08:40:39Z","timestamp":1757407239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295223000843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S2667295223000843"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2023.100186","relation":{},"ISSN":["2667-2952"],"issn-type":[{"value":"2667-2952","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Neural-based inexact graph de-anonymization","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2023.100186","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100186"}}