{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:08Z","timestamp":1740109388017,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:00Z","timestamp":1635379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:00Z","timestamp":1635379200000},"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":"crossref","award":["Graduiertenkolleg 1763 (QuantLA)"],"award-info":[{"award-number":["Graduiertenkolleg 1763 (QuantLA)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008678","name":"Universit\u00e4t Leipzig","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008678","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton.<\/jats:p>","DOI":"10.1007\/s00224-021-10049-6","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T02:02:26Z","timestamp":1635386546000},"page":"615-661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0814-598X","authenticated-orcid":false,"given":"Erik","family":"Paul","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"issue":"2-3","key":"10049_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M-P Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.-P.: On the definition of a family of automata. Inf. Control. 4(2-3), 245\u2013270 (1961)","journal-title":"Inf. Control."},{"key":"10049_CR2","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series, Texts and Monographs in Computer Science. Springer (1978)","DOI":"10.1007\/978-1-4612-6264-0"},{"key":"10049_CR3","doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages, vol. 5. EATCS Monographs in Theoretical Computer Science. Springer (1986)","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"10049_CR4","unstructured":"Berstel, J., Reutenauer, C.: Rational series and their languages, EATCS Monographs in Theoretical Computer Science, vol 12. Springer (1988)"},{"volume-title":"Handbook of weighted automata, EATCS Monographs in Theoretical Computer Science","year":"2009","key":"10049_CR5","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of weighted automata, EATCS Monographs in Theoretical Computer Science. Springer, Berlin (2009)"},{"key":"10049_CR6","doi-asserted-by":"crossref","unstructured":"Simon, I.: Limited subsets of a free monoid. In: 19th Annual Symposium on Foundations of Computer Science (FOCS), pp 143\u2013150. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.21"},{"key":"10049_CR7","doi-asserted-by":"crossref","unstructured":"Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Chytil, M.P., Janiga, L., Koubek, V. (eds.) 13th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 324, pp 107\u2013120. Springer (1988)","DOI":"10.1007\/BFb0017135"},{"issue":"3","key":"10049_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. Algebra Comput. 4(3), 405\u2013426 (1994)","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"10049_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0218196702000845","volume":"12","author":"K Hashiguchi","year":"2002","unstructured":"Hashiguchi, K., Ishiguro, K., Jimbo, S.: Decidability of the equivalence problem for finitely ambiguous finance automata. Int. J. Algebra Comput. 12(3), 445\u2013461 (2002)","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"10049_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2004.02.049","volume":"327","author":"I Klimann","year":"2004","unstructured":"Klimann, I., Lombardy, S., Mairesse, J., Prieur, C.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327(3), 349\u2013373 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10049_CR11","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, J., Drewes, F., Zechner, N.: An efficient best-trees algorithm for weighted tree automata over the tropical semiring. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) 9th International Conference on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science, vol. 8977, pp 97\u2013108. Springer (2015)","DOI":"10.1007\/978-3-319-15579-1_7"},{"key":"10049_CR12","unstructured":"Daviaud, L., Guillon, P., Merlet, G.: Comparison of max-plus automata and joint spectral radius of tropical matrices. In: Larsen, K.G., Bodlaender, H.L., Raskin, J.-F. (eds.) 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 83, pp 19:1\u201319:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"10049_CR13","doi-asserted-by":"crossref","unstructured":"Filiot, E., Jecker, I., Lhote, N., P\u00e9rez, G.A., Raskin, J.-F.: On delay and regret determinization of max-plus automata. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005096"},{"key":"10049_CR14","unstructured":"Mazowiecki, F., Riveros, C.: Pumping lemmas for weighted automata. In: Niedermeier, R., Vall\u00e9e, B. (eds.) 35th Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 96, pp 50:1\u201350:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"2","key":"10049_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0890-5401(88)90033-8","volume":"78","author":"K Hashiguchi","year":"1988","unstructured":"Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124\u2013169 (1988)","journal-title":"Inf. Comput."},{"issue":"4","key":"10049_CR16","first-page":"545","volume":"12","author":"J Waldmann","year":"2007","unstructured":"Waldmann, J.: Weighted automata for proving termination of string rewriting. J. Autom. Lang. Combin. 12(4), 545\u2013570 (2007)","journal-title":"J. Autom. Lang. Combin."},{"key":"10049_CR17","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.arcontrol.2018.04.004","volume":"45","author":"J Komenda","year":"2018","unstructured":"Komenda, J., Lahaye, S., Boimond, J.-L., van den Boom, T.: Max-plus algebra in the history of discrete event systems. Annu. Rev. Control. 45, 240\u2013249 (2018)","journal-title":"Annu. Rev. Control."},{"issue":"2","key":"10049_CR18","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"issue":"2","key":"10049_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res Dev 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res Dev"},{"key":"10049_CR20","unstructured":"Kirsten, D., Lombardy, S.: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 3, pp 589\u2013600. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"issue":"3","key":"10049_CR21","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1051\/ita:2008017","volume":"42","author":"D Kirsten","year":"2008","unstructured":"Kirsten, D.: A Burnside approach to the termination of Mohri\u2019s algorithm for polynomially ambiguous min-plus-automata. Inf. Th\u00e9or. Appl. 42(3), 553\u2013581 (2008)","journal-title":"Inf. Th\u00e9or. Appl."},{"issue":"3","key":"10049_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0019-9958(77)90050-X","volume":"35","author":"M Blattner","year":"1977","unstructured":"Blattner, M., Head, T.: Automata that recognize intersections of free submonoids. Inf. Control. 35(3), 173\u2013176 (1977)","journal-title":"Inf. Control."},{"issue":"2","key":"10049_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theor. Comput. Sci. 88(2), 325\u2013349 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10049_CR24","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BF00263578","volume":"26","author":"H Seidl","year":"1989","unstructured":"Seidl, H.: On the finite degree of ambiguity of finite tree automata. Acta Inf. 26(6), 527\u2013542 (1989)","journal-title":"Acta Inf."},{"key":"10049_CR25","doi-asserted-by":"crossref","unstructured":"Bala, S., Koni\u0144ski, A.: Unambiguous automata denoting finitely sequential functions. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B (eds.) 7th International Conference on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science, vol. 7810, pp 104\u2013115. Springer (2013)","DOI":"10.1007\/978-3-642-37064-9_11"},{"key":"10049_CR26","doi-asserted-by":"crossref","unstructured":"Bala, S.: Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract). In: Chatterjee, K., Sgall, J. (eds.) 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 8087, pp 86\u201397. Springer (2013)","DOI":"10.1007\/978-3-642-40313-2_10"},{"issue":"1","key":"10049_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(87)90190-6","volume":"24","author":"A Alexandrakis","year":"1987","unstructured":"Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene\u2019s theorem. Inf. Process. Lett. 24(1), 1\u20134 (1987)","journal-title":"Inf. Process. Lett."},{"key":"10049_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18, 115\u2013148 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10049_CR29","first-page":"219","volume":"8","author":"Z \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Combin. 8(2), 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"10049_CR30","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, pp 313\u2013403. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_9"},{"issue":"2","key":"10049_CR31","first-page":"357","volume":"19","author":"A Koprowski","year":"2009","unstructured":"Koprowski, A., Waldmann, J.: Max\/plus tree automata for termination of term rewriting. Acta Cybern. 19(2), 357\u2013392 (2009)","journal-title":"Acta Cybern."},{"key":"10049_CR32","doi-asserted-by":"crossref","unstructured":"Petrov, S.: Latent variable grammars for natural language parsing. In: Coarse-to-Fine Natural Language Processing, Theory and Applications of Natural Language Processing, pp 7\u201346. Springer (2012)","DOI":"10.1007\/978-3-642-22743-1_2"},{"key":"10049_CR33","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"series 2, 30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. series 2, 30, 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"10049_CR34","unstructured":"Paul, E.: Finite sequentiality of unambiguous max-plus tree automata. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 126, pp 55:1\u201355:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"4","key":"10049_CR35","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"12","key":"10049_CR36","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh\u2019s theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12), 614\u2013619 (2011)","journal-title":"Inf. Process. Lett."},{"key":"10049_CR37","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley (1988)","DOI":"10.1002\/9781118627372"},{"key":"10049_CR38","doi-asserted-by":"crossref","unstructured":"Bockmayr, A., Weispfenning, V., Maher, M.: Solving numerical constraints. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp 751\u2013842. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50014-X"},{"key":"10049_CR39","unstructured":"Paul, E.: Finite sequentiality of finitely ambiguous max-plus tree automata. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) Leibniz International Proceedings in Informatics (LIPIcs), vol. 168, pp 137:1\u2013137:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"10049_CR40","doi-asserted-by":"crossref","unstructured":"Paul, E.: On finite and polynomial ambiguity of weighted tree automata. In: Brlek, S., Reutenauer, C. (eds.) Lecture Notes in Computer Science, vol. 9840, pp 368\u2013379. Springer (2016)","DOI":"10.1007\/978-3-662-53132-7_30"},{"key":"10049_CR41","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Riveros, C.: Quantitative monadic second-order logic. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp 113\u2013122. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.16"},{"key":"10049_CR42","unstructured":"Paul, E.: The equivalence, unambiguity and sequentiality problems of finitely ambiguous max-plus tree automata are decidable. In: Larsen, K.G., Bodlaender, H.L., Raskin, J.-F. (eds.) Leibniz International Proceedings in Informatics (LIPIcs), vol. 83, pp 53:1\u201353:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"10049_CR43","unstructured":"Droste, M., Gastin, P.: Aperiodic weighted automata and weighted first-order logic. In: Rossmanith, P., Heggernes, P., Katoen, J.-P. (eds.) Leibniz International Proceedings in Informatics (LIPIcs), vol. 138, pp 76:1\u201376:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"2","key":"10049_CR44","doi-asserted-by":"publisher","first-page":"211","DOI":"10.14232\/actacyb.20.2.2011.1","volume":"20","author":"D Kirsten","year":"2011","unstructured":"Kirsten, D.: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybern. 20(2), 211\u2013221 (2011)","journal-title":"Acta Cybern."},{"issue":"4","key":"10049_CR45","first-page":"509","volume":"16","author":"B Borchardt","year":"2004","unstructured":"Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybern. 16(4), 509\u2013544 (2004)","journal-title":"Acta Cybern."},{"key":"10049_CR46","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of automata theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"2","key":"10049_CR47","first-page":"117","volume":"8","author":"C Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. J. Autom. Lang. Combin. 8(2), 117\u2013144 (2003)","journal-title":"J. Autom. Lang. Combin."},{"issue":"3\/4","key":"10049_CR48","first-page":"229","volume":"15","author":"M B\u00fcchse","year":"2010","unstructured":"B\u00fcchse, M., May, J., Vogler, H.: Determinization of weighted tree automata using factorizations. J. Autom. Lang. Combin. 15(3\/4), 229\u2013254 (2010)","journal-title":"J. Autom. Lang. Combin."},{"key":"10049_CR49","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata (2015)"},{"issue":"1","key":"10049_CR50","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2(1), 57\u201381 (1968)","journal-title":"Math. Syst. Theory"},{"issue":"5","key":"10049_CR51","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4(5), 406\u2013451 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"10049_CR52","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available on: https:\/\/www.grappa.univ-lille3.fr\/tata (2008)"},{"volume-title":"42nd international symposium on mathematical foundations of computer science (MFCS), Leibniz International Proceedings in Informatics (LIPIcs)","year":"2017","key":"10049_CR53","unstructured":"Larsen, K.G., Bodlaender, H.L., Raskin, J.-F. (eds.): 42nd international symposium on mathematical foundations of computer science (MFCS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 83. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Berlin (2017)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-021-10049-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-021-10049-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-021-10049-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:16:21Z","timestamp":1724447781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-021-10049-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,28]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10049"],"URL":"https:\/\/doi.org\/10.1007\/s00224-021-10049-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2021,10,28]]},"assertion":[{"value":"22 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}