{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:57:34Z","timestamp":1776067054742,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00200-025-00723-4","type":"journal-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T08:44:40Z","timestamp":1769589880000},"page":"389-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Erzeugungsgrad, VC-dimension and neural networks with rational activation function"],"prefix":"10.1007","volume":"37","author":[{"given":"Luis Miguel","family":"Pardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Sebasti\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,28]]},"reference":[{"key":"723_CR1","first-page":"7","volume":"5","author":"EG Belaga","year":"1961","unstructured":"Belaga, E.G.: Evaluation of polynomials of one variable with preliminary processing of the coefficients. Problemy Kibernet 5, 7\u201315 (1961)","journal-title":"Problemy Kibernet"},{"key":"723_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. Fifteenth Ann. ACM Symp. Theor. Comput., 80\u201386 (1983)","DOI":"10.1145\/800061.808735"},{"key":"723_CR3","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis Dimension. J. ACM 36, 929\u2013965 (1989)","journal-title":"J. ACM"},{"key":"723_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Clausen, M., A. M.: Shokrollahi, Algebraic Complexity Theory, Volume 315 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin (1997)","DOI":"10.1007\/978-3-662-03338-8"},{"key":"723_CR5","unstructured":"Chevalley, C.: Introduction \u00e0 la Th\u00e9orie des Sch\u00e9mas, Cours \u00e0 l\u2019IHP, Centre de Physique Th\u00e9orique de l\u2019\u00c9cole Polytechnique, Pub. N A75.1268 (1964-65)"},{"key":"723_CR6","doi-asserted-by":"crossref","unstructured":"Cucker, F., Karpinski, M., Koiran, P., Lickteig, T., Werther, K.: On real Turing machines that toss coins. In: Proc. of the Twenty-Seventh Ann. ACM Symp. on Theor. of Comput. (F. T. Leighton, A. Borodin eds.), 335\u2013342. ACM, New York (1995)","DOI":"10.1145\/225058.225155"},{"key":"723_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00037-013-0073-9","volume":"23","author":"Z Dvir","year":"2014","unstructured":"Dvir, Z., Koll\u00e1r, J., Lovett, S.: Variety evasive sets. Comput. Complex. 23, 509\u2013529 (2014)","journal-title":"Comput. Complex."},{"key":"723_CR8","volume-title":"Intersection Theory","author":"W Fulton","year":"1983","unstructured":"Fulton, W.: Intersection Theory. Springer, New York (1983)"},{"key":"723_CR9","unstructured":"Giusti, M., Heintz, J.: La d\u00e9termination des points isol\u00e9s et de la dimension d\u2019une vari\u00e9t\u00e9 alg\u00e9brique peut se faire en temps polynomial, Computational algebraic geometry and commutative algebra, Cortona, 216-256 (1991)"},{"key":"723_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0022-4049(97)00015-7","volume":"117 & 118","author":"M Giusti","year":"1997","unstructured":"Giusti, M., H\u00e4gele, K., Heintz, J., Morais, J.E., Monta\u00f1a, J.L., Pardo, L.M.: Lower bounds for diophantine approximations. J. Pure Appl. Algebra 117 & 118, 277\u2013317 (1997)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1\u20133","key":"723_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0022-4049(96)00099-0","volume":"124","author":"M Giusti","year":"1998","unstructured":"Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M.: Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra 124(1\u20133), 101\u2013146 (1998)","journal-title":"J. Pure Appl. Algebra"},{"key":"723_CR12","doi-asserted-by":"crossref","unstructured":"Giusti, M., Heintz, J., Morais, J.E., Pardo, L.M.: When polynomial equation systems can be \u201csolved\u201d fast?, Applied Algebra. In: Algebraic Algorithms and Error-Correcting Codes: 11th International Symposium, AAECC-11 Paris. France, Proceedings 11, 205\u2013231 (1995)","DOI":"10.1007\/3-540-60114-7_16"},{"key":"723_CR13","first-page":"1223","volume":"325","author":"M Giusti","year":"1997","unstructured":"Giusti, M., Heintz, J., Morais, J.E., Pardo, Luis M.: Le r\u00f4le des structures des donn\u00e9es dans les probl\u00e8mes d\u2019\u00e9limination, Comptes Rendues Acad. Sci. Paris. S\u00e9r. I 325, 1223\u20131228 (1997)","journal-title":"S\u00e9r. I"},{"key":"723_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1022847329178","volume":"18","author":"P Goldberg","year":"1995","unstructured":"Goldberg, P., Jerrum, M.: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Mach. Learn. 18, 131\u2013148 (1995)","journal-title":"Mach. Learn."},{"key":"723_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jsc.2019.06.007","volume":"101","author":"DY Grigor\u2019ev","year":"2020","unstructured":"Grigor\u2019ev, D.Y.: Decomposing tropical rational functions. J. Symb. Comput. 101, 61\u201372 (2020)","journal-title":"J. Symb. Comput."},{"key":"723_CR16","volume-title":"Tropical Newton-Puiseux polynomials, Computer Algebra in Scientific Computing (CASC 2018), 177\u2013186","author":"DY Grigor\u2019ev","year":"2018","unstructured":"Grigor\u2019ev, D.Y.: Tropical Newton-Puiseux polynomials, Computer Algebra in Scientific Computing (CASC 2018), 177\u2013186. Springer International Publishing, Cham (2018)"},{"key":"723_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0097-3165(95)90052-7","volume":"69","author":"D Haussler","year":"1995","unstructured":"Haussler, D.: Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory Ser. A 69, 217\u2013232 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"723_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0022-4049(98)00148-0","volume":"146","author":"K H\u00e4gele","year":"2000","unstructured":"H\u00e4gele, K., Morais, J.E., Pardo, L.M., Sombra, M.: On the intrinsic complexity of the arithmetic Nullstellensatz. J. Pure Appl. Algebra 146(2), 103\u2013183 (2000)","journal-title":"J. Pure Appl. Algebra"},{"key":"723_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(83)90002-6","volume":"24","author":"J Heintz","year":"1983","unstructured":"Heintz, J.: Fast quantifier elimination for algebraically closed fields. Theoret. Comput. Sci. 24, 239\u2013277 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"723_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(85)90150-1","volume":"39","author":"J Heintz","year":"1985","unstructured":"Heintz, J.: Corrigendum: definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 39, 343 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"723_CR21","doi-asserted-by":"crossref","unstructured":"Heintz, J.: On the computational complexity of polynomials and bilinear mappings. In: Proc. AAECC-5, 269-300, Springer, Berlin (1989)","DOI":"10.1007\/3-540-51082-6_85"},{"key":"723_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2022.101710","volume":"75","author":"J Heintz","year":"2023","unstructured":"Heintz, J., Ocar, H., Pardo, L.M., Rojas Paredes, A., Segura, C.: An unfeasibility view of neural network learning. J. Complex. 75, 101710 (2023)","journal-title":"J. Complex."},{"key":"723_CR23","unstructured":"Heintz, J., Schnorr, C.P.: Testing polynomials which are easy to compute, Logic and algorithmic: An international symposium held in honor of Ernst Specker, Monographie No. 30 de l\u2019Enseignement Math\u00e9matique, 237-254 (1982)"},{"key":"723_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jcss.1997.1477","volume":"54","author":"M Karpinski","year":"1997","unstructured":"Karpinski, M., Macintyre, A.: Polynomial bounds for VC-dimension of sigmoidal and general Pfaffian neural networks. J. Comput. Syst. Sci. 54, 169\u2013176 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"723_CR25","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/088","volume-title":"Fewnomials","author":"AG Khovanski","year":"1991","unstructured":"Khovanski, A.G.: Fewnomials. American Mathematical Society, Providence (1991)"},{"key":"723_CR26","volume-title":"The Art of Computer Programming. Vol 2. Seminumerical Algorithms","author":"DE Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol 2. Seminumerical Algorithms, 2nd edn. Addison Wesley, Reading (1981)","edition":"2"},{"key":"723_CR27","doi-asserted-by":"crossref","unstructured":"Koiran, P.: Approximating the volume of definable sets. In: FOCS \u201995: Proc. of the 36th Annual Symp. on Found. of Comput. Sci., 134-141. ACM, Washington DC (1995)","DOI":"10.1109\/SFCS.1995.492470"},{"key":"723_CR28","doi-asserted-by":"crossref","unstructured":"Krick, T., Pardo, L.M.: A computational method for diophantine approximations. In Algorithms in Algebraic Geometry, L. Gonz\u00e1lez Vega & T. Recio (eds.), Progress in Mathematics, 193-253 (1996), Birkhauser Verlag, Basel (1996)","DOI":"10.1007\/978-3-0348-9104-2_11"},{"key":"723_CR29","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/161","volume-title":"Introduction to Tropical Geometry","author":"D Maclagan","year":"2015","unstructured":"Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry. American Mathematical Society, Providence (2015)"},{"key":"723_CR30","doi-asserted-by":"crossref","unstructured":"Mikhalkin, G.: Tropical geometry and its applications. In: Proc. ICM Madrid, Spain, 2006, 827-852, Eur. Math. Soc., Z\u00fcrich (2006)","DOI":"10.4171\/022-2\/40"},{"issue":"2","key":"723_CR31","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J Milnor","year":"1964","unstructured":"Milnor, J.: On the Betti numbers of real varieties. Proc. Am. Math. Soc. 15(2), 275\u2013280 (1964)","journal-title":"Proc. Am. Math. Soc."},{"key":"723_CR32","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01613615","volume":"7","author":"JL Monta\u00f1a","year":"1996","unstructured":"Monta\u00f1a, J.L., Pardo, L.M.: Lower bounds for arithmetic networks II: Sum of Betti numbers. Appl. Algebra Eng. Comm. Comput. 7, 41\u201351 (1996)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"723_CR33","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10472-009-9148-3","volume":"56","author":"JL Monta\u00f1a","year":"2009","unstructured":"Monta\u00f1a, J.L., Pardo, L.M.: On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations. Ann. Math. Artif. Intell. 56, 371\u2013388 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"723_CR34","doi-asserted-by":"crossref","unstructured":"Monta\u00f1a, J.L., Pardo, L.M., Callau, M.: VC-dimension bounds for analytic algebraic computations. In: Proc. Computing and Combinatorics, 14 Annual International Conference, Lecture Notes in Computer Science, 5092, 62-71. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-69733-6_7"},{"issue":"163","key":"723_CR35","first-page":"10","volume":"61","author":"TS Motzkin","year":"1955","unstructured":"Motzkin, T.S.: Evaluation of polynomials and evaluation of rational functions. Bull. Am. Math. Soc. 61(163), 10 (1955)","journal-title":"Bull. Am. Math. Soc."},{"key":"723_CR36","unstructured":"Oleinik, O.: Estimates of the Betti numbers of real algebraic hypersurfaces, Mat. Sb. N.S., 28, 635\u2013640 (1951)"},{"key":"723_CR37","first-page":"399","volume":"1","author":"O Oleinik","year":"1962","unstructured":"Oleinik, O., Petrovsky, I.: On the topology of real algebraic surfaces. Izv. Akad. Nauk SSSR (in Trans. Am. Math. Soc.) 1, 399\u2013417 (1962)","journal-title":"Izv. Akad. Nauk SSSR (in Trans. Am. Math. Soc.)"},{"key":"723_CR38","doi-asserted-by":"crossref","unstructured":"Ostrowski, A.M.: On two problems in abstract algebra connected with Horner\u2019s rule. In: Studies in Mathematics and Mechanics presented to Richard von Mises, 40-48 (1954)","DOI":"10.1016\/B978-1-4832-3272-0.50010-7"},{"key":"723_CR39","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","volume":"21","author":"V Ja","year":"1966","unstructured":"Ja, V.: Pan, On means of calculating values of polynomials. Russ. Math. Surv. 21, 105\u2013136 (1966)","journal-title":"Russ. Math. Surv."},{"key":"723_CR40","doi-asserted-by":"crossref","unstructured":"Pardo, L.M.: How lower and upper complexity bounds meet in elimination theory. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, G. Cohen, M. Giusti & T. Mora (eds.), Lecture Notes in Computer Science, 948, 33-69. Springer Verlag, Berlin (1995)","DOI":"10.1007\/3-540-60114-7_4"},{"issue":"1","key":"723_CR41","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00200-023-00619-1","volume":"35","author":"LM Pardo","year":"2024","unstructured":"Pardo, L.M.: Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics. Appl. Algebra Eng. Commun. Comput. 35(1), 71\u2013118 (2024)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"723_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101588","volume":"68","author":"LM Pardo","year":"2022","unstructured":"Pardo, L.M., Sebasti\u00e1n, D.: A promenade through correct test sequences I: degree of constructible sets, B\u00e9zout\u2019s Inequality and density. J. Complex. 68, 101588 (2022)","journal-title":"J. Complex."},{"key":"723_CR43","doi-asserted-by":"crossref","unstructured":"Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., Lioa, Q.: Why and When Can Deep - but Not Shallow - Networks Avoid the Curse of Dimensionality: a Review, CBMM Memo No., 058 (2017)","DOI":"10.1007\/s11633-017-1054-2"},{"key":"723_CR44","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O.: Proving simultaneous positivity of linear forms. J. Comput. Syst. Sci. 6, 639\u2013650 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"723_CR45","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Combin. Theory Ser. A 13, 145\u2013147 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"723_CR46","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41, 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"key":"723_CR47","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF00571464","volume":"2","author":"V Strassen","year":"1972","unstructured":"Strassen, V.: Berechnung und Programm. II. Acta Inform. 2, 64\u201379 (1972)","journal-title":"Acta Inform."},{"key":"723_CR48","first-page":"184","volume":"264","author":"V Strassen","year":"1973","unstructured":"Strassen, V.: Vermeidung von Divisionen. Journal f\u00fcr die reine und angewandte Mathematik 264, 184\u2013202 (1973)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"723_CR49","unstructured":"Telgarsky, M.: Neural networks and rational functions. In: International Conference on Machine Learning, 3387\u20133393. PMLR, Brookline, MA (2017)"},{"key":"723_CR50","volume-title":"Sur l\u2019Homologie des Vari\u00e9t\u00e9s Alg\u00e9briques R\u00e9elles, In Differential and Combinatorial Topology (A Symposium in Honor of Marston Morse), 255\u2013265","author":"R Thom","year":"1965","unstructured":"Thom, R.: Sur l\u2019Homologie des Vari\u00e9t\u00e9s Alg\u00e9briques R\u00e9elles, In Differential and Combinatorial Topology (A Symposium in Honor of Marston Morse), 255\u2013265. Princeton University Press, Princeton (1965)"},{"key":"723_CR51","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the Learnable. Commun. ACM 27, 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"723_CR52","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"key":"723_CR53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00493-7","volume-title":"Lectures on B\u00e9zout\u2019s Theorem","author":"W Vogel","year":"1984","unstructured":"Vogel, W.: Lectures on B\u00e9zout\u2019s Theorem. Tata Inst. for Fundamental Research. Springer-Verlag, Berlin (1984)"},{"key":"723_CR54","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1146\/annurev.cs.03.060188.001533","volume":"3","author":"J von zur Gathen","year":"1988","unstructured":"von zur Gathen, J.: Algebraic complexity theory. Annu. Rev. Compu. Sci. 3, 317\u2013347 (1988)","journal-title":"Annu. Rev. Compu. Sci."},{"key":"723_CR55","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"HE Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifold. Trans. Am. Math. Soc. 133, 167\u2013178 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"723_CR56","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/cpa.3160230204","volume":"23","author":"S Winograd","year":"1970","unstructured":"Winograd, S.: On the number of multiplications required to compute certain functions. Commun. Pure Appl. Math. 23, 165\u2013179 (1970)","journal-title":"Commun. Pure Appl. Math."},{"key":"723_CR57","unstructured":"Zhang, L., Naitzat, G., Lim, L.: Tropical geometry of deep neural networks. In: International Conference on Machine Learning, 5824-5832. PMLR, Brookline, MA (2018)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00723-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00723-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00723-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:21:57Z","timestamp":1776064917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00723-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,28]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["723"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00723-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,28]]},"assertion":[{"value":"15 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}