{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T03:37:56Z","timestamp":1767065876237,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T00:00:00Z","timestamp":1645920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T00:00:00Z","timestamp":1645920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001866","name":"Fonds National de la Recherche Luxembourg","doi-asserted-by":"publisher","award":["C17\/IS\/11685812"],"award-info":[{"award-number":["C17\/IS\/11685812"]}],"id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Active re-identification attacks constitute a serious threat to privacy-preserving social graph publication, because of the ability of active adversaries to leverage fake accounts, a.k.a.<jats:italic>sybil nodes<\/jats:italic>, to enforce structural patterns that can be used to re-identify their victims on anonymised graphs. Several formal privacy properties have been enunciated with the purpose of characterising the resistance of a graph against active attacks. However, anonymisation methods devised on the basis of these properties have so far been able to address only restricted special cases, where the adversaries are assumed to leverage a very small number of sybil nodes. In this paper, we present a new probabilistic interpretation of active re-identification attacks on social graphs. Unlike the aforementioned privacy properties, which model the protection from active adversaries as the task of making victim nodes indistinguishable in terms of their fingerprints with respect to all potential attackers, our new formulation introduces a more complete view, where the attack is countered by jointly preventing the attacker from retrieving the set of sybil nodes, and from using these sybil nodes for re-identifying the victims. Under the new formulation, we show that<jats:italic>k<\/jats:italic>-symmetry, a privacy property introduced in the context of passive attacks, provides a sufficient condition for the protection against active re-identification attacks leveraging an arbitrary number of sybil nodes. Moreover, we show that the algorithm<jats:sc>K-Match<\/jats:sc>, originally devised for efficiently enforcing the related notion of<jats:italic>k<\/jats:italic>-automorphism, also guarantees<jats:italic>k<\/jats:italic>-symmetry. Empirical results on real-life and synthetic graphs demonstrate that our formulation allows, for the first time, to publish anonymised social graphs (with formal privacy guarantees) that effectively resist the strongest active re-identification attack reported in the literature, even when it leverages a large number of sybil nodes.<\/jats:p>","DOI":"10.1007\/s10115-022-01662-z","type":"journal-article","created":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T03:02:16Z","timestamp":1645930936000},"page":"1077-1100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Preventing active re-identification attacks on social graphs via sybil subgraph obfuscation"],"prefix":"10.1007","volume":"64","author":[{"given":"Sjouke","family":"Mauw","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-5756","authenticated-orcid":false,"given":"Yunior","family":"Ram\u00edrez-Cruz","sequence":"additional","affiliation":[]},{"given":"Rolando","family":"Trujillo-Rasua","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,27]]},"reference":[{"issue":"3","key":"1662_CR1","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/COMST.2016.2533668","volume":"18","author":"JH Abawajy","year":"2016","unstructured":"Abawajy JH, Ninggal MIH, Herawan T (2016) Privacy preserving social network data publication. IEEE Commun Surveys Tutor 18(3):1974\u20131997","journal-title":"IEEE Commun Surveys Tutor"},{"key":"1662_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th international conference on world wide web, pp. 181\u2013190, New York, NY, USA","DOI":"10.1145\/1242572.1242598"},{"key":"1662_CR3","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","DOI":"10.1126\/science.286.5439.509"},{"key":"1662_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.ins.2014.02.035","volume":"275","author":"F Bonchi","year":"2014","unstructured":"Bonchi F, Gionis A, Tassa T (2014) Identity obfuscation in graphs through the information theoretic lens. Inf Sci 275:232\u2013256","journal-title":"Inf Sci"},{"key":"1662_CR5","doi-asserted-by":"crossref","unstructured":"Casas-Roma J, Herrera-Joancomart\u00ed J, Torra V (2013) An algorithm for k-degree anonymity on large networks. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, pp. 671\u2013675","DOI":"10.1145\/2492517.2492643"},{"issue":"2","key":"1662_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10115-016-0947-7","volume":"50","author":"J Casas-Roma","year":"2017","unstructured":"Casas-Roma J, Herrera-Joancomart\u00ed Jordi, Torra V (2017) k-degree anonymity and edge selection: improving data utility in large networks. Knowl Inf Syst 50(2):447\u2013474","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1662_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10462-016-9484-8","volume":"47","author":"Jordi Casas-Roma","year":"2017","unstructured":"Casas-Roma Jordi, Herrera-Joancomart\u00ed Jordi, Torra Vicen\u00e7 (2017) A survey of graph-modification techniques for privacy-preserving on networks. Artif Intell Rev 47(3):341\u2013366","journal-title":"Artif Intell Rev"},{"key":"1662_CR8","unstructured":"Chen B-C, LeFevre K, Ramakrishnan R (2007) Privacy skyline: privacy with multidimensional adversarial knowledge. In: Proceedings of the 33rd international conference on very large data bases, VLDB \u201907, pp. 770\u2013781. VLDB Endowment"},{"key":"1662_CR9","doi-asserted-by":"crossref","unstructured":"Chen X, K\u00ebpuska E, Mauw S, Ram\u00edrez-Cruz Y (2020) Active re-identification attacks on periodically released dynamic social graphs. In Computer Security \u2013 ESORICS 2020, volume 12309 of Lecture Notes in Computer Science, pp. 185\u2013205. Springer","DOI":"10.1007\/978-3-030-59013-0_10"},{"key":"1662_CR10","first-page":"2020","volume":"4","author":"X Chen","year":"2020","unstructured":"Chen X, Mauw S, Ram\u00edrez-Cruz Y (2020) Publishing community-preserving attributed social graphs with a differential privacy guarantee. Proc Privacy Enhancing Technol 4:2020","journal-title":"Proc Privacy Enhancing Technol"},{"key":"1662_CR11","doi-asserted-by":"crossref","unstructured":"Cheng J, Wai-chee FA, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp. 459\u2013470","DOI":"10.1145\/1807167.1807218"},{"issue":"3","key":"1662_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s13278-012-0084-6","volume":"3","author":"S Chester","year":"2013","unstructured":"Chester S, Kapron BM, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2013) Why Waldo befriended the dummy? k-anonymization of social networks with pseudo-nodes. Social Netw Anal Min 3(3):381\u2013399","journal-title":"Social Netw Anal Min"},{"issue":"3\u20134","key":"1662_CR13","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Found Trends Theor Comput Sci 9(3\u20134):211\u2013407","journal-title":"Found Trends Theor Comput Sci"},{"key":"1662_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publicationes Mathematicae Debrecen 6:290\u2013297","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"1662_CR15","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Gehrke J, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the Twenty-second ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS \u201903, pp. 211\u2013222, New York, NY, USA, ACM","DOI":"10.1145\/773153.773174"},{"key":"1662_CR16","unstructured":"Feder T, Nabar SU, Terzi E (2008) Anonymizing graphs"},{"issue":"6","key":"1662_CR17","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"key":"1662_CR18","doi-asserted-by":"crossref","unstructured":"Hay M, Li C, Miklau G, Jensen DD (2009) Accurate estimation of the degree distribution of private networks. In: Proceedings 19th IEEE international conference on data mining (ICDM), pp. 169\u2013178. IEEE Computer Society","DOI":"10.1109\/ICDM.2009.11"},{"key":"1662_CR19","unstructured":"Ji S, Li W, Mittal P, Hu X, Beyah R (2015) Secgraph: a uniform and open-source evaluation system for graph data anonymization and de-anonymization. In: Proceedings of the 24th USENIX security symposium, pp. 303\u2013318, Washington DC, USA"},{"key":"1662_CR20","doi-asserted-by":"crossref","unstructured":"Jorgensen Z, Yu T, Cormode G (2016) Publishing attributed social graphs with formal privacy guarantees. In: Proceedings of the 2016 international conference on management of data, pp. 107\u2013122","DOI":"10.1145\/2882903.2915215"},{"issue":"3","key":"1662_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2611523","volume":"39","author":"V Karwa","year":"2014","unstructured":"Karwa V, Raskhodnikova S, Smith AD, Yaroslavtsev G (2014) Private analysis of graph structure. ACM Trans Database Syst 39(3):1\u201333","journal-title":"ACM Trans Database Syst"},{"key":"1662_CR22","doi-asserted-by":"crossref","unstructured":"Karwa V, Slavkovi\u0107 AB (2012) Differentially private graphical degree sequences and synthetic graphs. In: Proceedings of the international conference on privacy in statistical databases, pp. 273\u2013285","DOI":"10.1007\/978-3-642-33627-0_21"},{"issue":"1","key":"1662_CR23","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"George Karypis","year":"1998","unstructured":"Karypis George, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"1662_CR24","doi-asserted-by":"crossref","unstructured":"Li N, Li T, Venkatasubramanian S (2007) t-closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of the 23rd International conference on data engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 106\u2013115","DOI":"10.1109\/ICDE.2007.367856"},{"key":"1662_CR25","doi-asserted-by":"crossref","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp. 93\u2013106, New York, NY, USA","DOI":"10.1145\/1376616.1376629"},{"key":"1662_CR26","doi-asserted-by":"crossref","unstructured":"Lu X, Song Y, Bressan S (2012) Fast identity anonymization on graphs. In: Proceedings of the international conference on database and expert systems applications, pp. 281\u2013295","DOI":"10.1007\/978-3-642-32600-4_21"},{"issue":"12","key":"1662_CR27","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1007\/s00607-015-0453-x","volume":"97","author":"T Ma","year":"2015","unstructured":"Ma T, Zhang Y, Cao J, Shen J, Tang M, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2015) Kdvem: a k-degree anonymity with vertex and edge modification algorithm. Computing 97(12):1165\u20131184","journal-title":"Computing"},{"issue":"1","key":"1662_CR28","doi-asserted-by":"publisher","first-page":"790","DOI":"10.14778\/1687627.1687717","volume":"2","author":"A Machanavajjhala","year":"2009","unstructured":"Machanavajjhala A, Gehrke J, G\u00f6tz M (2009) Data publishing against realistic adversaries. Proc VLDB Endow 2(1):790\u2013801","journal-title":"Proc VLDB Endow"},{"key":"1662_CR29","doi-asserted-by":"crossref","unstructured":"Martin DJ, Kifer D, Machanavajjhala A, Gehrke J, Halpern JY (2007) Worst-case background knowledge for privacy-preserving data publishing. In: Proceedings of the 23rd international conference on data engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 126\u2013135","DOI":"10.1109\/ICDE.2007.367858"},{"issue":"2","key":"1662_CR30","first-page":"169","volume":"11","author":"S Mauw","year":"2018","unstructured":"Mauw S, Ram\u00edrez-Cruz Y, Trujillo-Rasua R (2018) Anonymising social graphs in the presence of active attackers. Trans Data Privacy 11(2):169\u2013198","journal-title":"Trans Data Privacy"},{"issue":"1","key":"1662_CR31","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10115-018-1283-x","volume":"61","author":"Sjouke Mauw","year":"2019","unstructured":"Mauw Sjouke, Ram\u00edrez-Cruz Yunior, Trujillo-Rasua Rolando (2019) Conditional adjacency anonymity in social graphs under active attacks. Knowl Inf Syst 61(1):485\u2013511","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"1662_CR32","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s10618-019-00631-5","volume":"33","author":"S Mauw","year":"2019","unstructured":"Mauw S, Ram\u00edrez-Cruz Y, Trujillo-Rasua R (2019) Robust active attacks on social graphs. Data Mining Knowl Discov 33(5):1357\u20131392","journal-title":"Data Mining Knowl Discov"},{"key":"1662_CR33","doi-asserted-by":"crossref","unstructured":"Mauw S, Trujillo-Rasua R, Xuan B (2016) Counteracting active attacks in social network graphs. In: Proceedings of DBSec 2016, vol. 9766 of Lecture Notes in Computer Science, pp. 233\u2013248","DOI":"10.1007\/978-3-319-41483-6_17"},{"key":"1662_CR34","doi-asserted-by":"crossref","unstructured":"Mir DJ, Wright RN (2009) A differentially private graph estimator. In: Proceedings 2009 ICDM international workshop on privacy aspects of data mining (ICDM), pages 122\u2013129. IEEE Computer Society","DOI":"10.1109\/ICDMW.2009.96"},{"key":"1662_CR35","doi-asserted-by":"crossref","unstructured":"Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: Proceedings of the 30th IEEE symposium on security and privacy, pp. 173\u2013187","DOI":"10.1109\/SP.2009.22"},{"issue":"5","key":"1662_CR36","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"Pietro Panzarasa","year":"2009","unstructured":"Panzarasa Pietro, Opsahl Tore, Carley Kathleen M (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Assoc Inf Sci Technol 60(5):911\u2013932","journal-title":"J Assoc Inf Sci Technol"},{"key":"1662_CR37","doi-asserted-by":"crossref","unstructured":"Peng W, Li F, Zou X, Wu J (2012) Seed and grow: an attack against anonymized social networks. In: Proceedings of the 9th Annual IEEE communications society conference on sensor, mesh and Ad Hoc communications and networks, pp. 587\u2013595","DOI":"10.1109\/SECON.2012.6275831"},{"issue":"2","key":"1662_CR38","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TC.2012.202","volume":"63","author":"Wei Peng","year":"2014","unstructured":"Peng Wei, Li F, Zou X, Jie W (2014) A two-stage deanonymization attack against anonymized social networks. IEEE Trans Comput 63(2):290\u2013303","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"1662_CR39","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10115-017-1064-y","volume":"54","author":"F Rousseau","year":"2017","unstructured":"Rousseau F, Casas-Roma Jordi, Vazirgiannis M (2017) Community-preserving anonymization of graphs. Knowl Inf Syst 54(2):315\u2013343","journal-title":"Knowl Inf Syst"},{"key":"1662_CR40","doi-asserted-by":"crossref","unstructured":"Sala A, Zhao X, Wilson C, Zheng H, Zhao BY (2011) Sharing graphs using differentially private graph models. In: Proceedings of the 2011 ACM SIGCOMM conference on internet measurement, pp. 81\u201398","DOI":"10.1145\/2068816.2068825"},{"key":"1662_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2015.03.005","volume":"188","author":"J Salas","year":"2015","unstructured":"Salas J, Torra V (2015) Graphic sequences, distances and k-degree anonymity. Discr Appl Math 188:25\u201331","journal-title":"Discr Appl Math"},{"key":"1662_CR42","first-page":"407","volume":"2020","author":"Juli\u00e1n Salas","year":"2020","unstructured":"Salas Juli\u00e1n, Torra Vicen\u00e7 (2020) Differentially private graph publishing and randomized response for collaborative filtering. Proc Secrypt 2020:407\u2013414","journal-title":"Proc Secrypt"},{"key":"1662_CR43","doi-asserted-by":"crossref","unstructured":"Samarati Pierangela (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027","DOI":"10.1109\/69.971193"},{"issue":"10","key":"1662_CR44","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1007\/s00500-012-0850-4","volume":"16","author":"Klara Stokes","year":"2012","unstructured":"Stokes Klara, Torra V (2012) Reidentification and k-anonymity: a model for disclosure risk in graphs. Soft Comput 16(10):1657\u20131670","journal-title":"Soft Comput"},{"issue":"5","key":"1662_CR45","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"Latanya Sweeney","year":"2002","unstructured":"Sweeney Latanya (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzz Knowl Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzz Knowl Based Syst"},{"key":"1662_CR46","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ins.2015.08.048","volume":"328","author":"T-R Rolando","year":"2016","unstructured":"Rolando T-R, Ismael GY (2016) k-metric antidimension: a privacy measure for social graphs. Inf Sci 328:403\u2013417","journal-title":"Inf Sci"},{"key":"1662_CR47","doi-asserted-by":"crossref","unstructured":"Varrette S, Bouvry P, Cartiaux H, Georgatos F (2014) Management of an academic HPC cluster: The UL experience. In: Proceedings of the 2014 International conference on high performance computing and simulation, pp. 959\u2013967, Bologna, Italy","DOI":"10.1109\/HPCSim.2014.6903792"},{"issue":"3","key":"1662_CR48","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s10115-013-0674-2","volume":"41","author":"Y Wang","year":"2014","unstructured":"Wang Y, Xie L, Zheng B, Lee KCK (2014) High utility k-anonymization for social network publishing. Knowl Inf Syst 41(3):697\u2013725","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1662_CR49","first-page":"127","volume":"6","author":"Yue Wang","year":"2013","unstructured":"Wang Yue, Xintao Wu (2013) Preserving differential privacy in degree-correlation based graph generation. Trans Data Privacy 6(2):127\u2013145","journal-title":"Trans Data Privacy"},{"key":"1662_CR50","doi-asserted-by":"crossref","unstructured":"Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) K-symmetry model for identity anonymization in social networks. In: Proceedings of the 13th international conference on extending database technology, pp. 111\u2013122","DOI":"10.1145\/1739041.1739058"},{"key":"1662_CR51","doi-asserted-by":"crossref","unstructured":"Xiao Q, Chen R, Tan K-L (2014) Differentially private network data release via structural inference. In: Proceedings 20th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp. 911\u2013920. ACM Press","DOI":"10.1145\/2623330.2623642"},{"key":"1662_CR52","doi-asserted-by":"crossref","unstructured":"Zhang J, Cormode G, Procopiuc CM, Srivastava D, Xiao X (2015) Private release of graph statistics using ladder functions. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp. 731\u2013745","DOI":"10.1145\/2723372.2737785"},{"key":"1662_CR53","doi-asserted-by":"crossref","unstructured":"Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the 2008 IEEE 24th international conference on data engineering, pp. 506\u2013515, Washington, DC, USA","DOI":"10.1109\/ICDE.2008.4497459"},{"issue":"1","key":"1662_CR54","doi-asserted-by":"publisher","first-page":"946","DOI":"10.14778\/1687627.1687734","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen Lei, Tamer \u00d6zsu M (2009) K-automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946\u2013957","journal-title":"Proc VLDB Endow"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01662-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01662-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01662-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T23:55:48Z","timestamp":1674863748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01662-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,27]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1662"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01662-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,2,27]]},"assertion":[{"value":"10 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}