{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:07:33Z","timestamp":1761595653158,"version":"build-2065373602"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptosystems. A finite chain ring is a finite ring admitting exactly one maximal ideal and every ideal being generated by one element. In 2004, Nechaev and Mikhailov proposed two methods for solving systems of polynomial equations over finite chain rings. These methods used solutions over the residue field to construct all solutions step by step. However, for some types of algebraic equations, one simply needs partial solutions. In this paper, we combine two existing approaches to show how Gr\u00f6bner bases over finite chain rings can be used to solve systems of algebraic equations over finite commutative rings. Then, we use skew polynomials and Pl\u00fccker coordinates to show that some algebraic approaches used to solve the rank decoding problem and the MinRank problem over finite fields can be extended to finite principal ideal rings.<\/jats:p>","DOI":"10.1007\/s00200-024-00652-8","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T23:35:31Z","timestamp":1713915331000},"page":"1083-1111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving systems of algebraic equations over finite commutative rings and applications"],"prefix":"10.1007","volume":"36","author":[{"given":"Hermann Tchatchiem","family":"Kamche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"652_CR1","unstructured":"Agrawal, M., Saxena, N.: Automorphisms of finite rings and applications to complexity of problems. In: STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24\u201326, 2005. Proceedings 22, pp. 1\u201317. Springer (2005)"},{"key":"652_CR2","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bertin, M.: Improvement of algebraic attacks for solving superdetermined minrank instances. In: Post-Quantum Cryptography: 13th International Workshop, PQCrypto 2022, Virtual Event, September 28\u201330, 2022, Proceedings, pp. 107\u2013123. Springer (2022)","DOI":"10.1007\/978-3-031-17234-2_6"},{"key":"652_CR3","doi-asserted-by":"crossref","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., Tillich, J.: An algebraic attack on rank metric code-based cryptosystems. In: A.\u00a0Canteaut, Y.\u00a0Ishai (eds.) Advances in Cryptology - EUROCRYPT, Lecture Notes in Computer Science, vol. 12107, pp. 64\u201393. Springer (2020)","DOI":"10.1007\/978-3-030-45727-3_3"},{"issue":"11","key":"652_CR4","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1007\/s10623-023-01265-x","volume":"91","author":"M Bardet","year":"2023","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Tillich, J.: Revisiting algebraic attacks on MinRank and on the rank decoding problem. Des. Codes Cryptogr. 91(11), 3671\u20133707 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"652_CR5","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R.A., Smith-Tone, D., Tillich, J., Verbel, J.A.: Improvements of algebraic attacks for solving the rank decoding and minrank problems. In: Advances in Cryptology - ASIACRYPT, Lecture Notes in Computer Science, vol. 12491, pp. 507\u2013536. Springer (2020)","DOI":"10.1007\/978-3-030-64837-4_17"},{"issue":"3","key":"652_CR6","first-page":"23","volume":"30","author":"S Barg","year":"1994","unstructured":"Barg, S.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23\u201328 (1994)","journal-title":"Problemy Peredachi Informatsii"},{"key":"652_CR7","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10587-014-0124-7","volume":"64","author":"M Behboodi","year":"2014","unstructured":"Behboodi, M., Beyranvand, R., Hashemi, A., Khabazian, H.: Classification of finite rings: theory and algorithm. Czechoslov. Math. J. 64, 641\u2013658 (2014)","journal-title":"Czechoslov. Math. J."},{"issue":"6","key":"652_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00200-013-0200-5","volume":"24","author":"J Berthomieu","year":"2013","unstructured":"Berthomieu, J., Lecerf, G., Quintin, G.: Polynomial root finding over local rings and application to error correcting codes. Appl. Algebra Eng. Commun. Comput. 24(6), 413\u2013443 (2013)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3\u20134","key":"652_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"652_CR10","unstructured":"Bruns, W., Vetter, U.: Determinantal rings, Lecture Notes in Mathematics, vol. 1327. Springer (2006)"},{"key":"652_CR11","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Universitat Innsbruck, Austria, Ph. D. Thesis (1965)"},{"key":"652_CR12","volume-title":"Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory","author":"B Buchberger","year":"1985","unstructured":"Buchberger, B.: Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory. Reidel Publishing Company, Dordrecht (1985)"},{"key":"652_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2017.09.002","volume":"703","author":"B Bulyovszky","year":"2017","unstructured":"Bulyovszky, B., Horv\u00e1th, G.: Polynomial functions over finite commutative rings. Theoret. Comput. Sci. 703, 76\u201386 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"652_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.jsc.2022.05.001","volume":"114","author":"A Caminata","year":"2023","unstructured":"Caminata, A., Gorla, E.: Solving degree, last fall degree, and related invariants. J. Symb. Comput. 114, 322\u2013335 (2023)","journal-title":"J. Symb. Comput."},{"key":"652_CR15","doi-asserted-by":"crossref","unstructured":"Caruso, X., Roe, D., Vaccon, T.: p-adic stability in linear algebra. In: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp. 101\u2013108. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2755996.2756655"},{"key":"652_CR16","doi-asserted-by":"crossref","unstructured":"Courtois, N.T.: Efficient zero-knowledge authentication based on a linear algebra problem MinRank. In: Advances in Cryptology\u2014ASIACRYPT 2001, pp. 402\u2013421. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45682-1_24"},{"key":"652_CR17","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: B.\u00a0Preneel (ed.) Advances in Cryptology\u2014EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000, Proceeding, Lecture Notes in Computer Science, vol. 1807, pp. 392\u2013407. Springer (2000)","DOI":"10.1007\/3-540-45539-6_27"},{"issue":"1","key":"652_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10623-008-9215-5","volume":"50","author":"ST Dougherty","year":"2009","unstructured":"Dougherty, S.T., Kim, J.L., Kulosman, H.: MDS codes over finite principal ideal rings. Des. Codes Crypt. 50(1), 77 (2009)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"652_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-012-9726-y","volume":"71","author":"Y Fan","year":"2014","unstructured":"Fan, Y., Ling, S., Liu, H.: Matrix product codes over finite commutative Frobenius rings. Des. Codes Crypt. 71(2), 201\u2013227 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"1\u20133","key":"652_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"652_CR21","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383. Association for Computing Machinery (2002)","DOI":"10.1145\/780506.780516"},{"key":"652_CR22","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Safey El\u00a0Din, M., Spaenlehauer, P.J.: Computing loci of rank defects of linear matrices using Gr\u00f6bner bases and applications to cryptology. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pp. 257\u2013264. Association for Computing Machinery, New York, United States (2010)","DOI":"10.1145\/1837934.1837984"},{"key":"652_CR23","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Levy-dit Vehel, F., Perret, L.: Cryptanalysis of minrank. In: Advances in Cryptology\u2013CRYPTO 2008: 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings 28, pp. 280\u2013296. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_16"},{"key":"652_CR24","unstructured":"Felix, F.: Elliptic curves over rings with a point of view on cryptography and factoring. Ph.D. thesis, Carl von Ossietzky-Universit\u00e4t Oldenburg (2005). https:\/\/user.math.uzh.ch\/fontein\/diplom-fontein.pdf"},{"issue":"2","key":"652_CR25","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"652_CR26","doi-asserted-by":"crossref","unstructured":"Gianni, P., Mora, T.: Algebraic solution of systems of polynomial equations using Groebner bases. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 5th International Conference, AAECC-5 Menorca, Spain, June 15\u201319, 1987 Proceedings 5, pp. 247\u2013257. Springer (1989)","DOI":"10.1007\/3-540-51082-6_83"},{"issue":"6","key":"652_CR27","doi-asserted-by":"publisher","first-page":"4480","DOI":"10.1109\/TIT.2017.2778726","volume":"64","author":"E Gorla","year":"2017","unstructured":"Gorla, E., Ravagnani, A.: An algebraic framework for end-to-end physical-layer network coding. IEEE Trans. Inf. Theory 64(6), 4480\u20134495 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"07","key":"652_CR28","doi-asserted-by":"publisher","first-page":"1350034","DOI":"10.1142\/S0219498813500345","volume":"12","author":"A Hashemi","year":"2013","unstructured":"Hashemi, A., Alvandi, P.: Applying Buchberger\u2019s criteria for computing Gr\u00f6bner bases over finite-chain rings. J. Algebra Appl. 12(07), 1350034 (2013)","journal-title":"J. Algebra Appl."},{"key":"652_CR29","doi-asserted-by":"crossref","unstructured":"Kalachi, H.T., Kamche, H.T.: On the rank decoding problem over finite principal ideal rings. Adv. Math. Commun. (2023)","DOI":"10.3934\/amc.2023003"},{"key":"652_CR30","first-page":"1","volume":"10","author":"HT Kamche","year":"2024","unstructured":"Kamche, H.T., Kalachi, H.T., Djomou, F.R.K., Fouotsa, E.: Low-rank parity-check codes over finite commutative rings. Applicable Algebra Eng. Commun. Comput. 10, 1\u201327 (2024)","journal-title":"Applicable Algebra Eng. Commun. Comput."},{"issue":"12","key":"652_CR31","doi-asserted-by":"publisher","first-page":"7718","DOI":"10.1109\/TIT.2019.2933520","volume":"65","author":"HT Kamche","year":"2019","unstructured":"Kamche, H.T., Mouaha, C.: Rank-metric codes over finite principal ideal rings and applications. IEEE Trans. Inf. Theory 65(12), 7718\u20137735 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"652_CR32","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s40065-021-00327-z","volume":"10","author":"FR Kamwa Djomou","year":"2021","unstructured":"Kamwa Djomou, F.R., Kalachi, H.T., Fouotsa, E.: Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer. Arab. J. Math. 10(2), 357\u2013366 (2021)","journal-title":"Arab. J. Math."},{"issue":"2","key":"652_CR33","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9947-1949-0031470-3","volume":"66","author":"I Kaplansky","year":"1949","unstructured":"Kaplansky, I.: Elementary divisors and modules. Trans. Am. Math. Soc. 66(2), 464\u2013491 (1949)","journal-title":"Trans. Am. Math. Soc."},{"key":"652_CR34","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 99, pp. 19\u201330. Springer, Berlin Heidelberg, Berlin, Heidelberg (1999)"},{"issue":"4","key":"652_CR35","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1080\/03081087.2020.1743633","volume":"70","author":"A Kulkarni","year":"2022","unstructured":"Kulkarni, A.: Solving p-adic polynomial systems via iterative eigenvector algorithms. Linear Multilinear Algebra 70(4), 650\u2013671 (2022)","journal-title":"Linear Multilinear Algebra"},{"issue":"2","key":"652_CR36","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0747-7171(08)80086-7","volume":"13","author":"D Lazard","year":"1992","unstructured":"Lazard, D.: Solving zero-dimensional algebraic systems. J. Symb. Comput. 13(2), 117\u2013131 (1992)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"652_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1958.1057446","volume":"4","author":"C Lee","year":"1958","unstructured":"Lee, C.: Some properties of nonbinary error-correcting codes. IRE Trans. Inf. Theory 4(2), 77\u201382 (1958)","journal-title":"IRE Trans. Inf. Theory"},{"key":"652_CR38","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1090\/conm\/634\/12702","volume":"634","author":"E Mart\u0131nez-Moro","year":"2015","unstructured":"Mart\u0131nez-Moro, E., Szabo, S.: On codes over local Frobenius non-chain rings of order 16. Noncommutative rings and their applications. Contemp. Math 634, 227\u2013243 (2015)","journal-title":"Contemp. Math"},{"key":"652_CR39","volume-title":"Finite Rings with Identity","author":"BR McDonald","year":"1974","unstructured":"McDonald, B.R.: Finite Rings with Identity, vol. 28. Marcel Dekker Incorporated, New York (1974)"},{"key":"652_CR40","doi-asserted-by":"crossref","unstructured":"Mikhailov, D., Nechaev, A.A.: Solving systems of polynomial equations over Galois\u2013Eisenstein rings with the use of the canonical generating systems of polynomial ideals. Discrete Math. Appl. (2004)","DOI":"10.1515\/156939204774148811"},{"issue":"2\u20133","key":"652_CR41","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0747-7171(88)80052-X","volume":"6","author":"HM M\u00f6ller","year":"1988","unstructured":"M\u00f6ller, H.M.: On the construction of Gr\u00f6bner bases using syzygies. J. Symb. Comput. 6(2\u20133), 345\u2013359 (1988)","journal-title":"J. Symb. Comput."},{"key":"652_CR42","first-page":"213","volume":"5","author":"AA Nechaev","year":"2008","unstructured":"Nechaev, A.A.: Finite rings with applications. Handb. Algebra 5, 213\u2013320 (2008)","journal-title":"Handb. Algebra"},{"key":"652_CR43","doi-asserted-by":"crossref","unstructured":"Neiger, V., Rosenkilde, J., Schost, \u00c9.: Fast computation of the roots of polynomials over the ring of power series. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp. 349\u2013356. Association for Computing Machinery, New York, United States (2017)","DOI":"10.1145\/3087604.3087642"},{"key":"652_CR44","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"GH Norton","year":"2000","unstructured":"Norton, G.H., S\u0103l\u0103gean, A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Commun. Comput. 10, 489\u2013506 (2000)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"652_CR45","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/S1571-0653(04)00175-1","volume":"6","author":"GH Norton","year":"2001","unstructured":"Norton, G.H., Salagean, A.: Strong Gr\u00f6bner bases and cyclic codes over a finite-chain ring. Electron. Notes Discrete Math. 6, 240\u2013250 (2001)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"652_CR46","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1017\/S0004972700019973","volume":"64","author":"GH Norton","year":"2001","unstructured":"Norton, G.H., Salagean, A.: Strong Gr\u00f6bner bases for polynomials over a principal ideal ring. Bull. Aust. Math. Soc. 64(3), 505\u2013528 (2001)","journal-title":"Bull. Aust. Math. Soc."},{"key":"652_CR47","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of non-commutative polynomials. Ann. Math., pp. 480\u2013508 (1933)","DOI":"10.2307\/1968173"},{"issue":"3","key":"652_CR48","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski, A.V., Johansson, T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Transm. 38(3), 237\u2013246 (2002)","journal-title":"Probl. Inf. Transm."},{"key":"652_CR49","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-020-00825-9","volume":"89","author":"J Renner","year":"2021","unstructured":"Renner, J., Neri, A., Puchinger, S.: Low-rank parity-check codes over Galois rings. Des. Codes Crypt. 89, 351\u2013386 (2021)","journal-title":"Des. Codes Crypt."},{"key":"652_CR50","unstructured":"Storjohann, A.: Algorithms for matrix canonical forms. Ph.D. thesis, ETH Zurich (2000)"},{"key":"652_CR51","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (2023). https:\/\/www.sagemath.org"},{"key":"652_CR52","doi-asserted-by":"crossref","unstructured":"Vaccon, T.: Matrix-F5 algorithms over finite-precision complete discrete valuation fields. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 397\u2013404. Association for Computing Machinery, New York, United States (2014)","DOI":"10.1145\/2608628.2608658"},{"key":"652_CR53","unstructured":"Weger, V., Khathuria, K., Horlemann, A.L., Battaglioni, M., Santini, P., Persichetti, E.: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. (2022)"},{"key":"652_CR54","doi-asserted-by":"crossref","unstructured":"Yengui, I.: Constructive commutative algebra: projective modules over polynomial rings and dynamical Gr\u00f6bner bases. Lecture Notes in Mathematics. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-19494-3"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00652-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00652-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00652-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:02:31Z","timestamp":1761595351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00652-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["652"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00652-8","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2024,4,24]]},"assertion":[{"value":"11 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","order":4,"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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}