{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:55:43Z","timestamp":1777100143150,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"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":["466789228."],"award-info":[{"award-number":["466789228."]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Word equations are equations <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\alpha \\doteq \\beta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03b1<\/mml:mi>\n                    <mml:mo>\u2250<\/mml:mo>\n                    <mml:mi>\u03b2<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> where <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\alpha $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b1<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\beta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b2<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are words consisting of letters from some alphabet <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Sigma $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03a3<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and variables from a set <jats:italic>X<\/jats:italic>. Recently, there has been substantial interest in the context of string solving in logics combining word equations with other kinds of constraints on words such as (regular) language membership (regular constraints) and arithmetic over string lengths (length constraints). We consider the expressive power of such logics by looking at the set of all values a single variable might take as part of a satisfying assignment for a given formula. Hence, each formula-variable pair defines a formal language, and each logic defines a class of formal languages. We consider logics arising from combining word equations with either length constraints, regular constraints, or both. We also consider word equations with visibly pushdown language membership constraints as a generalisation of the combination of regular and length constraints. We show that word equations with visibly pushdown membership constraints are sufficient to express all recursively enumerable languages and hence satisfiability is undecidable in this case. We then establish a strict hierarchy involving the other combinations. We also provide a complete characterisation of when a thin regular language is expressible by word equations (alone) and some further partial results for regular languages in the general case.<\/jats:p>","DOI":"10.1007\/s00224-023-10154-8","type":"journal-article","created":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T14:02:07Z","timestamp":1702303327000},"page":"322-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Closer Look at the Expressive Power of Logics Based on Word Equations"],"prefix":"10.1007","volume":"68","author":[{"given":"Joel","family":"Day","sequence":"first","affiliation":[]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Grewal","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Konefal","sequence":"additional","affiliation":[]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,11]]},"reference":[{"key":"10154_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y.F., Diep, B.P., Dolby, J., Janku, P., Lin, H.H., Hol\u00edk, L., Wu, W.-C., : Efficient handling of string-number conversion. In: Donaldson A.F., Torlak, E. (eds.) Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2020, London, UK, June 15-20, 2020. pp. 943\u2013957. ACM, (2020)","DOI":"10.1145\/3385412.3386034"},{"key":"10154_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y.-F., Hol\u00edk, L., Rezine, A., R\u00fcmmer, P., Stenman, J. : Norn: An SMT solver for string constraints. In: Kroening, D., Pasareanu, C.S. (eds.) Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, volume 9206 of Lecture Notes in Computer Science. pp. 462\u2013469. Springer, (2015)","DOI":"10.1007\/978-3-319-21690-4_29"},{"key":"10154_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M. : Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science. pp. 1102\u20131114. Springer, (2005)","DOI":"10.1007\/11523468_89"},{"key":"10154_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P. : Visibly pushdown languages. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pp. 202\u2013211. ACM, (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"10154_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P. : Adding nesting structure to words. J. ACM, 56(3):16:1\u201316:43, 2009","DOI":"10.1145\/1516512.1516518"},{"key":"10154_CR6","doi-asserted-by":"crossref","unstructured":"R. Amadini: A survey on string constraint solving. ACM Comput. Surv., 55(1), 2021","DOI":"10.1145\/3484198"},{"key":"10154_CR7","doi-asserted-by":"crossref","unstructured":"P. Barcel\u00f3, P. Mu\u00f1oz : Graph logics with rational relations: The role of word combinatorics. ACM Trans. Comput. Log., 18(2):10:1\u201310:41, 2017","DOI":"10.1145\/3070822"},{"key":"10154_CR8","doi-asserted-by":"crossref","unstructured":"Barrett, C.W. , Conway, C.L., Deters, M., Hadarean, L., Jovanovic, D., King, T., Reynolds, A., Tinelli, C. : CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings, volume 6806 of Lecture Notes in Computer Science. p. 171\u2013177. Springer, (2011)","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"10154_CR9","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C. : Codes and automata, volume 129. Cambridge University Press, (2010)","DOI":"10.1017\/CBO9781139195768"},{"key":"10154_CR10","doi-asserted-by":"crossref","unstructured":"Berzish, M., Kulczynski, M., Mora, F., Manea, F., Day, J.D., Nowotka, D., Ganesh, V. : An SMT solver for regular expressions and linear arithmetic over string length. In: Silva, A., Rustan, K., Leino, M. (eds) Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II, volume 12760 of Lecture Notes in Computer Science. pp. 289\u2013312. Springer, (2021)","DOI":"10.1007\/978-3-030-81688-9_14"},{"issue":"4","key":"10154_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/malq.19880340410","volume":"34","author":"JR B\u00fcchi","year":"1988","unstructured":"B\u00fcchi, J.R., Senger, S.: Definability in the existential theory of concatenation and undecidable extensions of this theory. Math. Log. Q. 34(4), 337\u2013342 (1988)","journal-title":"Math. Log. Q."},{"key":"10154_CR12","doi-asserted-by":"crossref","unstructured":"Chen, T., Chen, Y., Hague, M., Lin, A.W., Wu, Z. : What is decidable about string constraints with the replaceall function. Proc. ACM Program. Lang., 2(POPL):3:1\u20133:29, (2018)","DOI":"10.1145\/3158091"},{"key":"10154_CR13","doi-asserted-by":"crossref","unstructured":"Chen, T., Flores-Lamas, A., Hague, M., Han, Z., Hu, D., Kan, S., Lin, A.W., R\u00fcmmer, P., Wu, Z. : Solving string constraints with regex-dependent functions through transducers with priorities and variables. Proc. ACM Program. Lang., 6(POPL):1\u201331, (2022)","DOI":"10.1145\/3498707"},{"key":"10154_CR14","doi-asserted-by":"crossref","unstructured":"Chen, T. , Hague, M., Lin, A.W., R\u00fcmmer, P., Wu, Z. : Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang., 3(POPL):49:1\u201349:30, (2019)","DOI":"10.1145\/3290362"},{"key":"10154_CR15","doi-asserted-by":"crossref","unstructured":"Day, J.D. , Ganesh, V., Grewal, N., Manea, F. : On the expressive power of string constraints. In: Proc. ACM Program. Lang. ACM, (2023)","DOI":"10.1145\/3571203"},{"key":"10154_CR16","doi-asserted-by":"crossref","unstructured":"Day, J.D., Ganesh, V., He, P., Manea, F., Nowotka, D. : The satisfiability of word equations: Decidable and undecidable theories. In: Potapov, I., Reynier, P.-A. (eds) Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, volume 11123 of Lecture Notes in Computer Science. pp. 15\u201329. Springer, (2018)","DOI":"10.1007\/978-3-030-00250-3_2"},{"issue":"2","key":"10154_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ic.2005.04.002","volume":"202","author":"V Diekert","year":"2005","unstructured":"Diekert, V., Guti\u00e9rrez, C., Hagenah, C.: The existential theory of equations with rational constraints in free groups is pspace-complete. Inf. Comput. 202(2), 105\u2013140 (2005)","journal-title":"Inf. Comput."},{"key":"10154_CR18","first-page":"717","volume":"16","author":"VG Durnev","year":"1974","unstructured":"Durnev, V.G.: On equations in free semigroups and groups. Matematicheskie Zametki 16, 717\u2013724 (1974). (In Russian; English translation: Math. Notes of the Acad. of Sci. of the USSR 16 (1975) 1024\u20131028)","journal-title":"Matematicheskie Zametki"},{"issue":"5","key":"10154_CR19","first-page":"1067","volume":"36","author":"VG Durnev","year":"1995","unstructured":"Durnev, V.G.: Undecidability of the positive $$\\forall \\exists ^{3}$$-theory of a free semi-group. Sibirsky Matematicheskie Jurnal 36(5), 1067\u20131080 (1995). (In Russian; English translation: Sib. Math. J., 36(5), 917\u2013929, 1995)","journal-title":"Sibirsky Matematicheskie Jurnal"},{"key":"10154_CR20","doi-asserted-by":"crossref","unstructured":"Durnev, V.G. : Studying algorithmic problems for free semi-groups and groups. In: Adian, S., Nerode, A. (eds) Proceedings of the 4th International Symposium on Logical Foundations of Computer Science (LFCS\u201997), Yaroslavl, Russia, July 6\u201312, 1997, volume 1234. pp. 88\u2013101, (1997)","DOI":"10.1007\/3-540-63045-7_10"},{"key":"10154_CR21","unstructured":"Figueira, D., Je\u017c, A., Lin, A.W. : Data path queries over embedded graph databases. In: Libkin, L., Barcel\u00f3, P. (eds) PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022. pp. 189\u2013201. ACM, (2022)"},{"issue":"7","key":"10154_CR22","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1007\/s00224-018-9874-1","volume":"63","author":"DD Freydenberger","year":"2019","unstructured":"Freydenberger, D.D.: A logic for document spanners. Theory Comput. Syst. 63(7), 1679\u20131754 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10154_CR23","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/s00224-017-9770-0","volume":"62","author":"DD Freydenberger","year":"2018","unstructured":"Freydenberger, D.D., Holldack, M.: Document spanners: From expressive power to decision problems. Theory Comput. Syst. 62(4), 854\u2013898 (2018)","journal-title":"Theory Comput. Syst."},{"key":"10154_CR24","unstructured":"Freydenberger, D.D., Peterfreund, L. : The theory of concatenation over finite models. In: Bansal, N., Merelli, E., Worrell, J. (eds) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs. pp. 130:1\u2013130:17. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, (2021)"},{"key":"10154_CR25","unstructured":"Ganesh, V., Minnes, M., Solar-Lezama, A., Rinard, M.C. : Word equations with length constraints: What\u2019s decidable? In: Biere, A., Nahir, A., Vos, T.E.J. (eds) Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Haifa, Israel, November 6-8, 2012. Revised Selected Papers, volume 7857 of Lecture Notes in Computer Science. pp. 209\u2013226. Springer, (2012)"},{"issue":"4","key":"10154_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/3373394.3373396","volume":"6","author":"M Hague","year":"2019","unstructured":"Hague, M.: Strings at MOSCA. ACM SIGLOG News 6(4), 4\u201322 (2019)","journal-title":"Strings at MOSCA. ACM SIGLOG News"},{"key":"10154_CR27","doi-asserted-by":"crossref","unstructured":"Halfon, S., Schnoebelen, P., Zetzsche, G. : Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017. pp. 1\u201312. IEEE Computer Society, (2017)","DOI":"10.1109\/LICS.2017.8005141"},{"issue":"POPL","key":"10154_CR28","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3158092","volume":"2","author":"L Hol\u00edk","year":"2018","unstructured":"Hol\u00edk, L., Janku, P., Lin, A.W., R\u00fcmmer, P., Vojnar, T.: String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. 2(POPL), 4:1-4:32 (2018)","journal-title":"Proc. ACM Program. Lang."},{"key":"10154_CR29","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Addison-Wesley, Languages and Computation (1979)"},{"key":"10154_CR30","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2021.08.001","volume":"123","author":"A Je\u017c","year":"2022","unstructured":"Je\u017c, A.: Word equations in non-deterministic linear space. J. Comput. Syst. Sci. 123, 122\u2013142 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"10154_CR31","doi-asserted-by":"crossref","unstructured":"Kan, S., Lin, A.W., R\u00fcmmer, P., Schrader, M.: Certistr: a certified string solver. In: Popescu, A.,Zdancewic, S. (eds) CPP \u201922: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17 - 18, 2022. pp. 210\u2013224. ACM, (2022)","DOI":"10.1145\/3497775.3503691"},{"issue":"3","key":"10154_CR32","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/337244.337255","volume":"47","author":"J Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47(3), 483\u2013505 (2000)","journal-title":"J. ACM"},{"key":"10154_CR33","doi-asserted-by":"crossref","unstructured":"Kiezun, A., Ganesh, V., Guo, P.J., Hooimeijer, P., Ernst, M.D. : HAMPI: a solver for string constraints. In: Rothermel, G., Dillon, L.K. (eds) Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009. pp. 105\u2013116. ACM, (2009)","DOI":"10.1145\/1572272.1572286"},{"key":"10154_CR34","doi-asserted-by":"crossref","unstructured":"Le, Q.L., He, M. : A decision procedure for string logic with quadratic equations, regular expressions and length constraints. In: Ryu, S. (ed) Programming Languages and Systems-16th Asian Symposium, APLAS 2018, Wellington, New Zealand, December 2-6, 2018, Proceedings, volume 11275 of Lecture Notes in Computer Science. pp. 350\u2013372. Springer, (2018)","DOI":"10.1007\/978-3-030-02768-1_19"},{"key":"10154_CR35","doi-asserted-by":"crossref","unstructured":"Liang, T., Tsiskaridze, N., Reynolds, A., Tinelli, C., Barrett, C.W. : A decision procedure for regular membership and length constraints over unbounded strings. In: Lutz, C., Ranise, S. (eds) Frontiers of Combining Systems-10th International Symposium, FroCoS 2015, Wroclaw, Poland, September 21-24, 2015. Proceedings, volume 9322 of Lecture Notes in Computer Science. pp. 135\u2013150. Springer, (2015)","DOI":"10.1007\/978-3-319-24246-0_9"},{"key":"10154_CR36","doi-asserted-by":"crossref","unstructured":"Lin A.W., Majumdar, R. : Quadratic word equations with length constraints, counter systems, and presburger arithmetic with divisibility. In: Lahiri, S.K., Wang, C. (eds) Automated Technology for Verification and Analysis-16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings, volume 11138 of Lecture Notes in Computer Science. pp. 352\u2013369. Springer, (2018)","DOI":"10.1007\/978-3-030-01090-4_21"},{"key":"10154_CR37","doi-asserted-by":"crossref","unstructured":"Lin, A.W., Barcel\u00f3, P. : String solving with word equations and transducers: towards a logic for analysing mutation XSS. In: Bod\u00edk, R., Majumdar, R. (eds) Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20-22, 2016. pp. 123\u2013136. ACM, (2016)","DOI":"10.1145\/2837614.2837641"},{"key":"10154_CR38","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on words, 2nd edn. Cambridge University Press, Cambridge Mathematical Library (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"10154_CR39","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"issue":"2","key":"10154_CR40","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"GS Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Mathematics of the USSR-Sbornik 32(2), 129 (1977)","journal-title":"Mathematics of the USSR-Sbornik"},{"key":"10154_CR41","doi-asserted-by":"crossref","unstructured":"Mora, F., Berzish, M., Kulczynski, M., Nowotka, D., Ganesh, V. : Z3str4: A multi-armed string solver. In: Huisman, M., Pasareanu, C.S., Zhan, N. (eds.) Formal Methods-24th International Symposium, FM 2021, Virtual Event, November 20-26, 2021, Proceedings, volume 13047 of Lecture Notes in Computer Science. pp. 389\u2013406. Springer, (2021)","DOI":"10.1007\/978-3-030-90870-6_21"},{"key":"10154_CR42","unstructured":"Plandowski, W. : Satisfiability of word equations with constants is in PSPACE. In: 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, 17-18 October, 1999, New York, NY, USA. pp. 495\u2013500. IEEE Computer Society, (1999)"},{"issue":"4","key":"10154_CR43","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2307\/2268308","volume":"11","author":"WV Quine","year":"1946","unstructured":"Quine, W.V.: Concatenation as a basis for arithmetic. The Journal of Symbolic Logic 11(4), 105\u2013114 (1946)","journal-title":"The Journal of Symbolic Logic"},{"key":"10154_CR44","unstructured":"Schulz, K.U. : Makanin\u2019s algorithm for word equations - two improvements and a generalization. In: Schulz, K.U. (ed.) Word Equations and Related Topics, First International Workshop, IWWERT \u201990, T\u00fcbingen, Germany, October 1-3, 1990, Proceedings, volume 572 of Lecture Notes in Computer Science. pp. 85\u2013150. Springer, (1990)"},{"key":"10154_CR45","doi-asserted-by":"crossref","unstructured":"Shur, A.M. : Combinatorial complexity of regular languages. International Computer Science Symposium in Russia. pp. 289\u2013301. Springer (2008)","DOI":"10.1007\/978-3-540-79709-8_30"},{"key":"10154_CR46","doi-asserted-by":"crossref","unstructured":"Trinh, M.-T., Chu, D.-H., Jaffar, J. : Progressive reasoning over recursively-defined strings. In: Chaudhuri, S., Farzan, A. (eds) Computer Aided Verification-28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I, volume 9779 of Lecture Notes in Computer Science. pp. 218\u2013240. Springer, (2016)","DOI":"10.1007\/978-3-319-41528-4_12"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10154-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10154-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10154-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T02:02:57Z","timestamp":1718935377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10154-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,11]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["10154"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10154-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,11]]},"assertion":[{"value":"13 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}