{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:27:18Z","timestamp":1763684838557,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["61872383"],"award-info":[{"award-number":["61872383"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["2021RC29"],"award-info":[{"award-number":["2021RC29"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2021YFB3100200"],"award-info":[{"award-number":["2021YFB3100200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10623-022-01175-4","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T11:04:10Z","timestamp":1673348650000},"page":"1713-1736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An improved method for predicting truncated multiple recursive generators with unknown parameters"],"prefix":"10.1007","volume":"91","author":[{"given":"Han-Bing","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6929-1999","authenticated-orcid":false,"given":"Qun-Xiong","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Yi-Jian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jing-Guo","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Yu-Fei","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Jing-Wen","family":"Xue","sequence":"additional","affiliation":[]},{"given":"You","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bai-Shun","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"key":"1175_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai M., Kumar R., Sivakumar D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 601\u2013610. Association for Computing Machinery, New York, NY, USA (2001).","DOI":"10.1145\/380752.380857"},{"key":"1175_CR2","unstructured":"Ajtai M.: Generating random lattices according to the invariant distribution (2006). Draft of March."},{"key":"1175_CR3","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-77870-5_19","volume-title":"Advances in Cryptology - EUROCRYPT 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht M.R., Heninger N.: On bounded distance decoding with predicate: Breaking the \u201clattice barrier\" for the hidden number problem. In: Canteaut A., Standaert F. (eds.) Advances in Cryptology - EUROCRYPT 2021, pp. 528\u2013558. Springer, Berlin, Heidelberg (2021)."},{"key":"1175_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology - EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht M.R., Ducas L., Herold G., Kirshanova E., Postlethwaite E.W., Stevens M.: The general sieve kernel and new records in lattice reduction. In: Ishai Y., Rijmen V. (eds.) Advances in Cryptology - EUROCRYPT 2019, pp. 717\u2013746. Springer, Cham (2019)."},{"key":"1175_CR5","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)."},{"issue":"3","key":"1175_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02252875","volume":"1","author":"J Boyar","year":"1989","unstructured":"Boyar J.: Inferring sequences produced by a linear congruential generator missing low-order bits. J. Cryptol. 1(3), 177\u2013184 (1989).","journal-title":"J. Cryptol."},{"issue":"1","key":"1175_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J Boyar","year":"1989","unstructured":"Boyar J.: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1), 129\u2013141 (1989).","journal-title":"J. ACM"},{"issue":"2","key":"1175_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ffa.2008.07.005","volume":"15","author":"HJ Chen","year":"2009","unstructured":"Chen H.J., Qi W.F.: On the distinctness of maximal length sequences over $$\\mathbb{Z} \/(pq)$$ modulo 2. Finite Fields Appl. 15(2), 23\u201339 (2009).","journal-title":"Finite Fields Appl."},{"key":"1175_CR9","doi-asserted-by":"crossref","unstructured":"Contini S., Shparlinski I.E.: On stern\u2019s attack against secret truncated linear congruential generators. In: Information Security and Privacy, pp. 52\u201360. Springer, Berlin (2005).","DOI":"10.1007\/11506157_5"},{"key":"1175_CR10","doi-asserted-by":"crossref","unstructured":"Coppersmith D.: Finding a small root of a univariate modular equation. In: Advances in Cryptology \u2013 EUROCRYPT\u201996, pp. 155\u2013165. Springer, Berlin (1996).","DOI":"10.1007\/3-540-68339-9_14"},{"key":"1175_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/321371.321379","volume":"14","author":"RR Coveyou","year":"1967","unstructured":"Coveyou R.R., MacPherson R.D.: Fourier analysis of uniform random number generators. J. ACM 14, 100\u2013119 (1967).","journal-title":"J. ACM"},{"key":"1175_CR12","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"GC David","year":"1991","unstructured":"David G.C., Erich K.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28, 693\u2013701 (1991).","journal-title":"Acta Informatica"},{"issue":"1","key":"1175_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044322.1044323","volume":"15","author":"L Deng","year":"2005","unstructured":"Deng L.: Efficient and portable multiple recursive generators of large order. ACM Trans. Model. Comput. Simul. 15(1), 1\u201313 (2005).","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"4","key":"1175_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/945511.945513","volume":"13","author":"L Deng","year":"2003","unstructured":"Deng L., Xu H.Q.: A system of high-dimensional, efficient, long-cycle and portable uniform random number generators. ACM Trans. Model. Comput. Simul. 13(4), 299\u2013309 (2003).","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"4","key":"1175_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3212673","volume":"44","author":"L Deng","year":"2018","unstructured":"Deng L., Shiau J.H., Lu H.H., Bowman D.: Secure and fast encryption (safe) with classical random number generators. ACM Trans. Math. Softw. 44(4), 1\u201317 (2018).","journal-title":"ACM Trans. Math. Softw."},{"key":"1175_CR16","unstructured":"development team T.F.: Fplll, a Lattice Reduction Library, version 5.4.1. http:\/\/github.com\/fplll\/fplll."},{"key":"1175_CR17","unstructured":"ETSI\/SAGE: Specification of the 3GPP Confidentiality and Integrity Algorithms 128-EEA3 & 128-EIA3. Document 2: ZUC Specification (2011)."},{"issue":"2","key":"1175_CR18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0217016","volume":"17","author":"AM Frieze","year":"1988","unstructured":"Frieze A.M., Hastad J., Kannan R., Lagarias J.C., Shamir A.: Reconstructing truncated integer variables satisfying linear congruences. SIAM J. Comput. 17(2), 262\u2013280 (1988).","journal-title":"SIAM J. Comput."},{"key":"1175_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama N., Nguyen P.Q.: Predicting lattice reduction. In: Smart N. (ed.) Advances in Cryptology - EUROCRYPT 2008, pp. 31\u201351. Springer, Berlin (2008)."},{"issue":"2","key":"1175_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0004972708001275","volume":"79","author":"D Gomez","year":"2009","unstructured":"Gomez D., Gutierrez J., Ibeas \u00c1., Sevilla D.: Common factors of resultants modulo $$p$$. Bull. Aust. Math. Soc. 79(2), 299\u2013302 (2009).","journal-title":"Bull. Aust. Math. Soc."},{"key":"1175_CR21","unstructured":"Hallgren S.: Linear congruential generators over elliptic curves. In: Preprint CS94 -143, Department of Computer Science, Cornegie Mellon University, pp. 1\u201310 (1994)."},{"issue":"1","key":"1175_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-003-6153-0","volume":"35","author":"F Hess","year":"2005","unstructured":"Hess F., Shparlinski I.E.: On the linear complexity and multidimensional distribution of congruential generators over elliptic curves. Des. Codes Cryptogr. 35(1), 111\u2013117 (2005).","journal-title":"Des. Codes Cryptogr."},{"key":"1175_CR23","unstructured":"Huang M.Q.: Analysis and cryptologic evaluation of primitive sequences over an integer residue ring. Doctoral Dissertation of Graduate School of USTC, Academia Sinica (1988)."},{"key":"1175_CR24","doi-asserted-by":"crossref","unstructured":"Josh A., Virginia V.W.: A refined laser method and faster matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522\u2013539. Society for Industrial and Applied Mathematics, USA (2021).","DOI":"10.1137\/1.9781611976465.32"},{"issue":"3","key":"1175_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A Joux","year":"1998","unstructured":"Joux A., Stern J.: Lattice reduction: a toolbox for the cryptanalyst. J. Cryptol. 11(3), 161\u2013185 (1998).","journal-title":"J. Cryptol."},{"key":"1175_CR26","doi-asserted-by":"crossref","unstructured":"Kannan R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 193\u2013206. Association for Computing Machinery, New York, NY, USA (1983).","DOI":"10.1145\/800061.808749"},{"issue":"3","key":"1175_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987).","journal-title":"Math. Oper. Res."},{"key":"1175_CR28","unstructured":"Knuth D.E.: Seminumerical algorithms. In: The Art of Computer Programming, vol. 2. Addison-Wesley, Canada (1981)."},{"issue":"1","key":"1175_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/TIT.1985.1056997","volume":"31","author":"DE Knuth","year":"1985","unstructured":"Knuth D.E.: Deciphering a linear congruential encryption. IEEE Trans. Inf. Theory 31(1), 49\u201352 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1175_CR30","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1070\/RM1993v048n01ABEH000993","volume":"48","author":"AS Kuzmin","year":"1993","unstructured":"Kuzmin A.S., Nechaev A.A.: Linear recurring sequences over galois ring. Russ. Math. Surv. 48, 171\u2013172 (1993).","journal-title":"Russ. Math. Surv."},{"issue":"2","key":"1175_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1515\/dma.2011.010","volume":"21","author":"AS Kuzmin","year":"2011","unstructured":"Kuzmin A.S., Nechaev A.A.: Reconstruction of a linear recurrence of maximal period over a galois ring from its highest coordinate sequence. Discret. Math. Appl. 21(2), 145\u2013178 (2011).","journal-title":"Discret. Math. Appl."},{"key":"1175_CR32","first-page":"155","volume":"12","author":"AS Kuzmin","year":"2009","unstructured":"Kuzmin A.S., Marchalko G.B., Nechaev A.A.: Reconstruction of a linear recurrence over a primary residue ring. Mem. Discret. Math. 12, 155\u2013194 (2009).","journal-title":"Mem. Discret. Math."},{"key":"1175_CR33","unstructured":"L\u2019Ecuyer P., Touzin R.: Fast combined multiple recursive generators with multipliers of the form $$a=\\pm 2^q\\pm 2^r$$. In: Proceedings of the 32nd Conference on Winter Simulation, pp. 683\u2013689. Society for Computer Simulation International, San Diego, CA, USA (2000)."},{"issue":"1","key":"1175_CR34","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/opre.47.1.159","volume":"47","author":"P L\u2019Ecuyer","year":"1999","unstructured":"L\u2019Ecuyer P.: Good parameters and implementations for combined multiple recursive random number generators. Oper. Res. 47(1), 159\u2013164 (1999).","journal-title":"Oper. Res."},{"key":"1175_CR35","first-page":"141","volume":"26","author":"DH Lehmer","year":"1951","unstructured":"Lehmer D.H.: Mathematical methods in large-scale computing units. Ann. Comput. Lab. Harvard Univ. 26, 141\u2013146 (1951).","journal-title":"Ann. Comput. Lab. Harvard Univ."},{"issue":"4","key":"1175_CR36","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"issue":"1","key":"1175_CR37","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey J.L.: Shift register synthesis and bch decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1175_CR38","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00200-016-0303-x","volume":"28","author":"L M\u00e9rai","year":"2017","unstructured":"M\u00e9rai L.: Predicting the elliptic curve congruential generator. Appl. Algebra Eng. Commun. Comput. 28(3), 193\u2013203 (2017).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"129","key":"1175_CR39","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1090\/S0025-5718-1975-0369276-7","volume":"29","author":"WH Mills","year":"1975","unstructured":"Mills W.H.: Continued fractions and linear recurrences. Math. Comput. 29(129), 173\u2013180 (1975).","journal-title":"Math. Comput."},{"key":"1175_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-02295-1","volume-title":"The LLL Algorithm","author":"PQ Nguyen","year":"2010","unstructured":"Nguyen P.Q.: Hermite\u2019s constant and lattice algorithms. In: Nguyen P.Q., Vall\u00e9e B. (eds.) The LLL Algorithm, pp. 19\u201369. Springer, Berlin, Heidelberg (2010)."},{"key":"1175_CR41","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"PQ Nguyen","year":"2006","unstructured":"Nguyen P.Q., Stehl\u00e9 D.: LLL on the average. In: Hess F., Pauli S., Pohst M. (eds.) Algorithmic Number Theory, pp. 238\u2013256. Springer, Berlin, Heidelberg (2006)."},{"key":"1175_CR42","doi-asserted-by":"crossref","unstructured":"Plumstead J.B.: Inferring a sequence generated by a linear congruence. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp. 153\u2013159. IEEE, Chicago, IL, USA (1982).","DOI":"10.1109\/SFCS.1982.73"},{"key":"1175_CR43","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0214038","volume":"14","author":"A Reeds","year":"1985","unstructured":"Reeds A., Sloane N.J.A.: Shift-register synthesis (mod $$m$$). SIAM J. Comput. 14, 505\u2013513 (1985).","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1175_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr C.P., Euchner M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(2), 181\u2013199 (1994).","journal-title":"Math. Program."},{"key":"1175_CR45","unstructured":"Shoup V.: Number Theory C++ Library (NTL), version 11.4.3. http:\/\/www.shoup.net\/ntl\/."},{"key":"1175_CR46","doi-asserted-by":"crossref","unstructured":"Stern J.: Secret linear congruential generators are not cryptographically secure. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp. 421\u2013426. IEEE, Los Angeles (1987).","DOI":"10.1109\/SFCS.1987.51"},{"issue":"1","key":"1175_CR47","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y Sugiyama","year":"1975","unstructured":"Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T.: A method for solving key equation for decoding goppa codes. Inf. Control 27(1), 87\u201399 (1975).","journal-title":"Inf. Control"},{"key":"1175_CR48","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1007\/s10623-020-00729-8","volume":"88","author":"HY Sun","year":"2020","unstructured":"Sun H.Y., Zhu X.Y., Zheng Q.X.: Predicting truncated multiple recursive generators with unknown parameters. Des. Codes Cryptogr. 88, 1083\u20131102 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1175_CR49","doi-asserted-by":"crossref","unstructured":"Von zur Gathen J., Gerhard J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2013).","DOI":"10.1017\/CBO9781139856065"},{"key":"1175_CR50","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1090\/S0002-9947-1933-1501705-4","volume":"35","author":"M Ward","year":"1933","unstructured":"Ward M.: The arithmetical theory of linear recurring series. Trans. Am. Math. Soc. 35, 600\u2013628 (1933).","journal-title":"Trans. Am. Math. Soc."},{"key":"1175_CR51","volume-title":"Matrices over Commutative Rings","author":"CB William","year":"1993","unstructured":"William C.B.: Matrices over Commutative Rings. Marcel Dekker, New York (1993)."},{"key":"1175_CR52","volume-title":"Reconstructing Truncated Sequences Derived from Primitive Sequences over Inter Residue Rings","author":"JB Yang","year":"2017","unstructured":"Yang J.B.: Reconstructing Truncated Sequences Derived from Primitive Sequences over Inter Residue Rings. PLA Information Engineering University, Zhengzhou (2017)."},{"issue":"1\u20132","key":"1175_CR53","first-page":"166","volume":"5","author":"JJ Zhou","year":"1990","unstructured":"Zhou J.J., Qi W.F.: On some properties of linear recurring sequences over $$\\mathbb{Z} \/(m)$$. Chin. Q. J. Math. 5(1\u20132), 166\u2013171 (1990).","journal-title":"Chin. Q. J. Math."},{"key":"1175_CR54","volume-title":"Some Results on Injective Mappings of Primitive Sequences Modulo Prime Powers","author":"XY Zhu","year":"2004","unstructured":"Zhu X.Y.: Some Results on Injective Mappings of Primitive Sequences Modulo Prime Powers. PLA Information Engineering University, Zhengzhou (2004)."},{"issue":"1","key":"1175_CR55","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0107003","volume":"7","author":"N Zierler","year":"1959","unstructured":"Zierler N.: Linear recurring sequences. J. Soc. Ind. Appl. Math. 7(1), 31\u201348 (1959).","journal-title":"J. Soc. Ind. Appl. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01175-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01175-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01175-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:07:43Z","timestamp":1682021263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01175-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,10]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1175"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01175-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,1,10]]},"assertion":[{"value":"27 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}