{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:56Z","timestamp":1740181556973,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Scalable and secure implementation of central bank digital currencies (CBDC) has been a challenge. Blockchains provide high operator-independent security and enable central banks to outsource CBDC operations while retaining control over the amount of circulating money. Scalability of blockchain depends on the possibility of decomposing the blockchain. We study how the choice of money scheme: accounts, bills, or unspent transaction outputs (UTXOs) influences the existence of secure and decomposable blockchain implementations of CBDC. We give formal definitions to money schemes, their decompositions,<jats:italic>atomic decompositions<\/jats:italic>inspired from the properties of blockchain implementations. For our formalism, we use tools from universal algebra and category theory. We present a general decomposition theory and conditions under which money schemes have atomic decompositions. Bill money schemes meet these conditions but account and UTXO schemes do not. Bill schemes enable scalable and secure implementations of CBDC while the more traditional schemes have some issues.<\/jats:p>","DOI":"10.1007\/s42979-023-02232-y","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T11:02:55Z","timestamp":1699441375000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Theory of Secure and Efficient Implementation of Electronic Money"],"prefix":"10.1007","volume":"4","author":[{"given":"Ahto","family":"Buldas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3376-7489","authenticated-orcid":false,"given":"Dirk","family":"Draheim","sequence":"additional","affiliation":[]},{"given":"M\u00e4rt","family":"Saarepera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"key":"2232_CR1","doi-asserted-by":"publisher","unstructured":"Buldas A, Draheim D, Gault M, Laanoja R, Nagumo T, Saarepera M, Shah SA, Simm J, Steiner J, Tammet T, Truu A. An ultra-scalable blockchain platform for universal asset tokenization: design and implementation. IEEE Access. 2022;10:77284\u201377322. https:\/\/doi.org\/10.1109\/ACCESS.2022.3192837","DOI":"10.1109\/ACCESS.2022.3192837"},{"key":"2232_CR2","doi-asserted-by":"crossref","unstructured":"Danezis G, Meiklejohn S. Centrally banked cryptocurrencies. In: Proceedings of NDSS\u201916\u2014the 23rd annual symposium on network and distributed system security. Reston: The Internet Society; 2016. p. 1\u201314.","DOI":"10.14722\/ndss.2016.23187"},{"key":"2232_CR3","unstructured":"Federal Reserve Bank of Boston and Massachusetts Institute of Technology Digital Currency Initiative: Project Hamilton Phase\u00a01\u2014A High Performance Payment Processing System Designed for Central Bank Digital Currencies. Federal Reserve Bank of Boston, Boston (3 February 2022). https:\/\/www.bostonfed.org\/-\/media\/Documents\/Project-Hamilton\/Project-Hamilton-Phase-1-Whitepaper.pdf. Accessed 26 Mar 2022."},{"key":"2232_CR4","unstructured":"Giesecke+Devrient: G+D Filia\u2014A Digital Complement to Cash. Giesecke+Devrient, Munich, Germany (2021). https:\/\/www.gi-de.com\/corporate\/Payment\/Central_Bank_Digital_Currencies\/GD_brochure_filia.pdf. Accessed 06 Aug 2022."},{"key":"2232_CR5","doi-asserted-by":"publisher","first-page":"14155","DOI":"10.1109\/ACCESS.2020.2965147","volume":"8","author":"G Yu","year":"2020","unstructured":"Yu G, Wang X, Yu K, Ni W, Zhang JA, Liu RP. Survey: sharding in blockchains. IEEE Access. 2020;8:14155\u201381. https:\/\/doi.org\/10.1109\/ACCESS.2020.2965147.","journal-title":"IEEE Access"},{"key":"2232_CR6","doi-asserted-by":"publisher","first-page":"125244","DOI":"10.1109\/ACCESS.2020.3007251","volume":"8","author":"A Hafid","year":"2020","unstructured":"Hafid A, Hafid AS, Samih M. Scaling blockchains: a comprehensive survey. IEEE Access. 2020;8:125244\u201362. https:\/\/doi.org\/10.1109\/ACCESS.2020.3007251.","journal-title":"IEEE Access"},{"key":"2232_CR7","doi-asserted-by":"publisher","unstructured":"Luu L, Narayanan V, Zheng C, Baweja K, Gilbert S, Saxena P. A secure sharding protocol for open blockchains. In: Proceedings of CCS\u201916\u2014the 23rd ACM SIGSAC conference on computer and communications security. New York: 2016; ACM. p. 17\u201330. https:\/\/doi.org\/10.1145\/2976749.2978389.","DOI":"10.1145\/2976749.2978389"},{"issue":"101055","key":"2232_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.pmcj.2019.04.004","volume":"59","author":"H Chen","year":"2019","unstructured":"Chen H, Wang Y. SSChain: a full sharding protocol for public blockchain without data migration overhead. Pervasive Mob Comput. 2019;59(101055):1\u201315.","journal-title":"Pervasive Mob Comput"},{"issue":"406","key":"2232_CR9","first-page":"1","volume":"2017","author":"E Kokoris-Kogias","year":"2017","unstructured":"Kokoris-Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B. OmniLedger: a secure, scale-out, decentralized ledger via sharding. Cryptol ePrint Arch Rep. 2017;2017(406):1\u201316.","journal-title":"Cryptol ePrint Arch Rep"},{"key":"2232_CR10","doi-asserted-by":"publisher","unstructured":"Kokoris-Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B. OmniLedger: a secure, scale-out, decentralized ledger via sharding. In: Proceedings of S &P\u201918\u2014the 39th IEEE symposium on security and privacy. New York: IEEE; 2018. p. 583\u201398. https:\/\/doi.org\/10.1109\/SP.2018.000-5.","DOI":"10.1109\/SP.2018.000-5"},{"key":"2232_CR11","doi-asserted-by":"publisher","unstructured":"Zamani M, Movahedi M, Raykova M. RapidChain: scaling blockchain via full sharding. In: Proceedings of CCS\u201918\u2014the 25th ACM SIGSAC conference on computer and communications security. New York: ACM; 2018. https:\/\/doi.org\/10.1145\/3243734.3243853.","DOI":"10.1145\/3243734.3243853"},{"key":"2232_CR12","doi-asserted-by":"publisher","unstructured":"Dang H, Dinh TTA, Loghin D, Chang E-C, Lin Q, Ooi BC. Towards scaling blockchain systems via sharding. In: Proceedings of SIGMOD\u201919: the 2019 international conference on management of data. New York: ACM; 2019. p. 123\u201340. https:\/\/doi.org\/10.1145\/3299869.3319889.","DOI":"10.1145\/3299869.3319889"},{"key":"2232_CR13","doi-asserted-by":"publisher","unstructured":"Manuskin A, Mirkin M, Eyal I. Ostraka: secure blockchain scaling by node sharding. In: Proceedings of Euro S &PW\u20192020\u2014the 2020 IEEE European symposium on security and privacy workshops. New York: IEEE; 2020. p. 397\u2013406. https:\/\/doi.org\/10.1109\/EuroSPW51379.2020.00060.","DOI":"10.1109\/EuroSPW51379.2020.00060"},{"key":"2232_CR14","unstructured":"Stegos AG. A Platform for Privacy Applications, version 1.0. 2019. https:\/\/stegos.com\/docs\/stegos-whitepaper.pdf. Accessed 3 July 2022."},{"key":"2232_CR15","unstructured":"Buterin V. A next generation smart contract and decentralized application platform\u2014Ethereum White Paper. 2015."},{"key":"2232_CR16","unstructured":"Drake J. Ethereum Sharding. 2018. https:\/\/youtu.be\/J4rylD6w2S4. Accessed 26 Mar 2022."},{"key":"2232_CR17","unstructured":"Wang J, Wang H. Monoxide: scale out blockchains with asynchronous consensus zones. In: Proceedings of NSDI\u201919\u201416th USENIX symposium on networked systems design and implementation. USENIX Association, Berkeley. 2019. p. 95\u2013112."},{"key":"2232_CR18","unstructured":"The ZILLIQA Team. The ZILLIQA Technical Whitepaper, Version 0.1. 2017. https:\/\/docs.zilliqa.com\/whitepaper.pdf. Accessed 3 July 2022."},{"key":"2232_CR19","doi-asserted-by":"crossref","unstructured":"Harmony Team. Harmony Technical Whitepaper, Version 2.0. 2018. https:\/\/harmony.one\/whitepaper.pdf. Accessed 3 July 2022.","DOI":"10.2139\/ssrn.3442330"},{"key":"2232_CR20","unstructured":"Hafid A. Probabilistic models to analyze the security of sharding-based blockchain protocols. PhD thesis, University of Mulay Ismail, University of Montreal. 2021."},{"key":"2232_CR21","doi-asserted-by":"crossref","unstructured":"Al-Bassam M, Sonnino A, Bano S, Hrycyszyn D, Danezis G. Chainspace: a sharded smart contracts platform. In: Proceedings of NDSS\u201918\u2014the 25th annual network and distributed system security symposium. The Internet Society, Reston. 2018.","DOI":"10.14722\/ndss.2018.23241"},{"key":"2232_CR22","doi-asserted-by":"publisher","first-page":"158893","DOI":"10.1109\/ACCESS.2020.3020319","volume":"8","author":"N Sohrabi","year":"2020","unstructured":"Sohrabi N, Tari Z. ZyConChain: a scalable blockchain for general applications. IEEE Access. 2020;8:158893\u2013910. https:\/\/doi.org\/10.1109\/ACCESS.2020.3020319.","journal-title":"IEEE Access"},{"key":"2232_CR23","doi-asserted-by":"publisher","first-page":"87665","DOI":"10.1109\/ACCESS.2020.2993759","volume":"8","author":"M Du","year":"2020","unstructured":"Du M, Chen Q, Ma X. MBFT: a new consensus algorithm for consortium blockchain. IEEE Access. 2020;8:87665\u201375. https:\/\/doi.org\/10.1109\/ACCESS.2020.2993759.","journal-title":"IEEE Access"},{"issue":"102700","key":"2232_CR24","first-page":"1","volume":"58","author":"WK Chan","year":"2021","unstructured":"Chan WK, Chin J-J, Goh VT. Simple and scalable blockchain with privacy. J Inf Secur Appl. 2021;58(102700):1\u201311.","journal-title":"J Inf Secur Appl"},{"issue":"102471","key":"2232_CR25","first-page":"1","volume":"1491","author":"A Singh","year":"2020","unstructured":"Singh A, Click K, Parizi RM, Zhang Q, Dehghantanha A, Choo K-KR. Sidechain technologies in blockchain networks: an examination and state-of-the-art review. J Netw Comput Appl. 2020;1491(102471):1\u201316.","journal-title":"J Netw Comput Appl"},{"key":"2232_CR26","doi-asserted-by":"publisher","unstructured":"Meiklejohn S, Orlandi C. Privacy-enhancing overlays in Bitcoin. In: Proceedings of FC\u20192015\u2014the 19th international conference on financial cryptography and data security. Lecture notes in computer science, vol 8976. Berlin: Springer; 2015. p. 127\u2013141. https:\/\/doi.org\/10.1007\/978-3-662-48051-9_10.","DOI":"10.1007\/978-3-662-48051-9_10"},{"key":"2232_CR27","doi-asserted-by":"crossref","unstructured":"Chakravarty MMT, Chapman J, MacKenzie K, Melkonian O, Peyton Jones M, Wadler P. The extended UTXO model. In: Financial cryptography and data security. Lecture Notes in Computer Science, vol 12063. Berlin: Springer; 2020. p. 525\u201339.","DOI":"10.1007\/978-3-030-54455-3_37"},{"key":"2232_CR28","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1017\/S0960129521000438","volume":"31","author":"MJ Gabbay","year":"2021","unstructured":"Gabbay MJ. Algebras of UTxO blockchains. Math Struct Comput Sci. 2021;31:1034\u201389.","journal-title":"Math Struct Comput Sci"},{"key":"2232_CR29","doi-asserted-by":"crossref","unstructured":"Br\u00fcnjes L, Gabbay MJ. UTxO- vs account-based smart contract blockchain programming paradigms. In: Proceeding of ISOLA\u20192020\u2014the 9th international symposium on leveraging applications of formal methods, verification and validation. Lecture Notes in Computer Science, vol 12478. Berlin: Springer; 2020. p. 73\u201388.","DOI":"10.1007\/978-3-030-61467-6_6"},{"key":"2232_CR30","doi-asserted-by":"crossref","unstructured":"Reynolds JC. Separation logic: a logic for shared mutable data structures. In: Proceedings of LICS\u20192002\u2014the 17th IEEE symposium on logic in computer science. New York: IEEE; 2002. p. 55\u201374.","DOI":"10.1109\/LICS.2002.1029817"},{"key":"2232_CR31","volume-title":"Communicating and mobile systems: the $$\\pi $$-calculus","author":"R Milner","year":"1999","unstructured":"Milner R. Communicating and mobile systems: the $$\\pi $$-calculus. Cambridge: Cambridge University Press; 1999."},{"key":"2232_CR32","unstructured":"Gabbay MJ. A theory of inductive definitions with $$\\alpha $$-equivalence\u2014semantics, implementation, programming language. PhD thesis, DPMMS and Trinity College, Cambridge University. 2000."},{"issue":"3\u20135","key":"2232_CR33","first-page":"341","volume":"13","author":"MJ Gabbay","year":"2001","unstructured":"Gabbay MJ, Pitts AM. A new approach to abstract syntax with variable binding. Formal Aspects Comput. 2001;13(3\u20135):341\u201363.","journal-title":"Formal Aspects Comput"},{"key":"2232_CR34","unstructured":"Gabbay MJ, Ghica DR, Petrisan D. Leaving the nest: nominal techniques for variables with interleaving scopes. In: Proceeeding of CSL\u20192015\u2014the 4th EACSL annual conference on computer science logic. Leibniz International Proceedings in Informatics, vol 41. Leibniz-Zentrum f\u00fcr Informatik: Dagstuhl Publishing, Dagstuhl; 2015. p. 374\u201389."},{"key":"2232_CR35","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1093\/logcom\/exz015","volume":"30","author":"MJ Gabbay","year":"2020","unstructured":"Gabbay MJ. Equivariant ZFA and the foundations of nominal techniques. J Log Comput. 2020;30:525\u201348.","journal-title":"J Log Comput"},{"key":"2232_CR36","unstructured":"Nester C. A foundation for ledger structures. In: Proceedings of Tokenomics 2020\u2014the 2nd international conference on blockchain economics, security and protocols. Open Access Series in Informatics, vol. 82. Dagstuhl: Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl Publishing; 2021, p. 7\u20131713."},{"key":"2232_CR37","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ic.2016.02.008","volume":"250","author":"B Coecke","year":"2016","unstructured":"Coecke B, Fritz T, Spekkens RW. A mathematical theory of resources. Inf Comput. 2016;250:59\u201386.","journal-title":"Inf Comput"},{"issue":"9","key":"2232_CR38","first-page":"233","volume":"26","author":"MB McCurdy","year":"2012","unstructured":"McCurdy MB. Graphical methods for Tannaka duality of weak bialgebras and weak Hopf algebras. Theory Appl Categ. 2012;26(9):233\u201380.","journal-title":"Theory Appl Categ"},{"key":"2232_CR39","doi-asserted-by":"crossref","unstructured":"Selinger P. A survey of graphical languages for monoidal categories. In: New structures for physics. Lecture notes in physics, vol 813. Berlin: Springer; 2010. p. 289\u2013355.","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"2232_CR40","doi-asserted-by":"publisher","unstructured":"Valliappan N, Mirliaz S, Lobo\u00a0Vesga E, Russo A. Towards adding variety to simplicity. In: Proceedings of ISoLA\u20192018\u2014the 8th international symposium on leveraging applications of formal methods, verification and validation. Lecture notes in computer science, vol 11247. Berlin: Springer; 2018. p. 414\u201331. https:\/\/doi.org\/10.1109\/Cybermatics_2018.2018.00189.","DOI":"10.1109\/Cybermatics_2018.2018.00189"},{"key":"2232_CR41","doi-asserted-by":"publisher","unstructured":"Buldas A, Saarepera M, Steiner J, Draheim D. A unifying theory of electronic money and payment systems. TechRxiv. 2021. https:\/\/doi.org\/10.36227\/techrxiv.14994558.","DOI":"10.36227\/techrxiv.14994558"},{"key":"2232_CR42","doi-asserted-by":"publisher","unstructured":"Buldas A, Draheim D, Saarepera M. Secure and efficient implementation of electronic money. In: Proceedings Fof FDSE\u20192022\u2014the 9th international conference future data and security engineering. communications in computer and information science, vol 1688. Berlin: Springer; 2022. p. 34\u201351. https:\/\/doi.org\/10.1007\/978-981-19-8069-5_3.","DOI":"10.1007\/978-981-19-8069-5_3"},{"key":"2232_CR43","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y. Security against covert adversaries: efficient protocols for realistic adversaries. In: Vadhan SP, editor. Proceedings of TCC\u20192007\u2014the 4th theory of cryptography conference. Lecture notes in computer science, vol 4392. Berlin: Springer; 2007. p. 137\u2013156.","DOI":"10.1007\/978-3-540-70936-7_8"},{"issue":"2","key":"2232_CR44","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2007","unstructured":"Aumann Y, Lindell Y. Security against covert adversaries: efficient protocols for realistic adversaries. J Cryptol. 2007;23(2):281\u2013343.","journal-title":"J Cryptol"},{"key":"2232_CR45","doi-asserted-by":"crossref","unstructured":"Buldas A, Niitsoo M. Optimally tight security proofs for hash-then-publish time-stamping. In: Information security and privacy\u2014ACISP 2010. Lecture notes in computer science, vol 6168. Berlin: Springer; 2010. p. 318\u201335.","DOI":"10.1007\/978-3-642-14081-5_20"},{"key":"2232_CR46","unstructured":"European Central Bank, Eesti Pank, Bank of Greece, Deutsche Bundesbank, Central Bank of Ireland, Banco de Espa\u00f1a, Latvijas Banka, Banca d\u2019Italia, De Nederlandsche Bank: Work Stream\u00a03: A New Solution \u2013 Blockchain & eID. July 2021. Accessed 28 Mar 2022. https:\/\/www.ecb.europa.eu\/paym\/digital_euro\/investigation\/profuse\/shared\/files\/deexp\/ecb.deexp211011_3.en.pdf. Accessed 28 Mar 2022. https:\/\/haldus.eestipank.ee\/sites\/default\/files\/2021-07\/Work stream 3-A New Solution-BlockchainandeID_1.pdf."},{"key":"2232_CR47","unstructured":"Olt R, Meidla T, Ilves L, Steiner J. Summary report: results of the Eesti Pank\u2014Guardtime CBDC Research. Eesti Pank, Guardtime, Tallinn. 2021. https:\/\/haldus.eestipank.ee\/sites\/default\/files\/2021-12\/EP-Guardtime_CBDC_Research_2021_eng.pdf. Accessed 11 Mar 2022."},{"key":"2232_CR48","unstructured":"Buldas A, Saarepera M, Steiner J, Ilves L, Olt R, Meidla T. Formal model of money schemes and their implications for central bank digital currency. Eesti Pank, Guardtime, Tallinn. 2021. https:\/\/haldus.eestipank.ee\/sites\/default\/files\/2021-12\/EP-A_Formal_Model_of_Money_2021_eng.pdf. Accessed: 11 Mar 2022."},{"key":"2232_CR49","unstructured":"Eesti Pank. Eesti Pank Ran an Experiment to Investigate the Technological Possibilities of a Central Bank Digital Currency Based on Blockchain, Eesti Pank. 2021. https:\/\/www.eestipank.ee\/en\/press\/eesti-pank-ran-experiment-investigate-technological-possibilities-central-bank-digital-currency-13122021. Accessed 11 Mar 2022."},{"key":"2232_CR50","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1038\/d41586-018-01625-x","volume":"554","author":"S Foteinis","year":"2018","unstructured":"Foteinis S. Bitcoin\u2019s alarming carbon footprint. Nature. 2018;554:169.","journal-title":"Nature"},{"key":"2232_CR51","volume-title":"The carbon emissions of bitcoin from an investor perspective","author":"P Sandner","year":"2021","unstructured":"Sandner P, Lichti C, Heidt C, Richter R, Schaub B. The carbon emissions of bitcoin from an investor perspective. Frankfurt: Frankfurt School Blockchain Center; 2021."},{"key":"2232_CR52","unstructured":"Trespalacios JP, Dijk J. The Carbon Footprint of Bitcoin. De Nederlandsche Bank, Amsterdam. 2021. https:\/\/www.dnb.nl\/media\/1ftd2xjl\/the-carbon-footprint-of-bitcoin.pdf. Accessed 29 Mar 2022."},{"key":"2232_CR53","doi-asserted-by":"crossref","unstructured":"Buldas A, Laur S. Knowledge-binding commitments with applications in time-stamping. In: Okamoto T, X W, editors. Proceedings of PKC\u20192007\u2014the 10th international conference on practice and theory in public-key cryptography. Lecture notes in computer science, vol 4450. Berlin: Springer; 2007. p. 150\u201365.","DOI":"10.1007\/978-3-540-71677-8_11"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02232-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-02232-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02232-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T17:24:41Z","timestamp":1730481881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-02232-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"references-count":53,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["2232"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-02232-y","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"30 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"861"}}