{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T03:13:35Z","timestamp":1785554015998,"version":"3.56.0"},"reference-count":52,"publisher":"American Association for the Advancement of Science (AAAS)","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC12226006"],"award-info":[{"award-number":["NSFC12226006"]}],"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":["NSFC11921001"],"award-info":[{"award-number":["NSFC11921001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["spj.science.org"],"crossmark-restriction":true},"short-container-title":["Research"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>In 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, a Canadian company D-Wave demonstrated the first quantum computer. These events and quick further developments have brought a crisis to secret communication. In 2022, the National Institute of Standards and Technology (NIST) announced 4 candidates\u2014CRYSTALS-Kyber, CRYSTALS-Dilithium, Falcon, and Sphincs+\u2014for post-quantum cryptography standards. The first 3 are based on lattice theory and the last on Hash functions. In 2024, NIST announced 3 standards: FIPS 203 based on CRYSTALS-Kyber, FIPS 204 based on CRYSTALS-Dilithium, and FIPS 205 based on Sphincs+. The fourth standard based on Falcon is on the way. It is well known that the security of the lattice-based cryptosystems relies on the hardness of the shortest vector problem (SVP), the closest vector problem (CVP), and their generalizations. In fact, the SVP is a ball packing problem and the CVP is a ball covering problem. Furthermore, both SVP and CVP are equivalent to arithmetic problems for positive definite quadratic forms. There are several books and survey papers dealing with the computational complexity of the lattice-based cryptography for classical computers. However, there is no review article to demonstrate the mathematical foundation of the complexity theory. This paper will briefly introduce post-quantum cryptography and demonstrate its mathematical roots in ball packing, ball covering, and positive definite quadratic forms.<\/jats:p>","DOI":"10.34133\/research.0801","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T05:11:13Z","timestamp":1751951473000},"update-policy":"https:\/\/doi.org\/10.34133\/aaas_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["The Mathematical Foundation of Post-Quantum Cryptography"],"prefix":"10.34133","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1063-5918","authenticated-orcid":true,"given":"Chuanming","family":"Zong","sequence":"first","affiliation":[{"name":"Center for Applied Mathematics, \rTianjin University, Tianjin 300072, China."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"221","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"issue":"6","key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie W","year":"1976","unstructured":"Diffie W, Hellman ME. New directions in cryptography. IEEE Trans Inform Theory. 1976;22(6):644\u2013654.","journal-title":"IEEE Trans Inform Theory"},{"issue":"2","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest RL","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM. 1978;21(2):120\u2013126.","journal-title":"Commun ACM"},{"key":"e_1_3_2_4_2","unstructured":"Goldwasser S. Mathematical foundations of modern cryptography: Computational complexity perspective. Beijing: Proc. ICM. Higher Education Press; 2002. p. 245\u2013272."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Hoffstein J Pipher J Silverman JH. An introduction to mathematical cryptography. New York: Springer-Verlag; 2008.","DOI":"10.1007\/978-0-387-77993-5_6"},{"issue":"4","key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal T","year":"1985","unstructured":"ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inform Theory. 1985;31(4):469\u2013472.","journal-title":"IEEE Trans Inform Theory"},{"key":"e_1_3_2_7_2","first-page":"417","article-title":"Use of elliptic curves in cryptography. Advances in cryptology. Santa Barbara","volume":"218","author":"Miller VS","year":"1986","unstructured":"Miller VS. Use of elliptic curves in cryptography. Advances in cryptology. Santa Barbara. LNCS. 1986;218:417\u2013426.","journal-title":"LNCS"},{"issue":"177","key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz N","year":"1987","unstructured":"Koblitz N. Elliptic curve cryptosystems. Math Comput. 1987;48(177):203\u2013209.","journal-title":"Math Comput"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Ajtai M Dwork C. A public-key cryptosystem with worst-case\/average-case equivalence. Paper presented at: Proceedings of the 29th Annual ACM Symposium on Theory of Computing; 1997; El Paso TX USA.","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Goldreich O Goldwasser S Halevi S. Public-key cryptosystems from lattice reduction problems. In: Kaliski BS editor. Advances in Cryptology\u2014CRYPTO \u201997. CRYPTO 1997. Lecture Notes in Computer Science vol 1294. Berlin Heidelberg: Springer Berlin Heidelberg; 1997. p. 112\u2013131.","DOI":"10.1007\/BFb0052231"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0054868","article-title":"NTRU: A ring-based public key cryptosystem","volume":"1423","author":"Hoffstein J","year":"1998","unstructured":"Hoffstein J, Pipher J, Silverman JH. NTRU: A ring-based public key cryptosystem. Algorithmic Number Theory LNCS. 1998;1423:267\u2013288.","journal-title":"Algorithmic Number Theory LNCS"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices learning with errors random linear codes and cryptography. In: Proceedings of the 37th ACM Symposium on Theory of Computing. New York (NY): ACM Press; 2005. p. 84\u201393.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the ACM International Symposium on Theory of Computing. New York (NY): ACM Press; 2009. p. 169\u2013178.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Micciancio D Goldwasser S. Complexity of lattice problems: A cryptographic perspective. Boston: Kluwer Academic; 2002.","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"e_1_3_2_15_2","unstructured":"Zong C. Sphere packings. New York: Springer-Verlag; 1999."},{"issue":"4","key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1561\/0400000074","article-title":"A decade of lattice cryptography","volume":"10","author":"Peikert C","year":"2014","unstructured":"Peikert C. A decade of lattice cryptography. Found Trends Theor Comput Sci. 2014;10(4):283\u2013424.","journal-title":"Found Trends Theor Comput Sci"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Baaquie BE Kwek LC. Quantum computers: Theory and algorithms. Singapore: Springer; 2023.","DOI":"10.1007\/978-981-19-7517-2"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Landsberg JM. Quantum computation and quantum information. Providence: AMS; 2024.","DOI":"10.1090\/gsm\/243"},{"issue":"1907","key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1098\/rspa.1992.0167","article-title":"Rapid solution of problems by quantum computation","volume":"439","author":"Deutsch D","year":"1992","unstructured":"Deutsch D, Jozsa R. Rapid solution of problems by quantum computation. Proc R Soc London Ser A. 1992;439(1907):553\u2013558.","journal-title":"Proc R Soc London Ser A"},{"key":"e_1_3_2_20_2","unstructured":"Shor PW. Algorithms for quantum computation: Discrete logarithms and factoring. Paper presented at: 35th Annual Symposium on Foundations of Computer Science; 1994; Los Alamitos CA USA."},{"key":"e_1_3_2_21_2","first-page":"317","article-title":"Shor\u2019s discrete logarithm quantum algorithm for elliptic curves","volume":"3","author":"Proos J","year":"2003","unstructured":"Proos J, Zalka C. Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inform Comput. 2003;3:317\u2013344.","journal-title":"Quantum Inform Comput"},{"issue":"1","key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3708471","article-title":"An efficient quantum factoring algorithm","volume":"72","author":"Regev O","year":"2025","unstructured":"Regev O. An efficient quantum factoring algorithm. J ACM. 2025;72(1):1\u20133.","journal-title":"J ACM"},{"key":"e_1_3_2_23_2","unstructured":"Alvarado M Gayler L Seals A Wang T Hou T. A survey on post-quantum cryptography: State-of-the-art and challenges. arXiv. 2023. https:\/\/doi.org\/10.48550\/arXiv.2312.10430"},{"issue":"11","key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"4648","DOI":"10.1109\/TCSI.2021.3106639","article-title":"Instruction-set accelerated implementation of CRYSTALS-Kyber","volume":"68","author":"Bisheh-Niasar M","year":"2021","unstructured":"Bisheh-Niasar M, Azarderakhsh R, Mozaffari-Kermani M. Instruction-set accelerated implementation of CRYSTALS-Kyber. IEEE Trans Circuits Syst I Regular Papers. 2021;68(11):4648\u20134659.","journal-title":"IEEE Trans Circuits Syst I Regular Papers"},{"key":"e_1_3_2_25_2","unstructured":"Canto AC Kaur J Mozaffari-Kermani M Azarderakhsh R. Algorithmic security is insufficient: A comprehensive survey on implementation attacks haunting post-quantum security. arXiv. 2023. https:\/\/doi.org\/10.48550\/arXiv.2305.13544"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Sanal P Karagoz E Seo H Azarderakhsh R Mozaffari-Kermani M. Kyber on ARM64: Compact implementations of Kyber on 64-bit ARM cortex-a processors. In: Security and privacy in communication networks. Switzerland: Springer; 2021. p. 424\u2013440.","DOI":"10.1007\/978-3-030-90022-9_23"},{"key":"e_1_3_2_27_2","unstructured":"Micciancio D Regev O. Lattice-based cryptography. In: Post-quantum cryptography. Berlin: Springer-Verlag; 2009."},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1007\/s11401-023-0053-6","article-title":"Lattice-based cryptography: A survey","volume":"44","author":"Wang X","year":"2023","unstructured":"Wang X, Xu G, Yu Y. Lattice-based cryptography: A survey. Chin Ann Math Ser B. 2023;44:945\u2013960.","journal-title":"Chin Ann Math Ser B"},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Zhang J Zhang Z. Lattice-based cryptosystems: a design perspective. Singapore: Springer-Verlag; 2020.","DOI":"10.1007\/978-981-15-8427-5"},{"issue":"3","key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1112\/jlms\/jdr032","article-title":"On the distribution of angles between the N shortest vectors in a random lattice","volume":"84","author":"S\u00f6dergren A","year":"2011","unstructured":"S\u00f6dergren A. On the distribution of angles between the N shortest vectors in a random lattice. J Lond Math Soc. 2011;84(3):749\u2013764.","journal-title":"J Lond Math Soc"},{"key":"e_1_3_2_31_2","unstructured":"van Emde Boas P. Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report. Math. Institute: University of Amsterdam; 1981. p. 81\u201304."},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Ajtai M. The shortest vector problem in L2 is NP-hard for randomized reductions. Paper presented at: Proceedings of the 30th Annual ACM Symposium on Theory of Computing; 1998; Dallas TX USA.","DOI":"10.1145\/276698.276705"},{"issue":"5","key":"e_1_3_2_33_2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1145\/1089023.1089027","article-title":"Hardness of approximating the shortest vector problem in lattices","volume":"52","author":"Khot S","year":"2005","unstructured":"Khot S. Hardness of approximating the shortest vector problem in lattices. J ACM. 2005;52(5):789\u2013808.","journal-title":"J ACM"},{"key":"e_1_3_2_34_2","first-page":"1","article-title":"Generating hard instances of lattice problems","volume":"13","author":"Ajtai M","year":"2004","unstructured":"Ajtai M. Generating hard instances of lattice problems. Quad Mat. 2004;13:1\u201332.","journal-title":"Quad Mat"},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00493-003-0019-y","article-title":"Approximating CVP to within almost-polynomial factors is NP-hard","volume":"23","author":"Dinur I","year":"2003","unstructured":"Dinur I, Kindler G, Raz R, Safra S. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica. 2003;23:205\u2013243.","journal-title":"Combinatorica"},{"issue":"2","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0020-0190(99)00083-6","article-title":"Approximating shortest lattice vectors is not harder than approximating closest lattice vectors","volume":"71","author":"Goldreich O","year":"1999","unstructured":"Goldreich O, Micciancio D, Safra S, Seifert JP. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf Process Lett. 1999;71(2):55\u201361.","journal-title":"Inf Process Lett"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1597036.1597050","article-title":"Low-dimensional lattice basis reduction revisited","volume":"5","author":"Nguyen PO","year":"2009","unstructured":"Nguyen PO, Stehl\u00e9 D. Low-dimensional lattice basis reduction revisited. ACM Trans Algorithms. 2009;5:1\u201348.","journal-title":"ACM Trans Algorithms"},{"issue":"4","key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra AK","year":"1982","unstructured":"Lenstra AK, Lenstra HW Jr, Lov\u00e1sz L. Factoring polynomials with rational coefficients. Math Ann. 1982;261(4):515\u2013534.","journal-title":"Math Ann"},{"issue":"1","key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","article-title":"On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem","volume":"6","author":"Babai L","year":"1986","unstructured":"Babai L. On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica. 1986;6(1):1\u201313.","journal-title":"Combinatorica"},{"issue":"2","key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","article-title":"A hierarchy of polynomial time lattice basis reduction algorithms","volume":"53","author":"Schnorr CP","year":"1987","unstructured":"Schnorr CP. A hierarchy of polynomial time lattice basis reduction algorithms. Theor Comput Sci. 1987;53(2-3):201\u2013224.","journal-title":"Theor Comput Sci"},{"issue":"4","key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1134\/S1990478923040087","article-title":"Post-quantum cryptosystems: Open problems and solutions. Lattice-based cryptosystems","volume":"17","author":"Malygina ES","year":"2023","unstructured":"Malygina ES, Kutsenko AV, Novoselov SA, Kolesnikov NS, Bakharev AO, Khilchuk IS, Shaporenko AS, Tokareva NN. Post-quantum cryptosystems: Open problems and solutions. Lattice-based cryptosystems. J Appl Ind Math. 2023;17(4):767\u2013790.","journal-title":"J Appl Ind Math"},{"issue":"2","key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/22M1486959","article-title":"Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding","volume":"54","author":"Aggarwal D","year":"2025","unstructured":"Aggarwal D, Chen Y, Kumar R, Shen Y. Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding. SIAM J Comput. 2025;54(2):233\u2013278.","journal-title":"SIAM J Comput"},{"issue":"3","key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.4007\/annals.2017.185.3.8","article-title":"The sphere packing problem in dimension 24","volume":"185","author":"Cohn H","year":"2017","unstructured":"Cohn H, Kumar A, Miller SD, Radchenko D, Viazovska M. The sphere packing problem in dimension 24. Ann Math. 2017;185(3):1017\u20131033.","journal-title":"Ann Math"},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"991","DOI":"10.4007\/annals.2017.185.3.7","article-title":"The sphere packing problem in dimension 8","volume":"185","author":"Viazovska M","year":"2017","unstructured":"Viazovska M. The sphere packing problem in dimension 8. Ann Math. 2017;185:991\u20131015.","journal-title":"Ann Math"},{"key":"e_1_3_2_45_2","unstructured":"Klartag B. Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid. arXiv. 2025. https:\/\/doi.org\/10.48550\/arXiv.2504.05042"},{"issue":"1","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/jams\/984","article-title":"New bounds on the density of lattice coverings","volume":"35","author":"Ordentlich O","year":"2022","unstructured":"Ordentlich O, Regev O, Weiss B. New bounds on the density of lattice coverings. J Am Math Soc. 2022;35(1):295\u2013308.","journal-title":"J Am Math Soc"},{"key":"e_1_3_2_47_2","unstructured":"Rogers CA. Packing and covering. Cambridge: Cambridge University Press; 1964."},{"issue":"1","key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/S0097539703433511","article-title":"Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor","volume":"34","author":"Micciancio D","year":"2004","unstructured":"Micciancio D. Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor. SIAM J Comput. 2004;34(1):118\u2013169.","journal-title":"SIAM J Comput"},{"key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971436","article-title":"Covering minima and lattice-point-free convex bodies","volume":"128","author":"Kannan R","year":"1988","unstructured":"Kannan R, Lov\u00e1sz L. Covering minima and lattice-point-free convex bodies. Ann Math. 1988;128:577\u2013602.","journal-title":"Ann Math"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1090\/S0273-0979-02-00950-3","article-title":"From deep holes to free planes","volume":"39","author":"Zong C","year":"2002","unstructured":"Zong C. From deep holes to free planes. Bull Amer Math Soc. 2002;39:533\u2013555.","journal-title":"Bull Amer Math Soc"},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Zong C. Some mathematical mysteries in lattices (abstract of a plenary talk). ASIACRYPT 2012. LNCS. 2012;7658:2\u20133.","DOI":"10.1007\/978-3-642-34961-4_2"},{"issue":"3","key":"e_1_3_2_52_2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1112\/jlms\/s1-28.3.309","article-title":"On positive definite quadratic forms","volume":"28","author":"Rankin RA","year":"1953","unstructured":"Rankin RA. On positive definite quadratic forms. J Lond Math Soc. 1953;28(3):309\u2013314.","journal-title":"J Lond Math Soc"},{"issue":"7","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1090\/noti1546","article-title":"Post-quantum cryptography\u2014A new opportunity and challenge for the mathematical community","volume":"64","author":"Ding J","year":"2017","unstructured":"Ding J, Smith-Tone D. Post-quantum cryptography\u2014A new opportunity and challenge for the mathematical community. Not Am Math Soc. 2017;64(7):709\u2013710.","journal-title":"Not Am Math Soc"}],"container-title":["Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/spj.science.org\/doi\/pdf\/10.34133\/research.0801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T20:34:57Z","timestamp":1756240497000},"score":1,"resource":{"primary":{"URL":"https:\/\/spj.science.org\/doi\/10.34133\/research.0801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":52,"alternative-id":["10.34133\/research.0801"],"URL":"https:\/\/doi.org\/10.34133\/research.0801","relation":{},"ISSN":["2639-5274"],"issn-type":[{"value":"2639-5274","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2025-06-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-26","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"0801"}}