{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T05:45:36Z","timestamp":1743399936030,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Key R&D Program of China","award":["No.2017YFB0802400"],"award-info":[{"award-number":["No.2017YFB0802400"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 61402029"],"award-info":[{"award-number":["No. 61402029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Funding Project of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security","award":["No. AGK201708"],"award-info":[{"award-number":["No. AGK201708"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61379002"],"award-info":[{"award-number":["61379002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U11733115"],"award-info":[{"award-number":["U11733115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13638-018-1291-2","type":"journal-article","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T12:31:37Z","timestamp":1544013097000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Understanding structure-based social network de-anonymization techniques via empirical analysis"],"prefix":"10.1186","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0404-6466","authenticated-orcid":false,"given":"Jian","family":"Mao","sequence":"first","affiliation":[]},{"given":"Wenqian","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Jingbo","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zhaoyuan","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhihong","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"1291_CR1","first-page":"111","volume-title":"Security and Privacy, 2008. SP 2008. IEEE Symposium On","author":"A. Narayanan","year":"2008","unstructured":"A. Narayanan, V. Shmatikov, in Security and Privacy, 2008. SP 2008. IEEE Symposium On. Robust de-anonymization of large sparse datasets (IEEENew York, 2008), pp. 111\u2013125."},{"issue":"9","key":"1291_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MCOM.2018.1701245","volume":"56","author":"X. Zheng","year":"2018","unstructured":"X. Zheng, Z. Cai, Y. Li, Data linkage in smart iot systems: a consideration from privacy perspective. IEEE Commun. Mag.56(9), 55\u201361 (2018).","journal-title":"IEEE Commun. Mag."},{"key":"1291_CR3","unstructured":"Fitness app Strava exposes the location of military bases. https:\/\/techcrunch.com\/2018\/01\/28\/strava-exposes-military-bases\/ . Accessed 26 July 2018."},{"key":"1291_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/SP.2009.22","volume-title":"Security and Privacy, 2009 30th IEEE Symposium On","author":"A. Narayanan","year":"2009","unstructured":"A. Narayanan, V. Shmatikov, in Security and Privacy, 2009 30th IEEE Symposium On. De-anonymizing social networks (IEEENew York, 2009), pp. 173\u2013187."},{"key":"1291_CR5","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1145\/2382196.2382262","volume-title":"Proceedings of the 2012 ACM Conference on Computer and Communications Security","author":"M. Srivatsa","year":"2012","unstructured":"M. Srivatsa, M. Hicks, in Proceedings of the 2012 ACM Conference on Computer and Communications Security. Deanonymizing mobility traces: using social network as a side-channel (ACMNew York, 2012), pp. 628\u2013637."},{"key":"1291_CR6","first-page":"739","volume-title":"the SIAM International Conference on Data Mining (SDM)","author":"X. Ying","year":"2008","unstructured":"X. Ying, X. Wu, in the SIAM International Conference on Data Mining (SDM). Randomizing social networks: a spectrum pre- serving approach (Society for Industrial and Applied MathematicsPhiladelphia, 2008), pp. 739\u2013750."},{"key":"1291_CR7","first-page":"506","volume-title":"the IEEE 24th International Conference on Data Engineering (ICDE)","author":"B. Zhou","year":"2008","unstructured":"B. Zhou, J. Pei, in the IEEE 24th International Conference on Data Engineering (ICDE). Preserving privacy in social networks against neighborhood attack (IEEENew York, 2008), pp. 506\u2013515."},{"key":"1291_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1376616.1376629","volume-title":"2008 ACM SIGMOD International Conference on Management of Data","author":"K. Liu","year":"2008","unstructured":"K. Liu, E. Terzi, in 2008 ACM SIGMOD International Conference on Management of Data. Towards identity anonymization on graphs (ACMNew York, 2008), pp. 93\u2013106."},{"key":"1291_CR9","unstructured":"L. Zou, L. Chen, M. T. \u00d6zsu, in the VLDB Endowment. K-automorphism: a general framework for privacy preserving network publication, (2009), pp. 946\u2013957."},{"key":"1291_CR10","first-page":"102","volume-title":"the VLDB Endowment","author":"M. Hay","year":"2008","unstructured":"M. Hay, G. Miklau, D. Jensen, D. Towsley, P. Weis, in the VLDB Endowment. Resisting structural re-identification in anonymized social networks (ACMNew York, 2008), pp. 102\u2013114."},{"key":"1291_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/1242572.1242598","volume-title":"the 16th International Conference on World Wide Web","author":"L. Backstrom","year":"2007","unstructured":"L. Backstrom, C. Dwork, J. Kleinberg, in the 16th International Conference on World Wide Web. Wherefore art thou r3579x? anonymized social networks, hidden patterns, and structural steganography (ACMNew York, 2007), pp. 181\u2013190."},{"key":"1291_CR12","first-page":"766","volume-title":"the VLDB Endowment","author":"S. Bhagat","year":"2009","unstructured":"S. Bhagat, G. Cormode, B. Krishnamurthy, D. Srivastava, in the VLDB Endowment. Class- based graph anonymization for social network data (ACMNew York, 2009), pp. 766\u2013777."},{"key":"1291_CR13","unstructured":"B. Thompson, D. Yao, in the 4th International Symposium on Information, Computer, and Communications Security (ASIACCS). The union-split algorithm and cluster-based anonymization of social networks, (2009), pp. 218\u2013227."},{"key":"1291_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/2068816.2068825","volume-title":"the 2011 ACM SIGCOMM Conference on Internet Measurement Conference (IMC)","author":"A. Sala","year":"2011","unstructured":"A. Sala, X. Zhao, C. Wilson, H. Zheng, B. Zhao, in the 2011 ACM SIGCOMM Conference on Internet Measurement Conference (IMC). Sharing graphs using differentially private graph models (ACMNew York, 2011), pp. 81\u201398."},{"key":"1291_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2342549.2342553","volume-title":"the 2012 ACM Workshop on Workshop on Online Social Networks","author":"D. Proserpio","year":"2012","unstructured":"D. Proserpio, S. Goldberg, F. McSherry, in the 2012 ACM Workshop on Workshop on Online Social Networks. A workflow for differentially-private graph synthesis (ACMNew York, 2012), pp. 13\u201318."},{"key":"1291_CR16","first-page":"673","volume-title":"the 40th International Conference on Very Large Data Base (VLDB)","author":"D. Proserpio","year":"2014","unstructured":"D. Proserpio, S. Goldberg, F. McSherry, in the 40th International Conference on Very Large Data Base (VLDB). Calibrating data to sensitivity in private data analysis (ACMNew York, 2014), pp. 673\u2013648."},{"key":"1291_CR17","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1145\/2623330.2623642","volume-title":"the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"Q. Xiao","year":"2014","unstructured":"Q. Xiao, R. Chen, K. Tan, in the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Differentially private network data release via structural inference (ACMNew York, 2014), pp. 911\u2013920."},{"key":"1291_CR18","first-page":"1","volume-title":"the 20th Annual Network and Distributed System Security Symposium (NDSS)","author":"P. Mittal","year":"2013","unstructured":"P. Mittal, C. Papamanthou, D. Song, in the 20th Annual Network and Distributed System Security Symposium (NDSS). Preserving link privacy in social network based systems (arXivIthaca, 2013), pp. 1\u201315."},{"key":"1291_CR19","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1145\/2660267.2660324","volume-title":"Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security","author":"S. Nilizadeh","year":"2014","unstructured":"S. Nilizadeh, A. Kapadia, Y. -Y. Ahn, in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. Community-enhanced de-anonymization of online social networks (ACMNew York, 2014), pp. 537\u2013548."},{"key":"1291_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/2512938.2512952","volume-title":"the First ACM Conference on Online Social Networks","author":"L. Yartseva","year":"2013","unstructured":"L. Yartseva, M. Grossglauser, in the First ACM Conference on Online Social Networks. On the performance of percolation graph matching (ACMNew York, 2013), pp. 119\u2013130."},{"key":"1291_CR21","first-page":"237","volume-title":"the Information Security (ISC)","author":"W. L. S. Ji","year":"2014","unstructured":"W. L. S. Ji, M. Srivatsa, J. He, R. Beyah, in the Information Security (ISC). Structure based data de-anonymization of social networks and mobility traces (SpringerNew York, 2014), pp. 237\u2013254."},{"key":"1291_CR22","first-page":"377","volume-title":"the VLDB Endowment","author":"N. Korula","year":"2014","unstructured":"N. Korula, S. Lattanzi, in the VLDB Endowment. An efficient reconciliation algorithm for social networks (ACMNew York, 2014), pp. 377\u2013388."},{"key":"1291_CR23","first-page":"1598","volume-title":"the Allerton Conference on Communication, Control, and Computing","author":"P. Pedarsani","year":"2013","unstructured":"P. Pedarsani, D. R. Figueiredo, M. Grossglauser, in the Allerton Conference on Communication, Control, and Computing. A Bayesian method for matching two similar graphs without seeds (IEEENew York, 2013), pp. 1598\u20131607."},{"key":"1291_CR24","first-page":"239","volume-title":"the 17th ACM Conference on Information and Knowledge Management (CIKM)","author":"A. Korolova","year":"2008","unstructured":"A. Korolova, R. Motwani, S. Nabar, Y. Xu, in the 17th ACM Conference on Information and Knowledge Management (CIKM). Link privacy in social networks (ACMNew York, 2008), pp. 239\u2013298."},{"key":"1291_CR25","unstructured":"G. Wondracek, T. Holz, E. Kirda, C. Kruegel, in the 2010 IEEE Symposium on Security and Privacy. A practical attack to de-anonymize social network users, (2010), pp. 223\u2013238."},{"issue":"2","key":"1291_CR26","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/COMST.2016.2633620","volume":"19","author":"S. Ji","year":"2016","unstructured":"S. Ji, P. Mittal, R. Beyah, Graph data anonymization, de-anonymization attacks, and de-anonymizability quantification: a survey. IEEE Commun. Surv. Tutor.19(2), 1305\u20131326 (2016).","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"7","key":"1291_CR27","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/TIFS.2016.2529591","volume":"11","author":"S. Ji","year":"2016","unstructured":"S. Ji, W. Li, N. Z. Gong, P. Mittal, R. Beyah, Seed-based de-anonymizability quantification of social networks. IEEE Trans. Inf. Forensics Secur.11(7), 1398\u20131411 (2016).","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"99","key":"1291_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2017.2712150","volume":"PP","author":"S. Ji","year":"2017","unstructured":"S. Ji, T. Wang, J. Chen, W. Li, P. Mittal, R. Beyah, De-sag: on the de-anonymization of structure-attribute graph data. IEEE Trans. Dependable Secure Comput.PP(99), 1\u201314 (2017).","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"2","key":"1291_CR29","first-page":"5","volume":"7","author":"T. Lou","year":"2013","unstructured":"T. Lou, J. Tang, J. Hopcroft, Z. Fang, X. Ding, Learning to predict reciprocity and triadic closure in social networks. ACM Trans. Knowl. Discov. Data (TKDD). 7(2), 5 (2013).","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"1291_CR30","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1145\/1557019.1557108","volume-title":"Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Tang","year":"2009","unstructured":"J. Tang, J. Sun, C. Wang, Z. Yang, in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Social influence analysis in large-scale networks (ACMNew York, 2009), pp. 807\u2013816."},{"key":"1291_CR31","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/1.9781611972788.67","volume-title":"Proceedings of the 2008 SIAM International Conference on Data Mining","author":"X. Ying","year":"2008","unstructured":"X. Ying, X. Wu, in Proceedings of the 2008 SIAM International Conference on Data Mining. Randomizing social networks: a spectrum preserving approach (Society for Industrial and Applied MathematicsPhiladelphia, 2008), pp. 739\u2013750."},{"key":"1291_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1376616.1376629","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"K. Liu","year":"2008","unstructured":"K. Liu, E. Terzi, in Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. Towards identity anonymization on graphs (ACMNew York, 2008), pp. 93\u2013106."},{"key":"1291_CR33","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/1807167.1807218","volume-title":"the 2010 ACM SIGMOD International Conference on Management of Data","author":"J. Cheng","year":"2010","unstructured":"J. Cheng, A. Fu, J. Liu, in the 2010 ACM SIGMOD International Conference on Management of Data. K-isomorphism: privacy preserving network publication against structural attacks (ACMNew York, 2010), pp. 459\u2013470."},{"issue":"2","key":"1291_CR34","first-page":"127","volume":"6","author":"Y. Wang","year":"2013","unstructured":"Y. Wang, X. Wu, Preserving differential privacy in degree-correlation based graph generation[J]. Trans. Data. Priv. (NIH Public Access). 6(2), 127\u2013145 (2013).","journal-title":"Trans. Data. Priv. (NIH Public Access)"},{"key":"1291_CR35","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1242572.1242598","volume-title":"Proceedings of the 16th International Conference on World Wide Web","author":"L. Backstrom","year":"2007","unstructured":"L. Backstrom, C. Dwork, J. Kleinberg, in Proceedings of the 16th International Conference on World Wide Web. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography (ACMNew York, 2007), pp. 181\u2013190."},{"key":"1291_CR36","doi-asserted-by":"publisher","first-page":"1825","DOI":"10.1109\/IJCNN.2011.6033446","volume-title":"Neural Networks (IJCNN), The 2011 International Joint Conference On","author":"A. Narayanan","year":"2011","unstructured":"A. Narayanan, E. Shi, B. I. Rubinstein, in Neural Networks (IJCNN), The 2011 International Joint Conference On. Link prediction by de-anonymization: how we won the Kaggle social network challenge (IEEENew York, 2011), pp. 1825\u20131834."},{"issue":"4","key":"1291_CR37","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2894760","volume":"18","author":"S. Ji","year":"2016","unstructured":"S. Ji, W. Li, M. Srivatsa, J. S. He, R. Beyah, General graph data de-anonymization: from mobility traces to social networks. ACM Trans. Inf. Syst. Secur. (TISSEC). 18(4), 12 (2016).","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"1291_CR38","first-page":"1040","volume-title":"Proceedings of ACM Sigsac Conference on Computer and Communications Security","author":"S. Ji","year":"2014","unstructured":"S. Ji, W. Li, M. Srivatsa, R. Beyah, in Proceedings of ACM Sigsac Conference on Computer and Communications Security. Structural data de-anonymization: quantification, practice, and implications (ACMNew York, 2014), pp. 1040\u20131053."},{"key":"1291_CR39","unstructured":"K. Sharad, Learning to de-anonymize social networks (2016). Technical report, University of Cambridge, Computer Laboratory."},{"key":"1291_CR40","first-page":"1","volume-title":"Proceedings of the 2017 on Workshop on Privacy in the Electronic Society","author":"W. -H. Lee","year":"2017","unstructured":"W. -H. Lee, C. Liu, S. Ji, P. Mittal, R. B. Lee, in Proceedings of the 2017 on Workshop on Privacy in the Electronic Society. Blind de-anonymization attacks using social networks (ACMNew York, 2017), pp. 1\u20134."},{"key":"1291_CR41","doi-asserted-by":"crossref","unstructured":"X. Wu, Z. Hu, X. Fu, L. Fu, X. Wang, S. Lu, in Proceedings of IEEE International Conference on Computer Communications (INFOCOM). Social network de-anonymization with overlapping communities: analysis, algorithm and experiments (IEEE, 2018), pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2018.8486260"},{"key":"1291_CR42","unstructured":"D. Chen, B. Hu, S. Xie, De-anonymizing social networks. CS224W Course Proj. Writup., 1\u20139 (2012)."},{"key":"1291_CR43","doi-asserted-by":"crossref","unstructured":"J. Qian, X. Y. Li, C. Zhang, L. Chen, in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). De-anonymizing social networks and inferring private attributes using knowledge graphs (IEEE, 2016), pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2016.7524578"},{"key":"1291_CR44","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.procs.2018.03.089","volume":"129","author":"H. Jiang","year":"2018","unstructured":"H. Jiang, J. Yu, C. Hu, C. Zhang, X. Cheng, SA framework based de-anonymization of social networks. Procedia Comput. Sci.129:, 358\u2013363 (2018).","journal-title":"Procedia Comput. Sci."},{"issue":"4","key":"1291_CR45","first-page":"577","volume":"15","author":"Z. Cai","year":"2018","unstructured":"Z. Cai, Z. He, X. Guan, Y. Li, Collective data-sanitization for preventing sensitive information inference attacks in social networks. IEEE Trans. Dependable Secure Comput. (TDSC). 15(4), 577\u2013590 (2018).","journal-title":"IEEE Trans. Dependable Secure Comput. (TDSC)"},{"key":"1291_CR46","unstructured":"N. Z. Gong, A. Talwalkar, L. Mackey, L. Huang, E. C. R. Shin, E. Stefanov, E Shi, D. Song, Jointly predicting links and inferring attributes using a social-attribute network (san)[J]. arXiv preprint arXiv:1112.3265 (2011). https:\/\/arxiv.org\/abs\/1112.3265 . Accessed 26 July 2018."},{"key":"1291_CR47","doi-asserted-by":"crossref","unstructured":"B. Thompson, D. Yao, in Proceedings of the 4th International Symposium on Information, Computer, and Communications Security. The union-split algorithm and cluster-based anonymization of social networks (ACM, 2009), pp. 218\u2013227.","DOI":"10.1145\/1533057.1533088"},{"issue":"1","key":"1291_CR48","doi-asserted-by":"publisher","first-page":"766","DOI":"10.14778\/1687627.1687714","volume":"2","author":"S. Bhagat","year":"2009","unstructured":"S. Bhagat, G. Cormode, B. Krishnamurthy, D. Srivastava, Class-based graph anonymization for social network data. Proc. VLDB Endowment. 2(1), 766\u2013777 (2009).","journal-title":"Proc. VLDB Endowment"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1291-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-018-1291-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1291-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T17:22:37Z","timestamp":1662571357000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-018-1291-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1291"],"URL":"https:\/\/doi.org\/10.1186\/s13638-018-1291-2","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"13 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"279"}}