{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:52:31Z","timestamp":1781502751634,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2022-138906NB-C22"],"award-info":[{"award-number":["PID2022-138906NB-C22"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"publisher","award":["GACUJIMA\/2024\/03"],"award-info":[{"award-number":["GACUJIMA\/2024\/03"]}],"id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"publisher","award":["PREDOC\/2020\/39"],"award-info":[{"award-number":["PREDOC\/2020\/39"]}],"id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We introduce homothetic-BCH codes. These are a family of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$q^2$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mi>q<\/mml:mi>\n                            <mml:mn>2<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -ary classical codes\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {C}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    of length\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\lambda n_1$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>\u03bb<\/mml:mi>\n                            <mml:msub>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , where\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\lambda $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>\u03bb<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n_1$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mn>1<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    are suitable positive integers such that the punctured code\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {B}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>B<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {C}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    in the last\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\lambda n_1 -n_1$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>\u03bb<\/mml:mi>\n                            <mml:msub>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>-<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    coordinates is a narrow-sense BCH code of length\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n_1$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mn>1<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . We prove that whenever\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {B}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>B<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is Hermitian self-orthogonal, so is\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {C}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . As a consequence, we present a procedure to obtain quantum stabilizer codes with lengths that cannot be reached by BCH codes. With this procedure, we get new quantum codes according to Grassl\u2019s table (Grassl 2025). To prove our results, we give necessary and sufficient conditions for Hermitian self-orthogonality of BCH codes of a wide range of lengths.\n                  <\/jats:p>","DOI":"10.1007\/s40314-025-03570-8","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T07:40:27Z","timestamp":1766043627000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New quantum codes from homothetic-BCH codes"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3908-4462","authenticated-orcid":false,"given":"C.","family":"Galindo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-2152","authenticated-orcid":false,"given":"F.","family":"Hernando","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6379-6902","authenticated-orcid":false,"given":"H.","family":"Mart\u00edn-Cruz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"issue":"3","key":"3570_CR1","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/TIT.2006.890730","volume":"53","author":"SA Aly","year":"2007","unstructured":"Aly SA, Klappenecker A, Sarvepalli PK (2007) On quantum and classical BCH codes. IEEE Trans Inf Theory 53(3):1183\u20131188","journal-title":"IEEE Trans Inf Theory"},{"key":"3570_CR2","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1109\/TIT.2024.3373550","volume":"70","author":"SE Anderson","year":"2024","unstructured":"Anderson SE et al (2024) Relative hulls and quantum codes. IEEE Trans Inform Theory 70:3190\u20133201","journal-title":"IEEE Trans Inform Theory"},{"key":"3570_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute F et al (2019) Quantum supremacy using a programmable superconducting processor. Nature 574:505\u2013510","journal-title":"Nature"},{"key":"3570_CR4","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/18.959288","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin A, Knill E (2001) Non-binary quantum stabilizer codes. IEEE Trans Inf Theory 47:3065\u20133072","journal-title":"IEEE Trans Inf Theory"},{"issue":"7838","key":"3570_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1038\/d41586-020-03434-7","volume":"588","author":"P Ball","year":"2020","unstructured":"Ball P (2020) Physicists in China challenge Google\u2019s \u2018quantum advantage\u2019. Nature 588(7838):380","journal-title":"Nature"},{"issue":"2","key":"3570_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1013808515797","volume":"25","author":"J Bierbrauer","year":"2002","unstructured":"Bierbrauer J (2002) The theory of cyclic codes and a generalization to additive codes. Des Codes Cryptogr 25(2):189\u2013206","journal-title":"Des Codes Cryptogr"},{"key":"3570_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T","volume":"8","author":"J Bierbrauer","year":"2000","unstructured":"Bierbrauer J, Edel Y (2000) Quantum twisted codes J Comb Designs 8:174\u2013188","journal-title":"Quantum twisted codes J Comb Designs"},{"issue":"3\u20134","key":"3570_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W, Cannon J, Playoust C (1997) The Magma algebra system I: The user language. J Symbolic Comput 24(3\u20134):235\u2013265","journal-title":"J Symbolic Comput"},{"key":"3570_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1103\/PhysRevLett.78.405","volume":"76","author":"AR Calderbank","year":"1997","unstructured":"Calderbank AR, Rains EM, Shor PW, Sloane NJA (1997) Quantum error correction and orthogonal geometry. Phys Rev Lett 76:405\u2013409","journal-title":"Phys Rev Lett"},{"issue":"4","key":"3570_CR10","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank AR, Rains EM, Shor PW, Sloane NJA (1998) Quantum error correction via codes over $${\\rm GF}(4)$$. IEEE Trans Inf Theory 44(4):1369\u20131387","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"3570_CR11","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TIT.2018.2867873","volume":"65","author":"I Cascudo","year":"2019","unstructured":"Cascudo I (2019) On squares of cyclic codes. IEEE Trans Inf Theory 65(2):1034\u20131047","journal-title":"IEEE Trans Inf Theory"},{"key":"3570_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10623-014-0016-8","volume":"76","author":"C Galindo","year":"2015","unstructured":"Galindo C, Hernando F (2015) Quantum codes from affine variety codes and their subfield subcodes. Des Codes Cryptogr 76:89\u2013100","journal-title":"Des Codes Cryptogr"},{"issue":"4","key":"3570_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11128-017-1559-1","volume":"16","author":"C Galindo","year":"2017","unstructured":"Galindo C, Geil O, Hernando F, Ruano D (2017) On the distance of stabilizer quantum codes from $$J$$-affine variety codes. Quantum Inf. Process. 16(4):111","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"3570_CR14","doi-asserted-by":"publisher","first-page":"2593","DOI":"10.1109\/TIT.2018.2868442","volume":"65","author":"C Galindo","year":"2019","unstructured":"Galindo C, Hernando F, Ruano D (2019) Classical and quantum evaluation codes at the trace roots. IEEE Trans Inf Theory 65(4):2593\u20132602","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"3570_CR15","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1103\/PhysRevA.54.1862","volume":"54","author":"D Gottesman","year":"1996","unstructured":"Gottesman D (1996) Class of quantum error-correcting codes saturating the quantum Hamming bound. Phys Rev A 54(3):1862\u20131868","journal-title":"Phys Rev A"},{"key":"3570_CR16","unstructured":"Grassl M (2025) Bounds on the minimum distance of linear codes. www.codetables.de, accessed on 22\/02\/2025"},{"key":"3570_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s10773-014-2204-8","volume":"54","author":"X Hu","year":"2015","unstructured":"Hu X, Zhang G, Chen B (2015) Constructions of new nonbinary quantum codes. Int J Theor Phys 54:92\u201399","journal-title":"Int J Theor Phys"},{"issue":"9","key":"3570_CR18","doi-asserted-by":"publisher","first-page":"4735","DOI":"10.1109\/TIT.2010.2054174","volume":"56","author":"L Jin","year":"2010","unstructured":"Jin L, Ling S, Luo J, Xing C (2010) Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes. IEEE Trans Inform Theory 56(9):4735\u20134740","journal-title":"IEEE Trans Inform Theory"},{"key":"3570_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.012326","volume":"88","author":"X Kai","year":"2013","unstructured":"Kai X, Zhu S, Tang Y (2013) Quantum negacyclic codes. Phys. Rev. A 88:012326","journal-title":"Phys. Rev. A"},{"issue":"11","key":"3570_CR20","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2006","unstructured":"Ketkar A, Klappenecker A, Kumar S, Sarvepalli PK (2006) Nonbinary stabilizer codes over finite fields. IEEE Trans Inf Theory 52(11):4892\u20134914","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"3570_CR21","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/TIT.2014.2298137","volume":"60","author":"GG La Guardia","year":"2014","unstructured":"La Guardia GG (2014) On the construction of nonbinary quantum BCH codes. IEEE Trans Inf Theory 60(3):1528\u20131535","journal-title":"IEEE Trans Inf Theory"},{"key":"3570_CR22","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s12095-021-00543-6","volume":"14","author":"F Li","year":"2022","unstructured":"Li F (2022) The Hermitian dual-containing LCD BCH codes and related quantum codes. Cryptogr Commun 14:579\u2013596","journal-title":"Cryptogr Commun"},{"issue":"2","key":"3570_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/LCOMM.2020.3032731","volume":"25","author":"F Li","year":"2021","unstructured":"Li F, Sun X (2021) The Hermitian dual containing non-primitive BCH codes. IEEE Commun Lett 25(2):379\u2013382","journal-title":"IEEE Commun Lett"},{"issue":"3","key":"3570_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.132.030601","volume":"132","author":"Y Liu","year":"2024","unstructured":"Liu Y et al (2024) Verifying quantum advantage experiments with multiple amplitude tensor network contraction. Phys. Rev. Lett. 132(3):030601","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"3570_CR25","doi-asserted-by":"publisher","first-page":"1350006","DOI":"10.1142\/S0219749913500068","volume":"11","author":"Y Liu","year":"2013","unstructured":"Liu Y, Ma Y, Feng Y, Li R (2013) New quantum codes constructed from a class of imprimitive BCH codes. Int J Quantum Inf 11(1):1350006","journal-title":"Int J Quantum Inf"},{"issue":"3","key":"3570_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s11128-017-1533-y","volume":"16","author":"Y Liu","year":"2017","unstructured":"Liu Y, Li R, Lv L, Ma Y (2017) A class of constacyclic BCH codes and new quantum codes. Quantum Inf. Process. 16(3):66","journal-title":"Quantum Inf. Process."},{"issue":"7","key":"3570_CR27","doi-asserted-by":"publisher","first-page":"1750052","DOI":"10.1142\/S0219749917500526","volume":"15","author":"Y Liu","year":"2017","unstructured":"Liu Y, Li R, L\u00fc L, Guo L (2017) New quantum codes derived from a family of antiprimitive BCH codes. Int J Quantum Inf 15(7):1750052","journal-title":"Int J Quantum Inf"},{"issue":"12","key":"3570_CR28","doi-asserted-by":"publisher","first-page":"7829","DOI":"10.1109\/TIT.2019.2932670","volume":"65","author":"Y Liu","year":"2019","unstructured":"Liu Y, Li R, Guo G, Wang J (2019) Some nonprimitive BCH codes and related quantum codes. IEEE Trans Inf Theory 65(12):7829\u20137839","journal-title":"IEEE Trans Inf Theory"},{"key":"3570_CR29","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s10773-017-3277-y","volume":"56","author":"J Qian","year":"2017","unstructured":"Qian J, Zhang L (2017) Improved constructions for nonbinary quantum BCH codes. Int J Theor Phys 56:1355\u20131363","journal-title":"Int J Theor Phys"},{"key":"3570_CR30","unstructured":"Quantum AI and Google Collaborators. Quantum error correction below the surface code threshold. Nature, (2024)"},{"key":"3570_CR31","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s10623-019-00610-3","volume":"87","author":"X Shi","year":"2019","unstructured":"Shi X, Yue Q, Wu Y (2019) The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes. Des Codes Cryptogr 87:2165\u20132183","journal-title":"Des Codes Cryptogr"},{"key":"3570_CR32","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In Proc. 35th Ann. Symp. Found. Comp. Sc., IEEE Comp. Soc. Press, pages 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"4","key":"3570_CR33","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor PW (1995) Scheme for reducing decoherence in quantum computer memory. Phys Rev A 52(4):2493\u20132496","journal-title":"Phys Rev A"},{"issue":"6","key":"3570_CR34","doi-asserted-by":"publisher","first-page":"712","DOI":"10.3390\/e23060712","volume":"23","author":"L Xing","year":"2021","unstructured":"Xing L, Li Z (2021) Some new quantum BCH codes over finite fields. Entropy 23(6):712","journal-title":"Entropy"},{"key":"3570_CR35","doi-asserted-by":"publisher","first-page":"4099","DOI":"10.1007\/s11128-016-1397-6","volume":"15","author":"G Xu","year":"2016","unstructured":"Xu G, Li R, Guo L, Ma Y (2016) New quantum codes constructed from quaternary BCH codes. Quantum Inf Process 15:4099\u20134116","journal-title":"Quantum Inf Process"},{"key":"3570_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10623-016-0296-2","volume":"85","author":"J Yuan","year":"2017","unstructured":"Yuan J, Zhu S, Kai X, Li P (2017) On the construction of quantum constacyclic codes. Des Codes Cryptogr 85:179\u2013190","journal-title":"Des Codes Cryptogr"},{"key":"3570_CR37","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s10773-020-04673-0","volume":"60","author":"H Zhang","year":"2021","unstructured":"Zhang H, Zhu S (2021) New quantum BCH codes of length $$n=r(q^2-1)$$. Int J Theor Phys 60:172\u2013184","journal-title":"Int J Theor Phys"},{"key":"3570_CR38","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1126\/science.abe8770","volume":"370","author":"HS Zhong","year":"2020","unstructured":"Zhong HS et al (2020) Quantum computational advantage using photons. Science 370:1460\u20131463","journal-title":"Science"},{"key":"3570_CR39","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1007\/s10623-017-0441-6","volume":"86","author":"S Zhu","year":"2018","unstructured":"Zhu S, Sun Z, Li P (2018) A class of negacyclic BCH codes and its application to quantum codes. Des Codes Cryptogr 86:2139\u20132165","journal-title":"Des Codes Cryptogr"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03570-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03570-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03570-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:02:59Z","timestamp":1781499779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03570-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3570"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03570-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"21 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"132"}}