{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T15:55:43Z","timestamp":1792166143663,"version":"4.4.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s00145-022-09441-3","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T21:30:31Z","timestamp":1669843831000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["On the Hardness of Module Learning with Errors with Short Distributions"],"prefix":"10.1007","volume":"36","author":[{"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corentin","family":"Jeudy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiqiang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"key":"9441_CR1","doi-asserted-by":"crossref","unstructured":"M.R. Albrecht, A.\u00a0Deo. Large modulus ring-lwe $$\\ge $$ module-lwe. In ASIACRYPT (1), volume 10624 of Lecture Notes in Computer Science, (Springer, 2017) pp. 267\u2013296","DOI":"10.1007\/978-3-319-70694-8_10"},{"key":"9441_CR2","doi-asserted-by":"crossref","unstructured":"M.R. Albrecht, A.\u00a0Deo. Large modulus ring-lwe $$>=$$ module-lwe. IACR Cryptol. ePrint Arch., (2017) p. 612","DOI":"10.1007\/978-3-319-70694-8_10"},{"issue":"2","key":"9441_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2815111.2815158","volume":"49","author":"MR Albrecht","year":"2015","unstructured":"Martin\u00a0R. Albrecht, Carlos Cid, Jean-Charles Faug\u00e8re, Robert Fitzpatrick, and Ludovic Perret. Algebraic algorithms for LWE problems. ACM Commun. Comput. Algebra, 49(2):62, 2015.","journal-title":"ACM Commun. Comput. Algebra"},{"key":"9441_CR4","unstructured":"J.\u00a0Alperin-Sheriff, D.\u00a0Apon. Dimension-preserving reductions from LWE to LWR. IACR Cryptol. ePrint Arch, 2016, p. 589"},{"key":"9441_CR5","doi-asserted-by":"crossref","unstructured":"B.\u00a0Applebaum, D.\u00a0Cash, C.\u00a0Peikert, A.\u00a0Sahai. Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In CRYPTO, volume 5677 of Lecture Notes in Computer Science (Springer, 2009), pp. 595\u2013618","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"9441_CR6","doi-asserted-by":"crossref","unstructured":"S.\u00a0Arora, R.\u00a0Ge. New algorithms for learning in presence of errors. In ICALP (1), volume 6755 of Lecture Notes in Computer Science (Springer, 2011), pp. 403\u2013415","DOI":"10.1007\/978-3-642-22006-7_34"},{"issue":"2","key":"9441_CR7","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"S.\u00a0Bai, T.\u00a0Lepoint, A.\u00a0Roux-Langlois, A.\u00a0Sakzad, D.\u00a0Stehl\u00e9, and R.\u00a0Steinfeld. Improved security proofs in lattice-based cryptography: Using the r\u00e9nyi divergence rather than the statistical distance. J. Cryptol., 31(2):610\u2013640, 2018.","journal-title":"J. Cryptol."},{"issue":"1","key":"9441_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00200-020-00433-z","volume":"33","author":"I Blanco-Chac\u00f3n","year":"2022","unstructured":"I. Blanco-Chac\u00f3n. On the RLWE\/PLWE equivalence for cyclotomic number fields. Appl. Algebra Eng. Commun. Comput., 33(1):53\u201371, 2022.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"4","key":"9441_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"A. Blum, A. Kalai, H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM, 50(4):506\u2013519, 2003.","journal-title":"J. ACM"},{"key":"9441_CR10","doi-asserted-by":"crossref","unstructured":"J.W. Bos, L.\u00a0Ducas, E.\u00a0Kiltz, T.\u00a0Lepoint, V.\u00a0Lyubashevsky, J.M. Schanck, P.\u00a0Schwabe, G.\u00a0Seiler, D.\u00a0Stehl\u00e9. CRYSTALS - kyber: A cca-secure module-lattice-based KEM. In EuroS &P (IEEE, 2018), pp. 353\u2013367","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"9441_CR11","unstructured":"K.\u00a0Boudgoust. Theoretical hardness of algebraically structured learning with errors, 2021. https:\/\/katinkabou.github.io\/Documents\/Thesis_Boudgoust_Final.pdf"},{"key":"9441_CR12","doi-asserted-by":"crossref","unstructured":"K.\u00a0Boudgoust, C.\u00a0Jeudy, A.\u00a0Roux-Langlois, W.\u00a0Wen. Towards classical hardness of module-lwe: The linear rank case. In ASIACRYPT (2), volume 12492 of Lecture Notes in Computer Science (Springer, 2020) pp. 289\u2013317","DOI":"10.1007\/978-3-030-64834-3_10"},{"key":"9441_CR13","doi-asserted-by":"crossref","unstructured":"K.\u00a0Boudgoust, C.\u00a0Jeudy, A.\u00a0Roux-Langlois, W.\u00a0Wen. On the hardness of module-lwe with binary secret. In CT-RSA, volume 12704 of Lecture Notes in Computer Science (Springer, 2021), pp. 503\u2013526","DOI":"10.1007\/978-3-030-75539-3_21"},{"key":"9441_CR14","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, N.\u00a0D\u00f6ttling. Hardness of LWE on general entropic distributions. In EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science (Springer, 2020) pp. 551\u2013575","DOI":"10.1007\/978-3-030-45724-2_19"},{"key":"9441_CR15","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, N.\u00a0D\u00f6ttling. Lossiness and entropic hardness for ring-lwe. In TCC (1), volume 12550 of Lecture Notes in Computer Science (Springer, 2020) pp. 1\u201327","DOI":"10.1007\/978-3-030-64375-1_1"},{"key":"9441_CR16","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, C.\u00a0Gentry, V.\u00a0Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In ITCS (ACM, 2012) pp. 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"9441_CR17","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, A.\u00a0Langlois, C.\u00a0Peikert, O.\u00a0Regev, D.\u00a0Stehl\u00e9. Classical hardness of learning with errors. In STOC (ACM, 2013) pp. 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"issue":"1","key":"9441_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"L.\u00a0Ducas, E.\u00a0Kiltz, T.\u00a0Lepoint, V.\u00a0Lyubashevsky, P.\u00a0Schwabe, G.\u00a0Seiler, and D.\u00a0Stehl\u00e9. Crystals-dilithium: A lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(1):238\u2013268, 2018.","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"9441_CR19","doi-asserted-by":"crossref","unstructured":"L.\u00a0Ducas, D.\u00a0Micciancio. FHEW: bootstrapping homomorphic encryption in less than a second. In EUROCRYPT (1), volume 9056 of Lecture Notes in Computer Science (Springer, 2015) pp. 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"9441_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, C.\u00a0Peikert, and V.\u00a0Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC (ACM, 2008) pp. 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"9441_CR21","unstructured":"S.\u00a0Goldwasser, Y.\u00a0Tauman Kalai, C.\u00a0Peikert, V.\u00a0Vaikuntanathan. Robustness of the learning with errors assumption. In ICS (Tsinghua University Press, 2010) pp. 230\u2013240"},{"key":"9441_CR22","doi-asserted-by":"crossref","unstructured":"R.\u00a0Impagliazzo, D.\u00a0Zuckerman. How to recycle random bits. In FOCS (IEEE Computer Society, 1989) pp. 248\u2013253","DOI":"10.1109\/SFCS.1989.63486"},{"key":"9441_CR23","doi-asserted-by":"crossref","unstructured":"P.\u00a0Kirchner, P.-A. Fouque. An improved BKW algorithm for LWE with applications to cryptography and lattices. In CRYPTO (1), volume 9215 of Lecture Notes in Computer Science (Springer, 2015) pp. 43\u201362","DOI":"10.1007\/978-3-662-47989-6_3"},{"issue":"3","key":"9441_CR24","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"A.\u00a0Langlois and D.\u00a0Stehl\u00e9. Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr., 75(3):565\u2013599, 2015.","journal-title":"Des. Codes Cryptogr."},{"key":"9441_CR25","doi-asserted-by":"crossref","unstructured":"A.\u00a0Langlois, D.\u00a0Stehl\u00e9, R.\u00a0Steinfeld. Gghlite: more efficient multilinear maps from ideal lattices. In EUROCRYPT, volume 8441 of Lecture Notes in Computer Science (Springer, 2014) pp. 239\u2013256","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"9441_CR26","unstructured":"H.\u00a0Lin, Y.\u00a0Wang, M.\u00a0Wang. Hardness of module-lwe and ring-lwe on general entropic distributions. IACR Cryptol. ePrint Arch. 2020 p. 1238"},{"key":"9441_CR27","doi-asserted-by":"crossref","unstructured":"R. Lindner, C. Peikert. Better key sizes (and attacks) for lwe-based encryption. In CT-RSA, volume 6558 of Lecture Notes in Computer Science (Springer, 2011) pp. 319\u2013339","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"9441_CR28","doi-asserted-by":"crossref","unstructured":"M. Liu, P.Q. Nguyen. Solving BDD by enumeration: an update. In CT-RSA, volume 7779 of Lecture Notes in Computer Science (Springer, 2013) pp. 293\u2013309","DOI":"10.1007\/978-3-642-36095-4_19"},{"key":"9441_CR29","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky. Lattice signatures without trapdoors. In EUROCRYPT, volume 7237 of Lecture Notes in Computer Science (Springer, 2012) pp. 738\u2013755)","DOI":"10.1007\/978-3-642-29011-4_43"},{"issue":"6","key":"9441_CR30","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, and O.\u00a0Regev. On ideal lattices and learning with errors over rings. J. ACM, 60(6):43:1\u201343:35, 2013.","journal-title":"J. ACM"},{"key":"9441_CR31","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, O.\u00a0Regev. A toolkit for ring-lwe cryptography. In EUROCRYPT, volume 7881 of Lecture Notes in Computer Science (Springer, 2013) pp. 35\u201354","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"9441_CR32","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, G.\u00a0Seiler. Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In EUROCRYPT (1), volume 10820 of Lecture Notes in Computer Science (Springer, 2018) pp. 204\u2013224","DOI":"10.1007\/978-3-319-78381-9_8"},{"key":"9441_CR33","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, N.K. Nguyen, G. Seiler. Shorter lattice-based zero-knowledge proofs via one-time commitments. In Public Key Cryptography (1), volume 12710 of Lecture Notes in Computer Science (Springer, 2021) pp. 215\u2013241","DOI":"10.1007\/978-3-030-75245-3_9"},{"issue":"4","key":"9441_CR34","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"D.\u00a0Micciancio. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex., 16(4):365\u2013411, 2007.","journal-title":"Comput. Complex."},{"issue":"1","key":"9441_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a013","volume":"14","author":"D Micciancio","year":"2018","unstructured":"D.\u00a0Micciancio. On the hardness of learning with errors with binary secrets. Theory Comput., 14(1):1\u201317, 2018.","journal-title":"Theory Comput."},{"key":"9441_CR36","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, P.\u00a0Mol. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In CRYPTO, volume 6841 of Lecture Notes in Computer Science (Springer, 2011) pp. 465\u2013484","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"9441_CR37","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, C.\u00a0Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In EUROCRYPT, volume 7237 of Lecture Notes in Computer Science (Springer, 2012) pp. 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"9441_CR38","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, C.\u00a0Peikert. Hardness of SIS and LWE with small parameters. In CRYPTO (1), volume 8042 of Lecture Notes in Computer Science (Springer, 2013) pp. 21\u201339","DOI":"10.1007\/978-3-642-40041-4_2"},{"issue":"1","key":"9441_CR39","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"D.\u00a0Micciancio and O.\u00a0Regev. Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput., 37(1):267\u2013302, 2007.","journal-title":"SIAM J. Comput."},{"key":"9441_CR40","unstructured":"NIST. Post-quantum cryptography standardization. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Post-Quantum-Cryptography-Standardization"},{"issue":"2","key":"9441_CR41","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s00037-008-0251-3","volume":"17","author":"C Peikert","year":"2008","unstructured":"C.\u00a0Peikert. Limits on the hardness of lattice problems in $${l}_{p}$$ norms. Comput. Complex., 17(2):300\u2013351, 2008.","journal-title":"Comput. Complex"},{"key":"9441_CR42","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In STOC (ACM, 2009) pp. 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"key":"9441_CR43","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert. An efficient and parallel gaussian sampler for lattices. In CRYPTO, volume 6223 of Lecture Notes in Computer Science (Springer, 2010) pp. 80\u201397","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"9441_CR44","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert, Z.\u00a0Pepin. Algebraically structured lwe, revisited. In TCC (1), volume 11891 of Lecture Notes in Computer Science (Springer, 2019) pp. 1\u201323","DOI":"10.1007\/978-3-030-36030-6_1"},{"key":"9441_CR45","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert, O.\u00a0Regev, N.\u00a0Stephens-Davidowitz. Pseudorandomness of ring-lwe for any ring and modulus. In STOC (ACM, 2017) pp. 461\u2013473","DOI":"10.1145\/3055399.3055489"},{"key":"9441_CR46","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC (ACM, 2005) pp. 84\u201393","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"9441_CR47","doi-asserted-by":"publisher","first-page":"34:1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6):341\u20133440, 2009.","journal-title":"J. ACM"},{"key":"9441_CR48","unstructured":"A.\u00a0R\u00e9nyi. On measures of entropy and information. In Proc. 4th Berkeley Sympos. Math. Statist. and Prob., Vol. I (Univ. California Press, Berkeley, Calif., 1961) pp. 547\u2013561"},{"key":"9441_CR49","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0024-3795(94)90184-8","volume":"202","author":"S Rjasanow","year":"1994","unstructured":"S.\u00a0Rjasanow. Effective algorithms with circulant-block matrices. Linear Algebra and its Applications, 202:55\u201369, 1994.","journal-title":"Linear Algebra Appl."},{"key":"9441_CR50","doi-asserted-by":"crossref","unstructured":"M.\u00a0Rosca, D.\u00a0Stehl\u00e9, A.\u00a0Wallet. On the ring-lwe and polynomial-lwe problems. In EUROCRYPT (1), volume 10820 of Lecture Notes in Computer Science (Springer, 2018) pp. 146\u2013173","DOI":"10.1007\/978-3-319-78381-9_6"},{"key":"9441_CR51","doi-asserted-by":"crossref","unstructured":"D.\u00a0Stehl\u00e9, R.\u00a0Steinfeld, K.\u00a0Tanaka, K.\u00a0Xagawa. Efficient public key encryption based on ideal lattices. In ASIACRYPT, volume 5912 of Lecture Notes in Computer Science (Springer, 2009) pp. 617\u2013635","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"9441_CR52","doi-asserted-by":"crossref","unstructured":"C. Sun, M. Tibouchi, M. Abe. Revisiting the hardness of binary error LWE. In ACISP, volume 12248 of Lecture Notes in Computer Science (Springer, 2020) pp. 425\u2013444","DOI":"10.1007\/978-3-030-55304-3_22"},{"issue":"7","key":"9441_CR53","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"T.\u00a0van Erven and P.\u00a0Harremo\u00ebs. R\u00e9nyi divergence and kullback-leibler divergence. IEEE Trans. Inf. Theory, 60(7):3797\u20133820, 2014.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9441_CR54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006","volume-title":"Introduction to the non-asymptotic analysis of random matrices","author":"R Vershynin","year":"2012","unstructured":"Roman Vershynin. Introduction to the non-asymptotic analysis of random matrices, Cambridge University Press, Cambridge , 2012"},{"key":"9441_CR55","doi-asserted-by":"crossref","unstructured":"D.A. Wagner. A generalized birthday problem. In CRYPTO, volume 2442 of Lecture Notes in Computer Science (Springer, 2002) pp. 288\u2013303","DOI":"10.1007\/3-540-45708-9_19"},{"key":"9441_CR56","unstructured":"Y.\u00a0Wang, M.\u00a0Wang. Module-lwe versus ring-lwe, revisited. IACR Cryptol. ePrint Arch. 2019. Version dated from Aug. 18th 2019. p. 930"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09441-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09441-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09441-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T23:03:23Z","timestamp":1674601403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09441-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["9441"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09441-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"31 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1"}}