{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:13Z","timestamp":1740108253952,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T00:00:00Z","timestamp":1633651200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T00:00:00Z","timestamp":1633651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"spanish research council","award":["QOSDATA (PID2020-119461-GB-I00)"],"award-info":[{"award-number":["QOSDATA (PID2020-119461-GB-I00)"]}]},{"DOI":"10.13039\/100012818","name":"comunidad de madrid","doi-asserted-by":"publisher","award":["EDGEDATA (P2018\/TCS-4499)"],"award-info":[{"award-number":["EDGEDATA (P2018\/TCS-4499)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction.<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\varOmega $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03a9<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and<jats:inline-formula><jats:alternatives><jats:tex-math>$$A\\varOmega '$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>A<\/mml:mi><mml:msup><mml:mi>\u03a9<\/mml:mi><mml:mo>\u2032<\/mml:mo><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using<jats:inline-formula><jats:alternatives><jats:tex-math>$$A\\varOmega '$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>A<\/mml:mi><mml:msup><mml:mi>\u03a9<\/mml:mi><mml:mo>\u2032<\/mml:mo><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of<jats:inline-formula><jats:alternatives><jats:tex-math>$$A\\varOmega '$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>A<\/mml:mi><mml:msup><mml:mi>\u03a9<\/mml:mi><mml:mo>\u2032<\/mml:mo><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>for these new failure models.<\/jats:p>","DOI":"10.1007\/s00607-021-01023-8","type":"journal-article","created":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T05:16:34Z","timestamp":1633756594000},"page":"2811-2837","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Consensus in anonymous asynchronous systems with crash-recovery and omission failures"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2006-2690","authenticated-orcid":false,"given":"Ernesto","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"L\u00f3pez-Presa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Pati\u00f1o-Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,8]]},"reference":[{"issue":"2","key":"1023_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225\u2013267","journal-title":"J ACM"},{"issue":"2","key":"1023_CR2","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382","journal-title":"J ACM"},{"issue":"2","key":"1023_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1883612.1883616","volume":"43","author":"FC Freiling","year":"2011","unstructured":"Freiling FC, Guerraoui R, Kuznetsov P (2011) The failure detector abstraction. ACM Comput Surv 43(2):1\u201340","journal-title":"ACM Comput Surv"},{"key":"1023_CR4","first-page":"1181","volume":"2","author":"M Raynal","year":"2009","unstructured":"Raynal M (2009) Failure detectors for asynchronous distributed systems: an introduction. Wiley Encyclop Comput Sci Eng 2:1181\u20131191","journal-title":"Wiley Encyclop Comput Sci Eng"},{"key":"1023_CR5","doi-asserted-by":"crossref","unstructured":"Raynal M (2010) Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers,","DOI":"10.2200\/S00236ED1V01Y201004DCT002"},{"issue":"4","key":"1023_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Hadzilacos V (1996) The weakest failure detector for solving consensus. J ACM 43(4):685\u2013722","journal-title":"J ACM"},{"issue":"2","key":"1023_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050070","volume":"13","author":"MK Aguilera","year":"2000","unstructured":"Aguilera MK, Chen W, Toueg S (2000) Failure detection and consensus in the crash-recovery model. Distrib Comput 13(2):99\u2013125","journal-title":"Distrib Comput"},{"key":"1023_CR8","unstructured":"Hurfin M, Most\u00e9faoui A, Raynal M (1998) Consensus in asynchronous systems where processes can crash and recover. In: The seventeenth symposium on reliable distributed systems, SRDS 1998, West Lafayette, Indiana, USA, October 20-22, 1998, proceedings. pp 280\u2013286. IEEE Computer Society"},{"issue":"3","key":"1023_CR9","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"kJ Perry","year":"1986","unstructured":"Perry kJ, Toueg S (1986) Distributed agreement in the presence of processor and communication faults. IEEE Trans Software Eng 12(3):477\u2013482","journal-title":"IEEE Trans Software Eng"},{"key":"1023_CR10","doi-asserted-by":"crossref","unstructured":"Avoine G, G\u00e4rtner FC, Guerraoui R, Vukolic M (2005) Gracefully degrading fair exchange with security modules. In: Dal Cin M, Ka\u00e2niche M, Pataricza A (eds) Dependable computing - EDCC-5, 5th European dependable computing conference, Budapest, Hungary, April 20\u201322, 2005, Proceedings, vol 3463. Springer, Lecture notes in computer science, pp 55\u201371","DOI":"10.1007\/11408901_5"},{"key":"1023_CR11","doi-asserted-by":"crossref","unstructured":"Fort M, Freiling F, Penso LD, Benenson Z, Kesdogan D (2006) Trustedpals: Secure multiparty computation implemented with smart cards. In: Dieter G, Jan M, Andrei S (eds.), Computer Security: ESORICS 2006, 11th European symposium on research in computer security, Hamburg, Germany. September 18\u201320, 2006, Proceedings, vol 4189. Springer, Lecture notes in computer science, pp 34\u201348","DOI":"10.1007\/11863908_3"},{"issue":"2","key":"1023_CR12","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.jnca.2005.12.004","volume":"30","author":"C-C Chang","year":"2007","unstructured":"Chang C-C, Lin C-Y, Lin K-C (2007) Simple efficient mutual anonymity protocols for peer-to-peer network based on primitive roots. J Netw Comput Appl 30(2):662\u2013676","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"1023_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum D (1981) Untraceable electronic mail, return addresses, and digital pseudonyms. Commun ACM 24(2):84\u201388","journal-title":"Commun ACM"},{"key":"1023_CR14","doi-asserted-by":"crossref","unstructured":"Chothia T, Chatzikokolakis K (2005) A survey of anonymous peer-to-peer file-sharing. In: Enokido T, Yan L, Xiao B, Kim D, Dai Y-S, Yang LT (eds.), Embedded and ubiquitous computing: EUC 2005 Workshops, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, December 6\u20139, 2005, Proceedings, vol 3823. Lecture notes in computer science. Springer, pp 744\u2013755","DOI":"10.1007\/11596042_77"},{"key":"1023_CR15","unstructured":"Angluin D, Aspnes J, Eisenstat D, Ruppert E (2005) On the power of anonymous one-way communication. In: J.H. Anderson, G. Prencipe, R. Wattenhofer (Eds.), Principles of distributed systems, 9th international conference. OPODIS 2005, Pisa, Italy, December 12\u201314, 2005, Revised Selected Papers, 3974. Lecture notes in computer science. Springer, pp 396\u2013411"},{"issue":"4","key":"1023_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393\u2013422","journal-title":"Comput Netw"},{"issue":"4","key":"1023_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253","journal-title":"Distrib Comput"},{"key":"1023_CR18","doi-asserted-by":"crossref","unstructured":"Durresi A,Paruchuri V,Durresi M,Barolli L (2005) A hierarchical anonymous communication protocol for sensor networks. In: Yang LT,Amamiya M,Liu Z, Guo M, Rammig FJ (Eds.), Embedded and ubiquitous computing: EUC 2005, international conference EUC 2005, Nagasaki, Japan, December 6-9, 2005, proceedings. volume 3824 of Lecture notes in computer science. pp 1123\u20131132. Springer","DOI":"10.1007\/11596356_111"},{"issue":"6","key":"1023_CR19","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.adhoc.2008.10.006","volume":"7","author":"EM Ould-Ahmed-Vall","year":"2009","unstructured":"Ould-Ahmed-Vall EM, Blough Douglas M, Heck-Ferri Bonnie S, Riley George F (2009) Distributed global ID assignment for wireless sensor networks. Ad Hoc Netw 7(6):1194\u20131216","journal-title":"Ad Hoc Netw"},{"issue":"3","key":"1023_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00446-012-0169-5","volume":"26","author":"F Bonnet","year":"2013","unstructured":"Bonnet F, Raynal M (2013) Anonymous asynchronous systems: the case of failure detectors. Distrib Comput 26(3):141\u2013158","journal-title":"Distrib Comput"},{"issue":"10","key":"1023_CR21","doi-asserted-by":"publisher","first-page":"3726","DOI":"10.1007\/s11227-015-1460-6","volume":"71","author":"E Jim\u00e9nez","year":"2015","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Herrera C, Tang J (2015) Eventual election of multiple leaders for solving consensus in anonymous systems. J Supercomput 71(10):3726\u20133743","journal-title":"J Supercomput"},{"key":"1023_CR22","unstructured":"Bouzid Z, Travers C (2012) Brief announcement: anonymity, failures, detectors and consensus. In: Marcos KA (ed.), Distributed computing: 26th international symposium, DISC 2012, Salvador, Brazil, October 16\u201318, 2012. Proceedings"},{"key":"1023_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"H Attiya","year":"2004","unstructured":"Attiya H, Welch JL (2004) Distributed computing: fundamentals, simulations, and advanced topics, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"1023_CR24","unstructured":"Nancy A (1996) Lynch. Morgan Kaufmann, Distributed Algorithms"},{"issue":"4","key":"1023_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2019591.2019592","volume":"6","author":"F Bonnet","year":"2011","unstructured":"Bonnet F, Raynal M (2011) The price of anonymity: optimal consensus despite asynchrony, crash, and anonymity. TAAS 6(4):1\u201328","journal-title":"TAAS"},{"key":"1023_CR26","doi-asserted-by":"crossref","unstructured":"Bouzid Z ,Travers C (2012). Anonymity, failures, detectors and consensus. Working paper or preprint, August","DOI":"10.1007\/978-3-642-33651-5_41"},{"issue":"4","key":"1023_CR27","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TDSC.2012.23","volume":"9","author":"R Corti\u00f1as","year":"2012","unstructured":"Corti\u00f1as R, Freiling Felix C, Ghajar-Azadanlou M, Lafuente A, Larrea M, Lucia DP, Iratxe SA (2012) Secure failure detection and consensus in trustedpals. IEEE Trans Dependable Secur Comput 9(4):610\u2013625","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"1023_CR28","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet C, Fauconnier H, FC Freiling (2005) Revisiting failure detection and consensus in omission failure environments. In: D\u00a0Van Hung,Wirsing M (Eds.), Theoretical aspects of computing: ICTAC 2005, second international colloquium, Hanoi, Vietnam. October 17-21, 2005, Proceedings","DOI":"10.1007\/11560647_26"},{"key":"1023_CR29","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet C, Fauconnier H, A Tielmann, Freiling FC, Kilic M (2009) Message-efficient omission-tolerant consensus with limited synchrony. In 23rd IEEE international symposium on parallel and distributed processing, IPDPS 2009, Rome, Italy, May 23\u201329, 2009. pp 1\u20138. IEEE","DOI":"10.1109\/IPDPS.2009.5160899"},{"key":"1023_CR30","doi-asserted-by":"crossref","unstructured":"Freiling FC, Lambertz C, Majster-Cederbaum M (2009). Modular consensus algorithms for the crash-recovery model. In: 2009 International conference on parallel and distributed computing, applications and technologies. pp 287\u2013292","DOI":"10.1109\/PDCAT.2009.50"},{"key":"1023_CR31","unstructured":"Oliveira RC , Guerraoui R, Schiper A (1997). Consensus in the crash-recovery model. Technical report, 97-239, Ecole Polytechnique F\u00e9d\u00e9rale, D\u00e9partement d\u2019Informatique, Lausanne, Switzeland, August"},{"key":"1023_CR32","unstructured":"Guerraoui R, Oliveira RC, Schiper A (1996) Stubborn communication channels. D\u00e9partement d\u2018Informatique, Lausanne, Switzeland, Technical report, Ecole Polytechnique F\u00e9d\u00e9rale"},{"issue":"2","key":"1023_CR33","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Fern\u00e1ndez A (2006) Implementing unreliable failure detectors with unknown membership. Inf Process Lett 100(2):60\u201363","journal-title":"Inf Process Lett"},{"issue":"12","key":"1023_CR34","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1016\/j.jss.2011.06.019","volume":"84","author":"M Larrea","year":"2011","unstructured":"Larrea M, Mart\u00edn C, Iratxe SA (2011) Communication-efficient leader election in crash-recovery systems. J Syst Softw 84(12):2186\u20132195","journal-title":"J Syst Softw"},{"issue":"3","key":"1023_CR35","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ipl.2009.10.011","volume":"110","author":"C Mart\u00edn","year":"2010","unstructured":"Mart\u00edn C, Larrea M (2010) A simple and communication-efficient omega algorithm in the crash-recovery model. Inf Process Lett 110(3):83\u201387","journal-title":"Inf Process Lett"},{"issue":"3","key":"1023_CR36","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jcss.2008.10.002","volume":"75","author":"C Mart\u00edn","year":"2009","unstructured":"Mart\u00edn C, Larrea M, Jim\u00e9nez E (2009) Implementing the omega failure detector in the crash-recovery failure model. J Comput Syst Sci 75(3):178\u2013189","journal-title":"J Comput Syst Sci"},{"key":"1023_CR37","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez-Campusano C, Corti\u00f1as R, Larrea M (2014) A performance study of consensus algorithms in omission and crash-recovery scenarios. In: 2014 22nd Euromicro international conference on parallel, distributed, and network-based processing. pp 240\u2013243","DOI":"10.1109\/PDP.2014.48"},{"key":"1023_CR38","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez-Campusano C, Larrea M, Corti\u00f1as R, Raynal M (2016) A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures. In: Proceedings of the 17th international conference on distributed computing and networking, Singapore. January 4\u20137, 2016, pp 8:1\u20138:4. ACM","DOI":"10.1145\/2833312.2833444"},{"key":"1023_CR39","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ipl.2016.10.007","volume":"118","author":"C Fern\u00e1ndez-Campusano","year":"2017","unstructured":"Fern\u00e1ndez-Campusano C, Larrea M, Corti\u00f1as R, Raynal M (2017) A distributed leader election algorithm in crash-recovery and omissive systems. Inf Process Lett 118:100\u2013104","journal-title":"Inf Process Lett"},{"issue":"4","key":"1023_CR40","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00446-008-0068-y","volume":"21","author":"MK Aguilera","year":"2008","unstructured":"Aguilera MK, Delporte-Gallet C, Fauconnier H, Toueg S (2008) On implementing omega in systems with weak reliability and synchrony assumptions. Distrib Comput 21(4):285\u2013314","journal-title":"Distrib Comput"},{"key":"1023_CR41","doi-asserted-by":"crossref","unstructured":"Angluin D (1980) Local and global properties in networks of processors (extended abstract). In: E.M. Raymond, G. Seymour, A.B. Walter, J.L. Richard\u00a0(Eds.), Proceedings of the 12th annual ACM symposium on theory of computing, April 28\u201330, 1980, Los Angeles, California, USA. pp 82\u201393. ACM","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"1023_CR42","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H Attiya","year":"1988","unstructured":"Attiya H, Snir M, Warmuth MK (1988) Computing on an anonymous ring. J ACM 35(4):845\u2013875","journal-title":"J ACM"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-01023-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-01023-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-01023-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:10:46Z","timestamp":1725898246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-01023-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,8]]},"references-count":42,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-01023-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2021,10,8]]},"assertion":[{"value":"13 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}