{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:32Z","timestamp":1740108332774,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education Singapore","doi-asserted-by":"crossref","award":["MOE2016-T2-1-019 \/ R146-000-234-112","MOE2016-T2-1-019 \/ R146-000-234-112"],"award-info":[{"award-number":["MOE2016-T2-1-019 \/ R146-000-234-112","MOE2016-T2-1-019 \/ R146-000-234-112"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education Singapore","doi-asserted-by":"crossref","award":["MOE2019-T2-2-121 \/ R146-000-304-112","MOE2019-T2-2-121 \/ R146-000-304-112"],"award-info":[{"award-number":["MOE2019-T2-2-121 \/ R146-000-304-112","MOE2019-T2-2-121 \/ R146-000-304-112"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"crossref","award":["C252-000-087-001"],"award-info":[{"award-number":["C252-000-087-001"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00236-022-00423-3","type":"journal-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T14:03:04Z","timestamp":1654696984000},"page":"451-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lamplighter groups and automata"],"prefix":"10.1007","volume":"59","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Birzhan","family":"Moldagaliyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9152-1706","authenticated-orcid":false,"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien Dat","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"key":"423_CR1","unstructured":"Amchislavska, M.: The geometry of generalized lamplighter groups. PhD Thesis, Cornell University (2014)"},{"key":"423_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2021.09.002","volume":"894","author":"N Aubrun","year":"2021","unstructured":"Aubrun, N., Kari, J.: On the domino problem of Baumslag\u2013Solitar groups. Theoret. Comput. Sci. 894, 12\u201322 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"423_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1090\/conm\/394\/07431","volume":"394","author":"L Bartholdi","year":"2006","unstructured":"Bartholdi, L., \u0160unik, Z.: Some solvable automaton groups. Contemp. Math. 394, 11\u201330 (2006)","journal-title":"Contemp. Math."},{"key":"423_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BF01211007","volume":"75","author":"G Baumslag","year":"1961","unstructured":"Baumslag, G.: Wreath products and finitely presented groups. Math. Z. 75, 22\u201328 (1961)","journal-title":"Math. Z."},{"issue":"3","key":"423_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0022-4049(98)00005-X","volume":"140","author":"G Baumslag","year":"1999","unstructured":"Baumslag, G., Shapiro, M., Short, H.: Parallel poly-pushdown groups. J. Pure Appl. Algebra 140(3), 209\u2013227 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"423_CR6","unstructured":"Berdinsky, D.: Representations of transitive graphs by automata. PhD Thesis, University of Auckland (2017)"},{"key":"423_CR7","doi-asserted-by":"crossref","unstructured":"Berdinsky, D., Elder, M., Taback, J.: Being Cayley automatic is closed under taking wreath product with virtually cyclic groups. Bull. Aust. Math. Soc. 104(3), 464\u2013474 (2021). https:\/\/www.cambridge.org\/core\/journals\/bulletin-of-the-australian-mathematical-society\/article\/abs\/being-cayley-automatic-is-closed-under-taking-wreath-product-with-virtually-cyclic-groups\/DC30F4447DA3DCE0EAADE125B92845D6","DOI":"10.1017\/S000497272100023X"},{"issue":"2","key":"423_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054116400049","volume":"27","author":"D Berdinsky","year":"2016","unstructured":"Berdinsky, D., Khoussainov, B.: Cayley automatic representations of wreath products. Int. J. Found. Comput. Sci. 27(2), 147\u2013159 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"423_CR9","doi-asserted-by":"crossref","unstructured":"Berdinsky, D., Kruengthomaya, P.: Nonstandard Cayley automatic representations for fundamental groups of torus bundles over the circle. In: Language and Automata Theory and Applications\u2014Fourteenth International Conference, LATA 2020, Milan, Italy, Proceedings. Springer LNCS 12038, pp. 115\u2013127 (2020)","DOI":"10.1007\/978-3-030-40608-0_7"},{"key":"423_CR10","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner (1979). http:\/\/www-igm.univ-mlv.fr\/~berstel\/LivreTransductions\/LivreTransductions.html","DOI":"10.1007\/978-3-663-09367-1"},{"key":"423_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.jalgebra.2017.09.038","volume":"496","author":"S B\u00e9rub\u00e9","year":"2018","unstructured":"B\u00e9rub\u00e9, S., Palnitkar, T., Taback, J.: Higher rank lamplighter groups are graph automatic. J. Algebra 496, 315\u2013343 (2018)","journal-title":"J. Algebra"},{"issue":"1","key":"423_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF02566435","volume":"71","author":"MR Bridson","year":"1996","unstructured":"Bridson, M.R., Gilman, R.H.: Formal language theory and the geometry of $$3$$-manifolds. Comentarii Mathematici Helvetici 71(1), 525\u2013555 (1996)","journal-title":"Comentarii Mathematici Helvetici"},{"key":"423_CR13","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.jalgebra.2014.06.001","volume":"415","author":"M Brittenham","year":"2014","unstructured":"Brittenham, M., Hermiller, S., Holt, D.: Algorithms and topology of Cayley graphs for groups. J. Algebra 415, 112\u2013136 (2014)","journal-title":"J. Algebra"},{"key":"423_CR14","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, Department of Computer Science, RWTH Aachen (1999)"},{"key":"423_CR15","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Fifteenth Annual IEEE Symposium on Logic in Computer Science, LICS 2000, pp. 51\u201362 (2000)","DOI":"10.1109\/LICS.2000.855755"},{"key":"423_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst. 37, 641\u2013674 (2004)","journal-title":"Theory Comput. Syst."},{"key":"423_CR17","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1142\/S0129054105003200","volume":"16","author":"B Borchert","year":"2005","unstructured":"Borchert, B., Lange, K.-J., Stephan, F., Tesson, P., Therien, D.: The dot-depth and the polynomial hierarchy correspond on the delta levels. Int. J. Found. Comput. Sci. 16, 625\u2013644 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"423_CR18","unstructured":"Cadilhac, M., Chistikov, D., Zetzsche, G.: Rational subsets of Baumslag\u2013Solitar groups. In: International Colloquium on Automata, Languages and Programming\u2014ICALP 2020, LIPIcs Proceedings 168, pp. 116:1\u2013116:16 (2020)"},{"issue":"3","key":"423_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(3:19)2013","volume":"9","author":"J Case","year":"2013","unstructured":"Case, J., Jain, S., Seah, S., Stephan, F.: Automatic functions, linear time and learning. Log. Methods Comput. Sci. 9(3), 1\u201326 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"423_CR20","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.jalgebra.2013.01.036","volume":"381","author":"M Elder","year":"2013","unstructured":"Elder, M., Elston, G., Ostheimer, G.: On groups that have normal forms computable in logspace. J. Algebra 381, 260\u2013281 (2013)","journal-title":"J. Algebra"},{"key":"423_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jalgebra.2014.04.021","volume":"413","author":"M Elder","year":"2014","unstructured":"Elder, M., Taback, J.: C-graph automatic groups. J. Algebra 413, 289\u2013319 (2014)","journal-title":"J. Algebra"},{"issue":"1","key":"423_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9(1), 47\u201368 (1965)","journal-title":"IBM J. Res. Dev."},{"key":"423_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"DBA Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"423_CR24","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Cambridge (1974)"},{"key":"423_CR25","first-page":"291","volume":"38","author":"B Farb","year":"1992","unstructured":"Farb, B.: Automatic groups: a guided tour. L\u2019 Enseignement Math\u00e9matique 38, 291\u2013313 (1992)","journal-title":"L\u2019 Enseignement Math\u00e9matique"},{"key":"423_CR26","unstructured":"Figelius, M., Ganardi, M., Lohrey, M., Zetzsche, G.: The complexity of Knapsack problems in wreath products. In: Fortyseventh International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbr\u00fccken, Germany, LIPIcs Proceedings 168, pp. 126:1\u2013126:18 (2020)"},{"key":"423_CR27","unstructured":"Ganardi, M., K\u00f6nig, D., Lohrey, M., Zetzsche, G.: Knapsack problems for wreath products. In: Thirtyfifth Symposium on Theoretical Aspects of Computer Science STACS 2018, Caen, France, LIPIcs Proceedings 96, pp. 32:1\u201332:13 (2018)"},{"key":"423_CR28","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: Automatic structures: twenty years later. In: Proceedings of the Thirty-Fifth Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2020, ACM, pp. 21\u201334 (2020)","DOI":"10.1145\/3373718.3394734"},{"issue":"1\u20133","key":"423_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1012061801279","volume":"87","author":"RI Grigorchuk","year":"2001","unstructured":"Grigorchuk, R.I., \u017buk, A.: The Lamplighter group as a group generated by a $$2$$-state automaton and its spectrum. Geom. Dedicata 87(1\u20133), 209\u2013244 (2001)","journal-title":"Geom. Dedicata"},{"key":"423_CR30","doi-asserted-by":"crossref","unstructured":"G\u00fcler, D., Krebs, A., Lange, K., Wolf, P.: Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy. In: Languages and Automata Theory and Applications\u2014Twelfth International Conference, LATA 2018, Ramat Gan, Israel, Proceedings. Springer LNCS 10792, pp. 156\u2013168 (2018)","DOI":"10.1007\/978-3-319-77313-1_12"},{"key":"423_CR31","unstructured":"Hodgson, B.R.: Th\u00e9ories d\u00e9cidables par automate fini. Ph.D. thesis, D\u00e9partement de math\u00e9matiques et de statistique, Universit\u00e9 de Montr\u00e9al (1976)"},{"issue":"1","key":"423_CR32","first-page":"39","volume":"7","author":"BR Hodgson","year":"1983","unstructured":"Hodgson, B.R.: D\u00e9cidabilit\u00e9 par automate fini. Annales des sciences math\u00e9matiques du Qu\u00e9bec 7(1), 39\u201357 (1983)","journal-title":"Annales des sciences math\u00e9matiques du Qu\u00e9bec"},{"issue":"2\u20133","key":"423_CR33","doi-asserted-by":"publisher","first-page":"273","DOI":"10.3233\/COM-180089","volume":"7","author":"S Jain","year":"2018","unstructured":"Jain, S., Khoussainov, B., Stephan, F.: Finitely generated semiautomatic groups. Computability 7(2\u20133), 273\u2013287 (2018)","journal-title":"Computability"},{"issue":"4","key":"423_CR34","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1007\/s00224-017-9792-7","volume":"61","author":"S Jain","year":"2017","unstructured":"Jain, S., Khoussainov, B., Stephan, F., Teng, D., Zou, S.: Semiautomatic structures. Theory Comput. Syst. 61(4), 1254\u20131287 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"423_CR35","doi-asserted-by":"publisher","first-page":"157","DOI":"10.4171\/GGD\/221","volume":"8","author":"O Kharlampovich","year":"2014","unstructured":"Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. Groups Geom. Dyn. 8(1), 157\u2013198 (2014)","journal-title":"Groups Geom. Dyn."},{"key":"423_CR36","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1090\/mcom\/3533","volume":"89","author":"O Kharlampovich","year":"2020","unstructured":"Kharlampovich, O., L\u00f3pez, L., Myasnikov, A.: The Diophantine problem in some metaabelian groups. Math. Comput. 89, 2507\u20132519 (2020)","journal-title":"Math. Comput."},{"key":"423_CR37","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Proceedings of Logic Colloquium 2007. Lecture Notes in Logic, vol. 35, pp. 132\u2013176 (2010)","DOI":"10.1017\/CBO9780511778421.008"},{"key":"423_CR38","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Logical and Computational Complexity, (International Workshop LCC 1994). Springer LNCS 960, pp. 367\u2013392 (1995)","DOI":"10.1007\/3-540-60178-3_93"},{"issue":"4","key":"423_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00224-006-1310-2","volume":"40","author":"A Krebs","year":"2007","unstructured":"Krebs, A., Lange, K.-J., Reifferscheid, S.: Characterizing TC$$^0$$ in terms of infinite groups. Theory Comput. Syst. 40(4), 303\u2013325 (2007)","journal-title":"Theory Comput. Syst."},{"key":"423_CR40","volume-title":"Kontextfrei Kontrollierte ET0L Systeme","author":"K-J Lange","year":"1982","unstructured":"Lange, K.-J.: Kontextfrei Kontrollierte ET0L Systeme. University of Hamburg, Germany (1982)"},{"issue":"3","key":"423_CR41","first-page":"327","volume":"25","author":"K-J Lange","year":"1996","unstructured":"Lange, K.-J.: Complexity and structure in formal language theory. Fund. Inform. 25(3), 327\u2013352 (1996)","journal-title":"Fund. Inform."},{"key":"423_CR42","doi-asserted-by":"crossref","unstructured":"Lange, K., McKenzie, P.: On the complexity of free monoid morphisms. In: Algorithms and Computation, Ninth International Symposium, ISAAC 1998, Taejon, Korea, Proceedings. Springer LNCS 1533, pp. 247\u2013256 (1998)","DOI":"10.1007\/3-540-49381-6_27"},{"issue":"2","key":"423_CR43","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"K-J Lange","year":"2000","unstructured":"Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354\u2013367 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"423_CR44","doi-asserted-by":"crossref","unstructured":"Lange, K.-J., Rossmanith, P.: The emptiness problem for intersections of regular languages. In: Seventeenth International Symposium on Mathematical Foundations of Computer Science\u2014MFCS 1992, Prague, Czechoslovakia, Proceedings. Springer LNCS 629, pp. 346\u2013354 (1992)","DOI":"10.1007\/3-540-55808-X_33"},{"key":"423_CR45","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ic.2014.12.014","volume":"243","author":"M Lohrey","year":"2015","unstructured":"Lohrey, M., Steinberg, B., Zetzsche, G.: Rational subsets and submonoids of wreath products. Inf. Comput. 243, 191\u2013204 (2015)","journal-title":"Inf. Comput."},{"issue":"5","key":"423_CR46","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method to synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"key":"423_CR47","unstructured":"Moldagaliyev, B.: A study of randomness and groups using finite automata. PhD Thesis, National University of Singapore (2018)"},{"key":"423_CR48","volume-title":"Automata Stud.","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken experiments on sequential machines. In: Shannon, C.E., McCarthy, J. (eds.) Automata Stud. Princeton University Press, Princeton, New Jersey (1956)"},{"issue":"3","key":"423_CR49","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2178\/bsl\/1186666149","volume":"13","author":"A Nies","year":"2007","unstructured":"Nies, A.: Describing groups. Bull. Symb. Log. 13(3), 305\u2013339 (2007)","journal-title":"Bull. Symb. Log."},{"key":"423_CR50","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","volume":"320","author":"A Nies","year":"2008","unstructured":"Nies, A., Thomas, R.: FA-presentable groups and rings. J. Algebra 320, 569\u2013585 (2008)","journal-title":"J. Algebra"},{"key":"423_CR51","doi-asserted-by":"crossref","unstructured":"Oliver, G.P., Thomas, R.M.: Finitely generated groups with automatic presentations. In: STACS 2005. Lecture Notes in Computer Science, 3404, Springer, Berlin, pp. 693-704 (2005)","DOI":"10.1007\/978-3-540-31856-9_57"},{"key":"423_CR52","unstructured":"P\u00e9lecq, L.: Isomorphismes et automorphismes des graphes context-free, \u00e9quationnels et automatiques. Doctoral Dissertation, University of Bordeaux, France (1997)"},{"key":"423_CR53","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2178\/bsl\/1208442827","volume":"14","author":"S Rubin","year":"2008","unstructured":"Rubin, S.: Automata presenting structures: a survey of the finite string case. Bull. Symb. Log. 14, 169\u2013209 (2008)","journal-title":"Bull. Symb. Log."},{"key":"423_CR54","unstructured":"S\u00e9nizergues, G.: Definability in weak monadic second-order logic of some infinite graphs. In: Dagstuhl seminar on Automata theory: Infinite computations. Warden, Germany, vol. 28, p. 16 (1992)"},{"key":"423_CR55","doi-asserted-by":"crossref","unstructured":"Stephan, F.: Automatic structures\u2014recent results and open questions. Keynote Talk. In: Third International Conference on Science and Engineering in Mathematics, Chemistry and Physics, ScieTech 2015, pp. 121\u2013130 in proceedings booklet). Journal of Physics: Conference Series, 622\/1 (Paper 012013) (2015). http:\/\/iopscience.iop.org\/1742-6596\/622\/1","DOI":"10.1088\/1742-6596\/622\/1\/012013"},{"key":"423_CR56","unstructured":"Tran, T.D.: Automata Theory and Groups. Final Year Project Report, National University of Singapore (2018)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00423-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-022-00423-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00423-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T17:15:44Z","timestamp":1727370944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-022-00423-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,8]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["423"],"URL":"https:\/\/doi.org\/10.1007\/s00236-022-00423-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2022,6,8]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}