{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:03:29Z","timestamp":1774364609636,"version":"3.50.1"},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100003187","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100003187","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2242786"],"award-info":[{"award-number":["2242786"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Security"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cose.2025.104819","type":"journal-article","created":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T15:09:29Z","timestamp":1768144169000},"page":"104819","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Unlinkability and history preserving bisimilarity"],"prefix":"10.1016","volume":"165","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0162-1901","authenticated-orcid":false,"given":"Ross","family":"Horne","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1525-0307","authenticated-orcid":false,"given":"Christian","family":"Johansen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2818-4433","authenticated-orcid":false,"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cose.2025.104819_bib0001","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/3127586","article-title":"The applied pi calculus: mobile values, new names, and secure communication","volume":"65","author":"Abadi","year":"2018","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0002","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1006\/inco.1994.1096","article-title":"Adding action refinement to a finite process algebra","volume":"115","author":"Aceto","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/j.cose.2025.104819_bib0003","series-title":"23rd IEEE Computer Security Foundations Symposium (CSF\u201910)","first-page":"107","article-title":"Analysing unlinkability and anonymity using the applied pi calculus","author":"Arapinis","year":"2010"},{"key":"10.1016\/j.cose.2025.104819_bib0004","series-title":"31st International Conference on Concurrency Theory, CONCUR 2020, September 1\u20134, 2020, Vienna, Austria","first-page":"13:1","article-title":"How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation","author":"Aubert","year":"2020"},{"key":"10.1016\/j.cose.2025.104819_bib0005","series-title":"Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, Warsaw, Poland, 12th September 2022","first-page":"3","article-title":"Bisimulations respecting duration and causality for the non-interleaving applied \u03c0-calculus","author":"Aubert","year":"2022"},{"key":"10.1016\/j.cose.2025.104819_bib0006","series-title":"33rd International Conference on Concurrency Theory","first-page":"30:1","article-title":"Diamonds for security: a non-interleaving operational semantics for the applied pi-calculus","author":"Aubert","year":"2022"},{"issue":"3","key":"10.1016\/j.cose.2025.104819_bib0007","doi-asserted-by":"crossref","DOI":"10.1145\/2825026","article-title":"A survey of security and privacy issues in epassport protocols","volume":"48","author":"Avoine","year":"2016","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0008","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2629638","article-title":"A logic for true concurrency","volume":"61","author":"Baldan","year":"2014","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0009","doi-asserted-by":"crossref","DOI":"10.1145\/3412853","article-title":"Model checking a logic for true concurrency","volume":"21","author":"Baldan","year":"2020","journal-title":"ACM Trans. Comput. Logic"},{"key":"10.1016\/j.cose.2025.104819_bib0010","series-title":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security","first-page":"1144","article-title":"Automated symbolic proofs of observational equivalence","author":"Basin","year":"2015"},{"key":"10.1016\/j.cose.2025.104819_bib0011","series-title":"Technical Report","article-title":"Hereditary History Preserving Bisimulations or What is the Power of the Future Perfect in Program Logics","author":"Bednarczyk","year":"1991"},{"key":"10.1016\/j.cose.2025.104819_bib0012","series-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","first-page":"365","article-title":"A symbolic analysis of privacy for TLS 1.3 with encrypted client hello","author":"Bhargavan","year":"2022"},{"issue":"1\u20132","key":"10.1016\/j.cose.2025.104819_bib0013","first-page":"1","article-title":"Modeling and verifying security protocols with the applied pi calculus and proverif","volume":"1","author":"Blanchet","year":"2016","journal-title":"Found. Trends Privacy Secur."},{"issue":"5","key":"10.1016\/j.cose.2025.104819_bib0014","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s002360050124","article-title":"A fully abstract semantics for causality in the \u03c0-calculus","volume":"35","author":"Boreale","year":"1998","journal-title":"Acta Inform."},{"key":"10.1016\/j.cose.2025.104819_bib0015","series-title":"Proceedings of the ACM on Web Conference 2024, WWW 2024, Singapore, May 13-17, 2024","first-page":"1620","article-title":"SSI, From specifications to protocol? Formally verify security!","author":"Braun","year":"2024"},{"key":"10.1016\/j.cose.2025.104819_bib0016","series-title":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","first-page":"1392","article-title":"Provably unlinkable smart card-based payments","author":"Bursuc","year":"2023"},{"issue":"04","key":"10.1016\/j.cose.2025.104819_bib0017","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1142\/S0129054195000196","article-title":"Observing distribution in processes: static and dynamic localities","volume":"6","author":"Castellani","year":"1995","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.cose.2025.104819_bib0018","series-title":"Handbook of Process Algebra","first-page":"945","article-title":"Process algebras with localities","author":"Castellani","year":"2001"},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0019","article-title":"Decidability of two truly concurrent equivalences for finite bounded petri nets","volume":"19","author":"Cesco","year":"2023","journal-title":"Log. Methods Comput. Sci."},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0020","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/2926715","article-title":"Automated verification of equivalence properties of cryptographic protocols","volume":"17","author":"Chadha","year":"2016","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.cose.2025.104819_bib0021","series-title":"2018 IEEE Symposium on Security and Privacy","first-page":"529","article-title":"DEEPSEC: Deciding equivalence properties in security protocols theory and practice","author":"Cheval","year":"2018"},{"key":"10.1016\/j.cose.2025.104819_bib0022","series-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019","first-page":"905","article-title":"Exploiting symmetries when proving equivalence properties for security protocols","author":"Cheval","year":"2019"},{"key":"10.1016\/j.cose.2025.104819_bib0023","doi-asserted-by":"crossref","DOI":"10.46298\/theoretics.24.4","article-title":"Deepsec: deciding equivalence properties for security protocols \u2013 improved theory and practice","volume":"Volume 3","author":"Cheval","year":"2024","journal-title":"TheoretiCS"},{"key":"10.1016\/j.cose.2025.104819_bib0024","series-title":"36Th IEEE Computer Security Foundations Symposium, CSF 2023, Dubrovnik, Croatia, July 10-14, 2023","first-page":"184","article-title":"Indistinguishability beyond diff-equivalence in proverif","author":"Cheval","year":"2023"},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0025","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10009-002-0103-4","article-title":"Efficient verification of security protocols using partial-order reductions","volume":"4","author":"Clarke","year":"2003","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10.1016\/j.cose.2025.104819_bib0026","series-title":"2017 IEEE European Symposium on Security and Privacy (EuroS&P)","first-page":"451","article-title":"A formal security analysis of the signal messaging protocol","author":"Cohn-Gordon","year":"2017"},{"key":"10.1016\/j.cose.2025.104819_bib0027","series-title":"2017 IEEE 30th Computer Security Foundations Symposium (CSF)","first-page":"481","article-title":"SAT-Equiv: an efficient tool for equivalence properties","author":"Cortier","year":"2017"},{"key":"10.1016\/j.cose.2025.104819_bib0028","series-title":"System Analysis and Modeling, 4Th International SDL and MSC Workshop, SAM 2004, Ottawa, Canada, June 1-4, 2004, Revised Selected Papers","first-page":"171","article-title":"Checking secrecy by means of partial order reduction","author":"Cremers","year":"2004"},{"issue":"29","key":"10.1016\/j.cose.2025.104819_bib0029","article-title":"On the security of public-key protocols","volume":"2","author":"Dolev","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.cose.2025.104819_bib0030","series-title":"Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets, Held in Dagstuhl, September 1996","first-page":"374","article-title":"Decidability and complexity of petri net problems - an introduction","author":"Esparza","year":"1996"},{"key":"10.1016\/j.cose.2025.104819_bib0031","series-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","first-page":"357","article-title":"Strong authentication for RFID systems using the AES algorithm","author":"Feldhofer","year":"2004"},{"key":"10.1016\/j.cose.2025.104819_bib0032","series-title":"Computer Security - ESORICS 2019 - 24th European Symposium on Research in Computer Security, Luxembourg, September 23-27, 2019, Proceedings, Part I","first-page":"577","article-title":"Breaking unlinkability of the ICAO 9303 standard for e-passports using bisimilarity","author":"Filimonov","year":"2019"},{"issue":"1","key":"10.1016\/j.cose.2025.104819_bib0033","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","article-title":"A classification of security properties for process algebras1","volume":"3","author":"Focardi","year":"1995","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.cose.2025.104819_bib0034","series-title":"Foundations of Security Analysis and Design, Tutorial Lectures [Revised Versions of Lectures Given During the IFIP WG 1.7 International School on Foundations of Security Analysis and Design, FOSAD 2000, Bertinoro, Italy, September 2000]","first-page":"331","article-title":"Classification of security properties (part I: information flow)","author":"Focardi","year":"2000"},{"key":"10.1016\/j.cose.2025.104819_bib0035","series-title":"Foundations of Security Analysis and Design II, FOSAD 2001\/2002 Tutorial Lectures","first-page":"139","article-title":"Classification of security properties - part II: network security","author":"Focardi","year":"2002"},{"key":"10.1016\/j.cose.2025.104819_bib0036","series-title":"2010 10th International Conference on Application of Concurrency to System Design","first-page":"191","article-title":"Partial order reduction for branching security protocols","author":"Fokkink","year":"2010"},{"key":"10.1016\/j.cose.2025.104819_bib0037","series-title":"29th USENIX Security Symposium (USENIX Security 20)","first-page":"1857","article-title":"A spectral analysis of noise: a comprehensive, automated, formal analysis of Diffie-Hellman protocols","author":"Girol","year":"2020"},{"key":"10.1016\/j.cose.2025.104819_bib0038","series-title":"CONCUR \u201993","first-page":"66","article-title":"The linear time - branching time spectrum II","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/j.cose.2025.104819_bib0039","series-title":"Handbook of Process Algebra","first-page":"3","article-title":"The linear time-branching time spectrum I. The semantics of concrete, sequential processes","author":"van Glabbeek","year":"2001"},{"key":"10.1016\/j.cose.2025.104819_bib0040","series-title":"MFCS","first-page":"237","article-title":"Equivalence notions for concurrent systems and refinement of actions (extended abstract)","author":"van Glabbeek","year":"1989"},{"issue":"4\/5","key":"10.1016\/j.cose.2025.104819_bib0041","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s002360000041","article-title":"Refinement of actions and equivalence notions for concurrent systems","volume":"37","author":"van Glabbeek","year":"2001","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0042","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1997.2634","article-title":"The difference between splitting in n and n+1","volume":"136","author":"van Glabbeek","year":"1997","journal-title":"Inf. Comput."},{"key":"10.1016\/j.cose.2025.104819_bib0043","series-title":"Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, Proceedings","first-page":"131","article-title":"Interleaving vs true concurrency: some instructive security examples","author":"Gorrieri","year":"2020"},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0044","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1995.1066","article-title":"Split and ST bisimulation semantics","volume":"118","author":"Gorrieri","year":"1995","journal-title":"Inf. Comput."},{"key":"10.1016\/j.cose.2025.104819_bib0045","series-title":"CONCUR \u201996, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings","first-page":"84","article-title":"Comparing transition systems with independence and asynchronous transition systems","author":"Hildebrandt","year":"1996"},{"key":"10.1016\/j.cose.2025.104819_bib0046","series-title":"Security and Privacy (S&P), 2016 IEEE Symposium on","first-page":"564","article-title":"A method for verifying privacy-type properties: the unbounded case","author":"Hirschi","year":"2016"},{"issue":"3","key":"10.1016\/j.cose.2025.104819_bib0047","doi-asserted-by":"crossref","first-page":"277","DOI":"10.3233\/JCS-171070","article-title":"A method for unbounded verification of privacy-type properties","volume":"27","author":"Hirschi","year":"2019","journal-title":"J. Comput. Secur."},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0048","first-page":"24","article-title":"Discovering ePassport vulnerabilities using bisimilarity","volume":"17","author":"Horne","year":"2021","journal-title":"Log. Meth. Comput. Sci."},{"key":"10.1016\/j.cose.2025.104819_bib0049","series-title":"Technical Report","article-title":"Machine Readable Travel Documents. Part 11: Security mechanisms for MRTDs","author":"ICAO","year":"2015"},{"key":"10.1016\/j.cose.2025.104819_bib0050","unstructured":"ISO, 2017. Common criteria for information technology security evaluation, part 2: security functional components. version 3.1, revision 5."},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0051","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","article-title":"Undecidability of bisimilarity for petri nets and some related problems","volume":"148","author":"Jancar","year":"1995","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.cose.2025.104819_bib0052","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/j.jlamp.2015.10.009","article-title":"ST-Structures","volume":"85","author":"Johansen","year":"2016","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.cose.2025.104819_bib0053","series-title":"Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS \u201993), Montreal, Canada, June 19-23, 1993","first-page":"418","article-title":"Bisimulation and open maps","author":"Joyal","year":"1993"},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0054","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation from open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"Inf. Comput."},{"issue":"5","key":"10.1016\/j.cose.2025.104819_bib0055","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/JCS-160556","article-title":"Automated analysis of security protocols with global state","volume":"24","author":"Kremer","year":"2016","journal-title":"JCS"},{"key":"10.1016\/j.cose.2025.104819_bib0056","series-title":"International Conference on Computer Aided Verification","first-page":"696","article-title":"The TAMARIN prover for the symbolic analysis of security protocols","author":"Meier","year":"2013"},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0057","doi-asserted-by":"crossref","first-page":"575","DOI":"10.3233\/JCS-2009-0351","article-title":"Constraint differentiation: search-space reduction for the constraint-based analysis of security protocols","volume":"18","author":"M\u00f6dersheim","year":"2010","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.cose.2025.104819_bib0058","series-title":"STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, L\u00fcBeck, Germany, February 27-March 1, 1997, Proceedings","first-page":"413","article-title":"Minimal transition systems for history-preserving bisimulation","author":"Montanari","year":"1997"},{"key":"10.1016\/j.cose.2025.104819_bib0059","series-title":"Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings","first-page":"328","article-title":"CCS, Location and asynchronous transition systems","author":"Mukund","year":"1992"},{"key":"10.1016\/j.cose.2025.104819_bib0060","series-title":"CONCUR \u201994","first-page":"385","article-title":"Bisimulation for models in concurrency","author":"Nielsen","year":"1994"},{"issue":"2","key":"10.1016\/j.cose.2025.104819_bib0061","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129513000510","article-title":"Event identifier logic","volume":"24","author":"Phillips","year":"2014","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"10.1016\/j.cose.2025.104819_bib0062","first-page":"357","article-title":"Behavior structures and nets","volume":"11","author":"Rabinovich","year":"1988","journal-title":"Fund. Inform."},{"issue":"1-2","key":"10.1016\/j.cose.2025.104819_bib0063","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/JCS-2001-91-204","article-title":"Process algebra and non-interference","volume":"9","author":"Ryan","year":"2001","journal-title":"J. Comput. Secur."},{"issue":"1","key":"10.1016\/j.cose.2025.104819_bib0064","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(95)00020-8","article-title":"Locality and interleaving semantics in calculi for mobile processes","volume":"155","author":"Sangiorgi","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.cose.2025.104819_bib0065","series-title":"Security and Trust Management","first-page":"162","article-title":"A formal definition of protocol indistinguishability and its verification using maude-NPA","author":"Santiago","year":"2014"},{"key":"10.1016\/j.cose.2025.104819_bib0066","series-title":"14th Asian Symposium on Programming Languages and Systems (APLAS\u201916)","first-page":"87","article-title":"Spec: an equivalence checker for security protocols","author":"Tiu","year":"2016"},{"key":"10.1016\/j.cose.2025.104819_bib0067","series-title":"STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings","first-page":"309","article-title":"Bisimulatio4n and action refinement","author":"Vogler","year":"1991"},{"issue":"1","key":"10.1016\/j.cose.2025.104819_bib0068","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/inco.1996.0048","article-title":"The limit of splitn-language equivalence","volume":"127","author":"Vogler","year":"1996","journal-title":"Inf. Comput."}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404825005085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404825005085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:17:28Z","timestamp":1774361848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404825005085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":68,"alternative-id":["S0167404825005085"],"URL":"https:\/\/doi.org\/10.1016\/j.cose.2025.104819","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Unlinkability and history preserving bisimilarity","name":"articletitle","label":"Article Title"},{"value":"Computers & Security","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cose.2025.104819","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104819"}}