{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:56:32Z","timestamp":1779900992839,"version":"3.53.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902149"],"award-info":[{"award-number":["61902149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62001300"],"award-info":[{"award-number":["62001300"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032009"],"award-info":[{"award-number":["62032009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10623-023-01321-6","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:01:51Z","timestamp":1700157711000},"page":"917-939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Lattice codes for lattice-based PKE"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5005-5056","authenticated-orcid":false,"given":"Shanxiang","family":"Lyu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Ling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junzuo","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"1321_CR1","doi-asserted-by":"crossref","unstructured":"Alagic G., Apon D., Cooper D., Dang Q., Dang T., Kelsey J., Lichtinger J., Miller C., Moody D., Peralta R., Perlner R., Robinson A., Smith-Tone D., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. US Department of Commerce, NIST (2022).","DOI":"10.6028\/NIST.IR.8413"},{"key":"1321_CR2","unstructured":"Alkim E., Ducas L., P\u00f6ppelmann T., Schwabe P.: Newhope without reconciliation. IACR Cryptol. ePrint Arch. (2016)."},{"key":"1321_CR3","first-page":"327","volume-title":"25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA","author":"E Alkim","year":"2016","unstructured":"Alkim E., Ducas L., P\u00f6ppelmann T., Schwabe P.: Post-quantum key exchange\u2014a new hope. In: Holz T., Savage S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, pp. 327\u2013343. USENIX Association, Berkeley (2016)."},{"key":"1321_CR4","unstructured":"Annex on FrodoKEM Updates, April 18, 2023 Version (PDF). https:\/\/frodokem.org\/files\/FrodoKEM-annex-20230418.pdf."},{"issue":"7","key":"1321_CR5","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051\u20133073 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2021379.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR6","doi-asserted-by":"publisher","unstructured":"Bos J.W., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schanck J.M., Schwabe P., Seiler G., Stehl\u00e9 D.: CRYSTALS\u2014Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, EuroS &P 2018, London, UK, pp. 353\u2013367. IEEE, New York (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032.","DOI":"10.1109\/EuroSP.2018.00032"},{"issue":"2","key":"1321_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/18.485720","volume":"42","author":"J Boutros","year":"1996","unstructured":"Boutros J., Viterbo E., Rastello C., Belfiore J.: Good lattice constellations for both Rayleigh fading and Gaussian channels. IEEE Trans. Inf. Theory 42(2), 502\u2013518 (1996). https:\/\/doi.org\/10.1109\/18.485720.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR8","unstructured":"BSI-Technical Guideline: cryptographic mechanisms: recommendations and key lengths. BSI TR-02102-1 (2021)."},{"key":"1321_CR9","unstructured":"Classical, quantum, and plausible (conservative) quantum cost estimates. https:\/\/github.com\/lwe-frodo\/parameter-selection\/blob\/master\/pqsec.py."},{"issue":"3","key":"1321_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.4007\/annals.2017.185.3.8","volume":"185","author":"H Cohn","year":"2017","unstructured":"Cohn H., Kumar A., Miller S., Radchenko D., Viazovska M.: The sphere packing problem in dimension 24. Ann. Math. 185(3), 1017\u20131033 (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.8.","journal-title":"Ann. Math."},{"issue":"2","key":"1321_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TIT.1982.1056484","volume":"28","author":"JH Conway","year":"1982","unstructured":"Conway J.H., Sloane N.J.A.: Fast quantizing and decoding and algorithms for lattice quantizers and codes. IEEE Trans. Inf. Theory 28(2), 227\u2013231 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056484.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"JH Conway","year":"1999","unstructured":"Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn Springer, New York (1999).","edition":"3"},{"key":"1321_CR13","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1999","unstructured":"Cover T.M.: Elements of Information Theory. Wiley, Hoboken (1999)."},{"key":"1321_CR14","unstructured":"D\u2019Anvers J., Vercauteren F., Verbauwhede I.: On the impact of decryption failures on the security of LWE\/LWR based schemes. IACR Cryptol. ePrint Arch. (2018)."},{"key":"1321_CR15","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers J., Tiepelt M., Vercauteren F., Verbauwhede I.: Timing attacks on error correcting codes in post-quantum schemes. In: Bilgin B., Petkova-Nikova S., Rijmen V. (eds.) Proceedings of ACM Workshop on Theory of Implementation Security, CCS 2019, London, UK, pp. 2\u20139. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3338467.3358948.","DOI":"10.1145\/3338467.3358948"},{"key":"1321_CR16","unstructured":"Ding J.: A simple provably secure key exchange scheme based on the learning with errors problem. IACR Cryptol. ePrint Arch. (2012)."},{"issue":"10","key":"1321_CR17","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","volume":"50","author":"U Erez","year":"2004","unstructured":"Erez U., Zamir R.: Achieving 1\/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding. IEEE Trans. Inf. Theory 50(10), 2293\u20132314 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.834787.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1321_CR18","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/18.21245","volume":"34","author":"GD Forney","year":"1988","unstructured":"Forney G.D.: Coset codes-I: introduction and geometrical classification. IEEE Trans. Inf. Theory 34(5), 1123\u20131151 (1988). https:\/\/doi.org\/10.1109\/18.21245.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1321_CR19","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/18.21246","volume":"34","author":"GD Forney","year":"1988","unstructured":"Forney G.D.: Coset codes-II: binary lattices and related codes. IEEE Trans. Inf. Theory 34(5), 1152\u20131187 (1988). https:\/\/doi.org\/10.1109\/18.21246.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR20","doi-asserted-by":"publisher","unstructured":"Fritzmann T., P\u00f6ppelmann T., Sep\u00falveda J.: Analysis of error-correcting codes for lattice-based key exchange. In: Selected Areas in Cryptography\u2014SAC 2018\u201425th International Conference, Calgary, AB, Canada. Lecture Notes in Computer Science, vol. 11349, pp. 369\u2013390. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_17.","DOI":"10.1007\/978-3-030-10970-7_17"},{"key":"1321_CR21","doi-asserted-by":"publisher","unstructured":"Fujisaki E., Okamoto T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener M.J. (ed.) Advances in Cryptology\u2014CRYPTO \u201999, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15\u201319, 1999, Proceedings. Lecture Notes in Computer Science, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34.","DOI":"10.1007\/3-540-48405-1_34"},{"issue":"2","key":"1321_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-016-0151-x","volume":"26","author":"E Grigorescu","year":"2017","unstructured":"Grigorescu E., Peikert C.: List-decoding Barnes-Wall lattices. Comput. Complex. 26(2), 365\u2013392 (2017). https:\/\/doi.org\/10.1007\/s00037-016-0151-x.","journal-title":"Comput. Complex."},{"key":"1321_CR23","doi-asserted-by":"publisher","unstructured":"Hanrot G., Pujol X., Stehl\u00e9 D.: Algorithms for the shortest and closest lattice vector problems. In: Chee Y.M., Guo Z., Ling S., Shao F., Tang Y., Wang H., Xing C. (eds.) Coding and Cryptology\u2014Third International Workshop, IWCC 2011, Qingdao, China. Lecture Notes in Computer Science, vol. 6639, pp. 159\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_10.","DOI":"10.1007\/978-3-642-20901-7_10"},{"key":"1321_CR24","doi-asserted-by":"publisher","unstructured":"Hofheinz D., H\u00f6velmanns K., Kiltz E.: A modular analysis of the fujisaki-okamoto transformation. In: Kalai Y., Reyzin L. (eds.) Theory of Cryptography\u201415th International Conference, TCC 2017, Baltimore, MD, USA, November 12\u201315, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10677, pp. 341\u2013371. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12.","DOI":"10.1007\/978-3-319-70500-2_12"},{"issue":"6","key":"1321_CR25","doi-asserted-by":"publisher","first-page":"3829","DOI":"10.1109\/TIT.2022.3148586","volume":"68","author":"Z Jin","year":"2022","unstructured":"Jin Z., Shen S., Zhao Y.: Compact and flexible KEM from ideal lattice. IEEE Trans. Inf. Theory 68(6), 3829\u20133840 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3148586.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR26","doi-asserted-by":"publisher","unstructured":"Kawachi A., Tanaka K., Xagawa K.: Multi-bit cryptosystems based on lattice problems. In: Okamoto T., Wang X. (eds.) Public Key Cryptography\u2014PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China. Lecture Notes in Computer Science, vol. 4450, pp. 315\u2013329. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_21.","DOI":"10.1007\/978-3-540-71677-8_21"},{"issue":"2","key":"1321_CR27","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1109\/TCOMM.2018.2876113","volume":"67","author":"L Liu","year":"2019","unstructured":"Liu L., Yan Y., Ling C., Wu X.: Construction of capacity-achieving lattice codes: polar lattices. IEEE Trans. Commun. 67(2), 915\u2013928 (2019). https:\/\/doi.org\/10.1109\/TCOMM.2018.2876113.","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"1321_CR28","doi-asserted-by":"publisher","first-page":"6140","DOI":"10.1109\/TIT.2021.3097965","volume":"67","author":"L Liu","year":"2021","unstructured":"Liu L., Shi J., Ling C.: Polar lattices for lossy compression. IEEE Trans. Inf. Theory 67(9), 6140\u20136163 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3097965.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR29","unstructured":"Lu X., Liu Y., Zhang Z., Jia D., Xue H., He J., Li B.: LAC: practical ring-LWE based public-key encryption with byte-level modulus. IACR Cryptol. ePrint Arch. (2018)."},{"key":"1321_CR30","doi-asserted-by":"publisher","unstructured":"Micciancio D., Nicolosi A.: Efficient bounded distance decoders for Barnes-Wall lattices. In: Kschischang F.R., Yang E. (eds.) 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, pp. 2484\u20132488. IEEE, New York (2008). https:\/\/doi.org\/10.1109\/ISIT.2008.4595438.","DOI":"10.1109\/ISIT.2008.4595438"},{"key":"1321_CR31","unstructured":"Naehrig M., Alkim E., Bos J., Ducas L., Easterbrook K., LaMacchia B., Longa P., Mironov I., Nikolaenko V., Peikert C., et al.: Frodokem. Technical Report, National Institute of Standards and Technology (2017)."},{"issue":"4","key":"1321_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016). https:\/\/doi.org\/10.1561\/0400000074.","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1321_CR33","doi-asserted-by":"publisher","unstructured":"Prest T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: Takagi T., Peyrin T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2017\u201423rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China. Lecture Notes in Computer Science, vol. 10624, pp. 347\u2013374. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13.","DOI":"10.1007\/978-3-319-70694-8_13"},{"key":"1321_CR34","doi-asserted-by":"publisher","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), Baltimore, MD, USA, pp. 84\u201393. ACM, New York (2005). https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"1321_CR35","doi-asserted-by":"publisher","unstructured":"Saarinen M.O.: HILA5: on reliability, reconciliation, and error correction for ring-LWE encryption. In: Adams C., Camenisch J. (eds.) Selected Areas in Cryptography\u2014SAC 2017\u201424th International Conference, Ottawa, ON, Canada. Lecture Notes in Computer Science, vol. 10719, pp. 192\u2013212. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_10.","DOI":"10.1007\/978-3-319-72565-9_10"},{"key":"1321_CR36","doi-asserted-by":"publisher","unstructured":"Saliba C., Luzzi L., Ling C.: Error correction for FrodoKEM using the Gosset lattice. In: International Zurich Seminar on Information and Communication (IZS 2022), Zurich, Switzerland. ETH, Zurich (2022). https:\/\/doi.org\/10.3929\/ethz-b-000535279.","DOI":"10.3929\/ethz-b-000535279"},{"issue":"11","key":"1321_CR37","doi-asserted-by":"publisher","first-page":"3918","DOI":"10.1109\/TIT.2005.856937","volume":"51","author":"AJ Salomon","year":"2005","unstructured":"Salomon A.J., Amrani O.: Augmented product codes and lattices: Reed\u2013Muller codes and Barnes-Wall lattices. IEEE Trans. Inf. Theory 51(11), 3918\u20133930 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.856937.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1321_CR38","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-006-9028-3","volume":"42","author":"AJ Salomon","year":"2007","unstructured":"Salomon A.J., Amrani O.: Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over GF(2$${}^{\\text{ q }}$$). Des. Codes Cryptogr. 42(2), 167\u2013180 (2007). https:\/\/doi.org\/10.1007\/s10623-006-9028-3.","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"1321_CR39","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172.","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1321_CR40","doi-asserted-by":"publisher","first-page":"3246","DOI":"10.1109\/TIT.2018.2883119","volume":"65","author":"PRB Silva","year":"2019","unstructured":"Silva P.R.B., Silva D.: Multilevel LDPC lattices with efficient encoding and decoding and a generalization of Construction D. IEEE Trans. Inf. Theory 65(5), 3246\u20133260 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2883119.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR41","doi-asserted-by":"publisher","first-page":"28177","DOI":"10.1109\/ACCESS.2021.3052867","volume":"9","author":"VA Thakor","year":"2021","unstructured":"Thakor V.A., Razzaque M.A., Khandaker M.R.A.: Lightweight cryptography algorithms for resource-constrained IoT devices: a review, comparison and research opportunities. IEEE Access 9, 28177\u201328193 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3052867.","journal-title":"IEEE Access"},{"issue":"1","key":"1321_CR42","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TIT.1982.1056454","volume":"28","author":"G Ungerboeck","year":"1982","unstructured":"Ungerboeck G.: Channel coding with multilevel\/phase signals. IEEE Trans. Inf. Theory 28(1), 55\u201366 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056454.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1321_CR43","unstructured":"van Poppelen A.: Cryptographic decoding of the Leech lattice. IACR Cryptol. ePrint Arch. (2016)."},{"key":"1321_CR44","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.3.7","author":"MS Viazovska","year":"2017","unstructured":"Viazovska M.S.: The sphere packing problem in dimension 8. Ann. Math. (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.7.","journal-title":"Ann. Math."},{"key":"1321_CR45","unstructured":"Voulgaris P.: Algorithms for the closest and shortest vector problems on general lattices. PhD thesis, University of California, San Diego, USA (2011). http:\/\/www.escholarship.org\/uc\/item\/4zt7x45z."},{"issue":"8","key":"1321_CR46","doi-asserted-by":"publisher","first-page":"938","DOI":"10.3390\/e23080938","volume":"23","author":"J Wang","year":"2021","unstructured":"Wang J., Ling C.: How to construct polar codes for ring-LWE-based public key encryption. Entropy 23(8), 938 (2021). https:\/\/doi.org\/10.3390\/e23080938.","journal-title":"Entropy"},{"key":"1321_CR47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139045520","volume-title":"Lattice Coding for Signals and Networks","author":"R Zamir","year":"2014","unstructured":"Zamir R.: Lattice Coding for Signals and Networks. Cambridge University Press, Cambridge (2014)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01321-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01321-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01321-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:08:12Z","timestamp":1713290892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01321-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1321"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01321-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,16]]},"assertion":[{"value":"11 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}