{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:39:08Z","timestamp":1768268348671,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["389792660"],"award-info":[{"award-number":["389792660"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Germany\u2019s Excellence Strategy","award":["ID 390696704"],"award-info":[{"award-number":["ID 390696704"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK 1763"],"award-info":[{"award-number":["GRK 1763"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>By combining two of the central paradigms of causality, namely <jats:italic>counterfactual reasoning<\/jats:italic> and <jats:italic>probability-raising<\/jats:italic>, we introduce a probabilistic notion of cause in Markov chains. Such a cause consists of finite executions of the probabilistic system <jats:italic>after which<\/jats:italic> the probability of an <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\omega $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c9<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-regular effect exceeds a given threshold. The cause, as a set of executions, then has to cover <jats:italic>all<\/jats:italic> behaviors exhibiting the effect. With these properties, such causes can be used for monitoring purposes where the aim is to detect faulty behavior <jats:italic>before<\/jats:italic> it actually occurs. In order to choose which cause should be computed, we introduce multiple types of costs to capture the consumption of resources by the system or monitor from different perspectives, and study the complexity of computing cost-minimal causes.<\/jats:p>","DOI":"10.1007\/s11334-022-00452-8","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T04:03:07Z","timestamp":1650859387000},"page":"347-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic causes in Markov chains"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8490-1433","authenticated-orcid":false,"given":"Robin","family":"Ziemek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Piribauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Jantsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"452_CR1","doi-asserted-by":"publisher","unstructured":"Baier C, Dubslaff C, Funke F, Jantsch S, Majumdar R, Piribauer J, Ziemek R (2021) From verification to causality-based explications. In: 48th International colloquium on automata, languages, and programming (ICALP 2021). Leibniz international proceedings in informatics (LIPIcs), vol\u00a0198. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, pp 1:1\u20131:20. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.1","DOI":"10.4230\/LIPIcs.ICALP.2021.1"},{"key":"452_CR2","doi-asserted-by":"crossref","unstructured":"Baier C, Funke F, Jantsch S, Piribauer J, Ziemek R (2021) Probabilistic causes in Markov chains. In: Hou Z, Ganesh V (eds) 19th international symposium on automated technology for verification and analysis (ATVA). Programming and software engineering, vol 12971. Springer, Berlin, pp 205\u2013221","DOI":"10.1007\/978-3-030-88885-5_14"},{"key":"452_CR3","doi-asserted-by":"crossref","unstructured":"Baier C, Funke F, Piribauer J, Ziemek R (2022) On probability-raising causality in markov decision processes, extended version of an accepted publication at FoSSaCS 2022","DOI":"10.1007\/978-3-030-99253-8_3"},{"key":"452_CR4","volume-title":"Principles of model checking (representation and mind series)","author":"C Baier","year":"2008","unstructured":"Baier C, Katoen JP (2008) Principles of model checking (representation and mind series). The MIT Press, Cambridge"},{"key":"452_CR5","doi-asserted-by":"publisher","unstructured":"Bartocci E, Grosu R, Karmarkar A, Smolka SA, Stoller SD, Zadok E, Seyster J (2013) Adaptive runtime verification. In: Runtime verification. Springer, Berlin, pp 168\u2013182. https:\/\/doi.org\/10.1007\/978-3-642-35632-2_18","DOI":"10.1007\/978-3-642-35632-2_18"},{"key":"452_CR6","doi-asserted-by":"publisher","unstructured":"Beer I, Ben-David S, Chockler H, Orni A, Trefler R (2009) Explaining counterexamples using causality. In: Computer aided verification (CAV\u201909). Springer, Berlin, pp 94\u2013108. https:\/\/doi.org\/10.1007\/978-3-642-02658-4_11","DOI":"10.1007\/978-3-642-02658-4_11"},{"issue":"3","key":"452_CR7","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas DP, Tsitsiklis JN (1991) An analysis of stochastic shortest path problems. Math Oper Res 16(3):580\u2013595","journal-title":"Math Oper Res"},{"issue":"483","key":"452_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1093\/mind\/fzs081","volume":"121","author":"M Braham","year":"2012","unstructured":"Braham M, van Hees M (2012) An anatomy of moral responsibility. Mind 121(483):601\u2013634","journal-title":"Mind"},{"key":"452_CR9","doi-asserted-by":"publisher","unstructured":"Brihaye T, Geeraerts G, Haddad A, Monmege B (2015) To reach or not to reach? Efficient algorithms for total-payoff games. In: Proceedings of the 26th international conference on concurrency theory (CONCUR\u201915). LIPIcs, vol\u00a042, pp 297\u2013310. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.297","DOI":"10.4230\/LIPIcs.CONCUR.2015.297"},{"key":"452_CR10","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552287","author":"R Chadha","year":"2009","unstructured":"Chadha R, Sistla AP, Viswanathan M (2009) On the expressiveness and complexity of randomization in finite state monitors. J ACM. https:\/\/doi.org\/10.1145\/1552285.1552287","journal-title":"J ACM"},{"issue":"5","key":"452_CR11","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1016\/j.jcss.2016.02.009","volume":"82","author":"K Chatterjee","year":"2016","unstructured":"Chatterjee K, Chmel\u00edk M, Tracol M (2016) What is decidable about partially observable Markov decision processes with omega-regular objectives. J Comput Syst Sci 82(5):878\u2013911. https:\/\/doi.org\/10.1016\/j.jcss.2016.02.009","journal-title":"J Comput Syst Sci"},{"key":"452_CR12","doi-asserted-by":"publisher","unstructured":"Chatterjee K, Doyen L, Henzinger TA (2017) The cost of exactness in quantitative reachability. In: Models, algorithms, logics and tools, pp 367\u2013381. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-63121-9_18","DOI":"10.1007\/978-3-319-63121-9_18"},{"issue":"1","key":"452_CR13","first-page":"93","volume":"22","author":"H Chockler","year":"2004","unstructured":"Chockler H, Halpern JY (2004) Responsibility and blame: a structural-model approach. J Artif Int Res 22(1):93\u2013115","journal-title":"J Artif Int Res"},{"issue":"3","key":"452_CR14","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/1352582.1352588","volume":"9","author":"H Chockler","year":"2008","unstructured":"Chockler H, Halpern JY, Kupferman O (2008) What causes a system to satisfy a specification? ACM Trans Comput Logic 9(3):20:1-20:26","journal-title":"ACM Trans Comput Logic"},{"key":"452_CR15","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-662-46681-0_54","volume-title":"Tools and algorithms for the construction and analysis of systems","author":"C Cini","year":"2015","unstructured":"Cini C, Francalanza A (2015) An LTL proof system for runtime verification. In: Baier C, Tinelli C (eds) Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 581\u2013595"},{"key":"452_CR16","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"key":"452_CR17","doi-asserted-by":"publisher","unstructured":"Daca P, Henzinger TA, K\u0159et\u00ednsk\u00fd J, Petrov T (2016) Faster statistical model checking for unbounded temporal properties. In: Tools and algorithms for the construction and analysis of systems. Springer, Heidelberg, pp 112\u2013129. https:\/\/doi.org\/10.1007\/978-3-662-49674-9_7","DOI":"10.1007\/978-3-662-49674-9_7"},{"key":"452_CR18","unstructured":"Dash D, Voortman M, De Jongh M (2013) Sequences of mechanisms for causal reasoning in artificial intelligence. In: Proceedings of the 23rd international joint conference on artificial intelligence. IJCAI \u201913. AAAI Press, pp 839\u2013845"},{"key":"452_CR19","volume-title":"Probabilistic causality. Cambridge studies in probability, induction and decision theory","author":"E Eells","year":"1991","unstructured":"Eells E (1991) Probabilistic causality. Cambridge studies in probability, induction and decision theory. Cambridge University Press, Cambridge"},{"issue":"1\u20132","key":"452_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.artint.2003.06.002","volume":"154","author":"T Eiter","year":"2004","unstructured":"Eiter T, Lukasiewicz T (2004) Complexity results for explanations in the structural-model approach. Artif Intell 154(1\u20132):145\u2013198","journal-title":"Artif Intell"},{"issue":"6\u20137","key":"452_CR21","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.artint.2005.12.003","volume":"170","author":"T Eiter","year":"2006","unstructured":"Eiter T, Lukasiewicz T (2006) Causes and explanations in the structural-model approach: tractable cases. Artif Intell 170(6\u20137):542\u2013580","journal-title":"Artif Intell"},{"key":"452_CR22","unstructured":"Esparza J, Kiefer S, Kretinsky J, Weininger M (2020) Online monitoring $$\\omega $$-regular properties in unknown Markov chains. arxiv:2010.08347"},{"issue":"8","key":"452_CR23","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00236-017-0307-4","volume":"55","author":"R Faran","year":"2018","unstructured":"Faran R, Kupferman O (2018) Spanning the spectrum from safety to liveness. Acta Informat 55(8):703\u2013732. https:\/\/doi.org\/10.1007\/s00236-017-0307-4","journal-title":"Acta Informat"},{"key":"452_CR24","doi-asserted-by":"publisher","unstructured":"Feigenbaum J, Hendler JA, Jaggard AD, Weitzner DJ, Wright RN (2011) Accountability and deterrence in online life. In: Proceedings of WebSci \u201911. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2527031.2527043","DOI":"10.1145\/2527031.2527043"},{"issue":"4","key":"452_CR25","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1093\/bjps\/axv056","volume":"68","author":"L Fenton-Glynn","year":"2016","unstructured":"Fenton-Glynn L (2016) A proposed probabilistic extension of the Halpern and Pearl definition of \u2018actual cause\u2019. Br J Philos Sci 68(4):1061\u20131124","journal-title":"Br J Philos Sci"},{"issue":"4","key":"452_CR26","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J Gill","year":"1977","unstructured":"Gill J (1977) Computational complexity of probabilistic Turing machines. SIAM J Comput 6(4):675\u2013695. https:\/\/doi.org\/10.1137\/0206049","journal-title":"SIAM J Comput"},{"key":"452_CR27","doi-asserted-by":"publisher","unstructured":"Gondi K, Patel Y, Sistla AP (2009) Monitoring the full range of $$\\omega $$-regular properties of stochastic systems. In: Proceedings of VMCAI\u201909. Springer, Berlin, pp 105\u2013119. https:\/\/doi.org\/10.1007\/978-3-540-93900-9_12","DOI":"10.1007\/978-3-540-93900-9_12"},{"key":"452_CR28","doi-asserted-by":"publisher","unstructured":"Haase C, Kiefer S (2015) The odds of staying on budget. In: Automata, languages, and programming. Springer, Berlin, pp 234\u2013246. https:\/\/doi.org\/10.1007\/978-3-662-47666-6_19","DOI":"10.1007\/978-3-662-47666-6_19"},{"issue":"2","key":"452_CR29","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ipl.2015.09.015","volume":"116","author":"C Haase","year":"2016","unstructured":"Haase C, Kiefer S (2016) The complexity of the Kth largest subset problem and related problems. Inf Process Lett 116(2):111\u2013115. https:\/\/doi.org\/10.1016\/j.ipl.2015.09.015","journal-title":"Inf Process Lett"},{"key":"452_CR30","doi-asserted-by":"crossref","unstructured":"Halpern JY (2015) A modification of the Halpern-Pearl definition of causality. In: Proceedings of IJCAI\u201915. AAAI Press, pp 3022\u20133033","DOI":"10.7551\/mitpress\/9780262035026.003.0002"},{"key":"452_CR31","unstructured":"Halpern JY, Pearl J (2001) Causes and explanations: a structural-model approach: part 1: causes. In: Proceedings of the 17th conference in uncertainty in artificial intelligence (UAI), pp 194\u2013202"},{"key":"452_CR32","unstructured":"Huang Y, Kleinberg S (2015) Fast and Accurate causal inference from time series data. In: Proceedings of FLAIRS 2015. AAAI Press, pp 49\u201354"},{"key":"452_CR33","doi-asserted-by":"publisher","unstructured":"Ibrahim A, Pretschner A (2020) From checking to inference: actual causality computations as optimization problems. In: Proceedings of ATVA\u201920. Springer, Cham, , pp 343\u2013359. https:\/\/doi.org\/10.1007\/978-3-030-59152-6_19","DOI":"10.1007\/978-3-030-59152-6_19"},{"key":"452_CR34","doi-asserted-by":"publisher","unstructured":"Ibrahim A, Pretschner A, Klesel T, Zibaei E, Kacianka S, Pretschner A (2020) Actual causality canvas: a general framework for explanation-based socio-technical constructs. In: Proceedings of ECAI\u201920. IOS Press Ebooks, pp 2978\u20132985. https:\/\/doi.org\/10.3233\/FAIA200472","DOI":"10.3233\/FAIA200472"},{"key":"452_CR35","doi-asserted-by":"publisher","unstructured":"Kalajdzic K, Bartocci E, Smolka SA, Stoller SD, Grosu R (2013) Runtime verification with particle filtering. In: Runtime verification. Springer, Berlin, pp 149\u2013166. https:\/\/doi.org\/10.1007\/978-3-642-40787-1_9","DOI":"10.1007\/978-3-642-40787-1_9"},{"issue":"47\u201349","key":"452_CR36","doi-asserted-by":"publisher","first-page":"5010","DOI":"10.1016\/j.tcs.2009.07.049","volume":"410","author":"JY Kao","year":"2009","unstructured":"Kao JY, Rampersad N, Shallit J (2009) On NFAs where all states are final, initial, or both. Theor Comput Sci 410(47\u201349):5010\u20135021","journal-title":"Theor Comput Sci"},{"key":"452_CR37","unstructured":"Kleinberg S (2011) A logic for causal inference in time series with discrete and continuous variables. In: Proceedings of IJCAI\u201911, pp 943\u2013950"},{"issue":"6","key":"452_CR38","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1016\/j.jbi.2011.07.001","volume":"44","author":"S Kleinberg","year":"2011","unstructured":"Kleinberg S, Hripcsak G (2011) A review of causal inference for biomedical informatics. J Biomed Inform 44(6):1102\u201312. https:\/\/doi.org\/10.1016\/j.jbi.2011.07.001","journal-title":"J Biomed Inform"},{"key":"452_CR39","unstructured":"Kleinberg S, Mishra B (2009) The temporal logic of causal structures. In: Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence (UAI), pp 303\u2013312"},{"key":"452_CR40","unstructured":"Kleinberg S, Mishra B (2010) The temporal logic of token causes. In: Proceedings of KR\u201910. AAAI Press, pp 575\u2013577"},{"key":"452_CR41","unstructured":"Madani O, Hanks S, Condon A (1999) On the undecidability of probabilistic planning and infinite-horizon partially observable markov decision problems. In: Proceedings of the sixteenth national conference on artificial intelligence and the eleventh innovative applications of artificial intelligence conference innovative applications of artificial intelligence. AAAI \u201999\/IAAI \u201999, American Association for Artificial Intelligence, USA, pp 541\u2013548"},{"key":"452_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.07.007","author":"T Miller","year":"2017","unstructured":"Miller T (2017) Explanation in artificial intelligence: insights from the social sciences. Artif Intell. https:\/\/doi.org\/10.1016\/j.artint.2018.07.007","journal-title":"Artif Intell"},{"key":"452_CR43","unstructured":"Pearl J (2009) Causality, 2nd edn. Cambridge University Press, Cambridge"},{"key":"452_CR44","doi-asserted-by":"crossref","unstructured":"Piribauer J, Baier C (2019) Partial and conditional expectations in Markov decision processes with integer weights. In: Proceedings of FoSSaCS\u201919. Lecture notes in computer science, vol 11425. Springer, pp 436\u2013452","DOI":"10.1007\/978-3-030-17127-8_25"},{"key":"452_CR45","doi-asserted-by":"publisher","DOI":"10.1063\/1.3059791","volume-title":"The direction of time","author":"H Reichenbach","year":"1956","unstructured":"Reichenbach H (1956) The direction of time. Dover Publications, Mineola"},{"key":"452_CR46","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-78163-9_25","volume-title":"Verification, model checking, and abstract interpretation","author":"AP Sistla","year":"2008","unstructured":"Sistla AP, Srinivas AR (2008) Monitoring temporal properties of stochastic systems. In: Logozzo F, Peled DA, Zuck LD (eds) Verification, model checking, and abstract interpretation. Springer, Berlin, pp 294\u2013308"},{"key":"452_CR47","doi-asserted-by":"publisher","unstructured":"Stoller SD, Bartocci E, Seyster J, Grosu R, Havelund K, Smolka SA, Zadok E (2012) Runtime verification with state estimation. In: Runtime verification. Springer, Berlin, pp 193\u2013207. https:\/\/doi.org\/10.1007\/978-3-642-29860-8_15","DOI":"10.1007\/978-3-642-29860-8_15"},{"key":"452_CR48","volume-title":"A probabilistic theory of causality","author":"P Suppes","year":"1970","unstructured":"Suppes P (1970) A probabilistic theory of causality. North-Holland Pub. Co., Amsterdam"},{"issue":"5","key":"452_CR49","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda S (1991) PP is as hard as the polynomial-time hierarchy. SIAM J Comput 20(5):865\u2013877. https:\/\/doi.org\/10.1137\/0220053","journal-title":"SIAM J Comput"},{"key":"452_CR50","doi-asserted-by":"crossref","unstructured":"Vennekens J, Bruynooghe M, Denecker M (2010) Embracing events in causal modelling: interventions and counterfactuals in CP-logic. In: Logics in artificial intelligence. Springer, Berlin, pp 313\u2013325","DOI":"10.1007\/978-3-642-15675-5_27"},{"issue":"3","key":"452_CR51","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S1471068409003767","volume":"9","author":"J Vennekens","year":"2009","unstructured":"Vennekens J, Denecker M, Bruynooghe M (2009) CP-logic: a language of causal probabilistic events and its relation to logic programming. Theory Pract Logic Program 9(3):245\u2013308. https:\/\/doi.org\/10.1017\/S1471068409003767","journal-title":"Theory Pract Logic Program"},{"key":"452_CR52","unstructured":"Zheng M, Kleinberg S (2017) A method for automating token causal explanation and discovery. In: Proceedings of FLAIRS\u201917"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-022-00452-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11334-022-00452-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-022-00452-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T06:45:46Z","timestamp":1662965146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11334-022-00452-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s11334-022-00452-8","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"23 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}