{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T12:30:08Z","timestamp":1782217808996,"version":"3.54.5"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper introduces Geometric-\n                    <jats:italic>k<\/jats:italic>\n                    -means (or\n                    <jats:inline-formula>\n                      <jats:tex-math>$${\\mathsf{G}}k$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -means for short), a novel approach that significantly enhances the efficiency and energy economy of the widely utilized\n                    <jats:italic>k<\/jats:italic>\n                    -means algorithm, which, despite its inception over five decades ago, remains a cornerstone in machine learning applications. The essence of\n                    <jats:inline-formula>\n                      <jats:tex-math>$${\\mathsf{G}}k$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -means lies in its active utilization of geometric principles, specifically scalar projection, to significantly accelerate the algorithm without sacrificing solution quality. This geometric strategy enables a more discerning focus on data points that are most likely to influence cluster updates, which we call as high expressive data (HE). In contrast, low expressive data (LE), does not impact clustering outcome, is effectively bypassed, leading to considerable reductions in computational overhead. Experiments spanning synthetic, real-world and high-dimensional datasets, demonstrate\n                    <jats:inline-formula>\n                      <jats:tex-math>$${\\mathsf{G}}k$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -means is significantly better than traditional and state of the art (SOTA)\n                    <jats:inline-formula>\n                      <jats:tex-math>$$k$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -means variants in runtime and distance computations (DC). Moreover,\n                    <jats:inline-formula>\n                      <jats:tex-math>$${\\mathsf{G}}k$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -means exhibits better resource efficiency, as evidenced by its reduced energy footprint, placing it as more sustainable alternative. The software code and data for our algorithm is available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/parichit\/Geometric-k-means\" ext-link-type=\"uri\">https:\/\/github.com\/parichit\/Geometric-k-means<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1007\/s10994-025-06891-1","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:33:23Z","timestamp":1769524403000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric-k-means: a bound free approach to fast and eco-friendly k-means"],"prefix":"10.1007","volume":"115","author":[{"given":"Parichit","family":"Sharma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Malec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hasan","family":"Kurban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oguzhan","family":"Kulekci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehmet","family":"Dalkilic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,27]]},"reference":[{"key":"6891_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., & Keim, D.A. (2001). On the surprising behavior of distance metrics in high dimensional space. In Database Theory\u2014ICDT 2001: 8th International Conference London, UK, January 4\u20136, 2001 Proceedings 8, Springer, (pp. 420\u2013434).","DOI":"10.1007\/3-540-44503-X_27"},{"issue":"8","key":"6891_CR2","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.3390\/electronics9081295","volume":"9","author":"M Ahmed","year":"2020","unstructured":"Ahmed, M., Seraj, R., & Islam, S. M. S. (2020). The k-means algorithm: a comprehensive survey and performance evaluation. Electronics, 9(8), 1295.","journal-title":"Electronics"},{"issue":"1","key":"6891_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41596-020-00409-w","volume":"16","author":"TS Andrews","year":"2021","unstructured":"Andrews, T. S., Kiselev, V. Y., McCarthy, D., et al. (2021). Tutorial: guidelines for the computational analysis of single-cell RNA sequencing data. Nature Protocols, 16(1), 1\u20139.","journal-title":"Nature Protocols"},{"key":"6891_CR4","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). K-means++: The advantages of careful seeding. Society for Industrial and Applied Mathematics, USA, SODA \u201907, (p 1027\u20131035)."},{"key":"6891_CR5","doi-asserted-by":"publisher","unstructured":"Bachem, O., Lucic, M., & Hassani, S.H., et\u00a0al. (2016). Approximate k-means++ in sublinear time. Proceedings of the AAAI Conference on Artificial Intelligence 30(1). https:\/\/doi.org\/10.1609\/aaai.v30i1.10259, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/10259.","DOI":"10.1609\/aaai.v30i1.10259"},{"key":"6891_CR6","unstructured":"Bradley, P.S., & Fayyad, U.M. (1998). Refining initial points for k-means clustering. Morgan Kaufmann, (pp. 91\u201399)."},{"key":"6891_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, I., Huang, Y., & Chen, J., et\u00a0al. (2009). Pearson correlation coefficient. Noise reduction in speech processing (pp. 1\u20134).","DOI":"10.1007\/978-3-642-00296-0_5"},{"key":"6891_CR8","doi-asserted-by":"crossref","unstructured":"Curtin, R.R. (2017). A dual-tree algorithm for fast k-means clustering with large k. In Proceedings of the 2017 SIAM International Conference on Data Mining, SIAM, (pp. 300\u2013308).","DOI":"10.1137\/1.9781611974973.34"},{"key":"6891_CR9","doi-asserted-by":"crossref","unstructured":"Deng, C.H., & Zhao, W. (2018). Fast k-means based on k-nn graph. 2018 IEEE 34th International Conference on Data Engineering (ICDE) (pp. 1220\u20131223).","DOI":"10.1109\/ICDE.2018.00115"},{"issue":"3","key":"6891_CR10","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.cell.2018.05.061","volume":"174","author":"D Van Dijk","year":"2018","unstructured":"Van Dijk, D., Sharma, R., Nainys, J., et al. (2018). Recovering gene interactions from single-cell data using data diffusion. Cell, 174(3), 716\u2013729.","journal-title":"Cell"},{"key":"6891_CR11","unstructured":"Drake, J. (2013). Faster k-means clustering. PhD thesis."},{"key":"6891_CR12","unstructured":"Elkan, C. (2003). Using the triangle inequality to accelerate k-means. In Proceedings of the Twentieth International Conference on International Conference on Machine Learning. AAAI Press, ICML\u201903, (p. 147\u2013153)."},{"key":"6891_CR13","first-page":"768","volume":"21","author":"EW Forgy","year":"1965","unstructured":"Forgy, E. W. (1965). Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21, 768\u2013769.","journal-title":"Biometrics"},{"key":"6891_CR14","unstructured":"Forster, D., & L\u00fccke, J. (2018). Can clustering scale sublinearly with its clusters? a variational EM acceleration of GMMs and k-means. In Storkey, A., Perez-Cruz, F. (eds) Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol\u00a084. PMLR, (pp. 124\u2013132), https:\/\/proceedings.mlr.press\/v84\/forster18a.html."},{"key":"6891_CR15","doi-asserted-by":"publisher","unstructured":"Fr\u00e4nti, P., & Sieranoja, S. (2019). How much can k-means be improved by using better initialization and repeats? Pattern Recognition 93, 95\u2013112. https:\/\/doi.org\/10.1016\/j.patcog.2019.04.014https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0031320319301608","DOI":"10.1016\/j.patcog.2019.04.014"},{"key":"6891_CR16","doi-asserted-by":"crossref","unstructured":"Hamerly, G. (2010). Making k-means even faster. In Proceedings of the 2010 SIAM international conference on data mining, SIAM, (pp. 130\u2013140).","DOI":"10.1137\/1.9781611972801.12"},{"key":"6891_CR17","unstructured":"Hinneburg, A., Aggarwal, C.C., & Keim, D.A. (2000). What is the nearest neighbor in high dimensional spaces? In 26th Internat. Conference on Very Large Databases, (pp. 506\u2013515)."},{"issue":"12","key":"6891_CR18","doi-asserted-by":"publisher","first-page":"9787","DOI":"10.1109\/TPAMI.2021.3133763","volume":"44","author":"F Hirschberger","year":"2022","unstructured":"Hirschberger, F., Forster, D., & L\u00fccke, J. (2022). A variational EM acceleration for efficient clustering at very large scales. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(12), 9787\u20139801. https:\/\/doi.org\/10.1109\/TPAMI.2021.3133763","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6891_CR19","doi-asserted-by":"crossref","unstructured":"Hu, Q., Wu, J., & Bai, L., et\u00a0al. (2017). Fast k-means for large scale clustering. Proceedings of the 2017 ACM on Conference on Information and Knowledge Management.","DOI":"10.1145\/3132847.3133091"},{"key":"6891_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193\u2013218.","journal-title":"Journal of Classification"},{"key":"6891_CR21","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun, A. M., Ezugwu, A. E., Abualigah, L., et al. (2023). K-means clustering algorithms: a comprehensive review, variants analysis, and advances in the era of big data. Information Sciences, 622, 178\u2013210.","journal-title":"Information Sciences"},{"issue":"8","key":"6891_CR22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A. K. (2010). Data clustering: 50 years beyond k-means. Pattern Recognition Letters, 31(8), 651\u2013666.","journal-title":"Pattern Recognition Letters"},{"key":"6891_CR23","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D. M., Netanyahu, N. S., et al. (2002). An efficient k-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 881\u2013892.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"6891_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3177754","volume":"3","author":"KN Khan","year":"2018","unstructured":"Khan, K. N., Hirki, M., Niemi, T., et al. (2018). RAPL in action: Experiences in using RAPL for power measurements. ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), 3(2), 1\u201326.","journal-title":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)"},{"issue":"5","key":"6891_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1038\/s41576-018-0088-9","volume":"20","author":"VY Kiselev","year":"2019","unstructured":"Kiselev, V. Y., Andrews, T. S., & Hemberg, M. (2019). Challenges in unsupervised clustering of single-cell RNA-seq data. Nature Reviews Genetics, 20(5), 273\u2013282.","journal-title":"Nature Reviews Genetics"},{"issue":"2","key":"6891_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s41060-017-0062-1","volume":"4","author":"H Kurban","year":"2017","unstructured":"Kurban, H., Jenne, M., & Dalkilic, M. (2017). Using data to build a better EM: EM* for big data. International Journal of Data Science and Analytics, 4(2), 83\u201397.","journal-title":"International Journal of Data Science and Analytics"},{"key":"6891_CR27","doi-asserted-by":"publisher","unstructured":"Kurban, H., & Dalkilic, M.M. (2017). A novel approach to optimization of iterative machine learning algorithms: Over heap structure. In 2017 IEEE International Conference on Big Data (Big Data), (pp. 102\u2013109), https:\/\/doi.org\/10.1109\/BigData.2017.8257917.","DOI":"10.1109\/BigData.2017.8257917"},{"key":"6891_CR28","unstructured":"Kurban, H., Sharma, P., & Dalkilic, M. (2021). Data expressiveness and its use in data-centric AI. Data Centric AI Workshop, 35th Conference on Neural Information Processing Systems (NeurIPS 2021), Sydney, Australia, https:\/\/datacentricai.org\/papers\/145_CameraReady_Poster_DCAI_DataExpressiveness_2021.pdf."},{"issue":"2","key":"6891_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Transactions on Information Theory"},{"key":"6891_CR30","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. vol\u00a01. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, (pp. 281\u2013297)."},{"key":"6891_CR31","unstructured":"Moore, A.W. (2000). The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In UAI."},{"key":"6891_CR32","unstructured":"Newling, J., & Fleuret, F. (2016). Fast k-means with accurate bounds. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48. JMLR.org, ICML\u201916, (p. 936\u2013944)."},{"key":"6891_CR33","doi-asserted-by":"crossref","unstructured":"Pelleg, D., & Moore, A. (1999). Accelerating exact k-means algorithms with geometric reasoning. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, (pp. 277\u2013281).","DOI":"10.1145\/312129.312248"},{"key":"6891_CR34","unstructured":"Philbin, J., & of\u00a0Oxford, U. (2010). Scalable Object Retrieval in Very Large Image Collections. Oxford University, https:\/\/books.google.com\/books?id=mjsJxQEACAAJ."},{"key":"6891_CR35","doi-asserted-by":"publisher","unstructured":"Philbin, J., Chum, O., & Isard, M., et\u00a0al. (2007). Object retrieval with large vocabularies and fast spatial matching. In 2007 IEEE Conference on Computer Vision and Pattern Recognition, (pp. 1\u20138), https:\/\/doi.org\/10.1109\/CVPR.2007.383172.","DOI":"10.1109\/CVPR.2007.383172"},{"key":"6891_CR36","doi-asserted-by":"crossref","unstructured":"Phillips, S.J. (2002). Acceleration of k-means and related clustering algorithms. In Workshop on Algorithm Engineering and Experimentation, Springer, (pp. 166\u2013177).","DOI":"10.1007\/3-540-45643-0_13"},{"issue":"8","key":"6891_CR37","first-page":"18","volume":"15","author":"R Rosenthal","year":"1986","unstructured":"Rosenthal, R. (1986). Meta-analytic procedures for social science research sage publications: Beverly hills, 1984, 148 pp. Educational Researcher, 15(8), 18\u201320.","journal-title":"Educational Researcher"},{"key":"6891_CR38","doi-asserted-by":"crossref","unstructured":"Ry\u0161av\u1ef3, P., & Hamerly, G. (2016). Geometric methods to accelerate k-means algorithms. In Proceedings of the 2016 SIAM International Conference on Data Mining, SIAM, (pp 324\u2013332).","DOI":"10.1137\/1.9781611974348.37"},{"issue":"7727","key":"6891_CR39","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s41586-018-0590-4","volume":"562","author":"N Schaum","year":"2018","unstructured":"Schaum, N., Karkanias, J., Neff, N. F., et al. (2018). Single-cell transcriptomics of 20 mouse organs creates a Tabula Muris: The Tabula Muris consortium. Nature, 562(7727), 367.","journal-title":"Nature"},{"issue":"12","key":"6891_CR40","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3381831","volume":"63","author":"R Schwartz","year":"2020","unstructured":"Schwartz, R., Dodge, J., Smith, N. A., et al. (2020). Green AI. Communications of the ACM, 63(12), 54\u201363.","journal-title":"Communications of the ACM"},{"key":"6891_CR41","doi-asserted-by":"crossref","unstructured":"Scully, D. (2010). Web-scale k-means clustering. In Proceedings of the 19th international conference on World wide web, ACM","DOI":"10.1145\/1772690.1772862"},{"key":"6891_CR42","doi-asserted-by":"publisher","unstructured":"Sharma, P., Kurban, H., & Dalkilic, M. (2022). Dcem: an r package for clustering big data via data-centric modification of expectation maximization. SoftwareX, 17, Article 100944. https:\/\/doi.org\/10.1016\/j.softx.2021.100944https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352711021001771","DOI":"10.1016\/j.softx.2021.100944"},{"key":"6891_CR100","doi-asserted-by":"publisher","unstructured":"Sharma, P., Mishra, S., Kurban, H., & Dalkilic, M. (2025). p-clustval: A novel p-adic approach for enhanced clustering of high-dimensional single-cell RNASeq data. International Journal of Data Science and Analytics. https:\/\/doi.org\/10.1007\/s41060-024-00709-4","DOI":"10.1007\/s41060-024-00709-4"},{"issue":"3","key":"6891_CR43","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/nrg3833","volume":"16","author":"O Stegle","year":"2015","unstructured":"Stegle, O., Teichmann, S. A., & Marioni, J. C. (2015). Computational and analytical challenges in single-cell transcriptomics. Nature Reviews Genetics, 16(3), 133\u2013145.","journal-title":"Nature Reviews Genetics"},{"key":"6891_CR44","doi-asserted-by":"crossref","unstructured":"Strubell, E., Ganesh, A., & McCallum, A. (2019). Energy and policy considerations for deep learning in NLP. Preprint at arXiv:1906.02243.","DOI":"10.18653\/v1\/P19-1355"},{"issue":"4","key":"6891_CR45","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1038\/nprot.2017.149","volume":"13","author":"V Svensson","year":"2018","unstructured":"Svensson, V., Vento-Tormo, R., & Teichmann, S. A. (2018). Exponential scaling of single-cell RNA-seq in the past decade. Nature Protocols, 13(4), 599\u2013604.","journal-title":"Nature Protocols"},{"key":"6891_CR46","doi-asserted-by":"crossref","unstructured":"Temim, S., Talbi, L., & Bensebaa, F. (2023) Analysis and multiobjective optimization of a machine learning algorithm for wireless telecommunication. In Telecom, MDPI, (pp. 219\u2013235)","DOI":"10.3390\/telecom4020013"},{"key":"6891_CR47","doi-asserted-by":"publisher","unstructured":"Wang, J., Wang, J., & Ke, Q., et\u00a0al. (2012). Fast approximate k-means via cluster closures. In 2012 IEEE Conference on Computer Vision and Pattern Recognition, (pp. 3037\u20133044), https:\/\/doi.org\/10.1109\/CVPR.2012.6248034.","DOI":"10.1109\/CVPR.2012.6248034"},{"key":"6891_CR48","unstructured":"Wu, X., Brazzle, P., & Cahoon, S. (2023). Performance and energy consumption of parallel machine learning algorithms. Preprint at arXiv:2305.00798."},{"issue":"1","key":"6891_CR49","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/TPAMI.2020.3008694","volume":"44","author":"S Xia","year":"2022","unstructured":"Xia, S., Peng, D., Meng, D., et al. (2022). Ball $$k$$-means: Fast adaptive clustering with no bounds. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(1), 87\u201399. https:\/\/doi.org\/10.1109\/TPAMI.2020.3008694","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6891_CR50","doi-asserted-by":"crossref","unstructured":"Xia, S., Peng, D., & Meng, D., et\u00a0al. (2020). A fast adaptive k-means with no bounds. IEEE Transactions on Pattern Analysis and Machine Intelligence.","DOI":"10.1109\/TPAMI.2020.3008694"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06891-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06891-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06891-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:43:20Z","timestamp":1776797000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06891-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,27]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["6891"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06891-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,27]]},"assertion":[{"value":"4 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing financial or non-financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors give their consent for the publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"30"}}