{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T18:57:13Z","timestamp":1792868233805,"version":"4.5.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"vor","delay-in-days":9,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076159"],"award-info":[{"award-number":["62076159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"crossref","award":["2024JC-YBQN-0662"],"award-info":[{"award-number":["2024JC-YBQN-0662"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    DPC (density peaks clustering) algorithm has garnered widespread attention due to its novelty and superior performance. However, it is sensitive to the arbitrary\n                    <jats:italic>cutoff<\/jats:italic>\n                    distance, and its very efficient assignment strategy is prone to leading \u201cdomino effect\u201d. Although FKNN-DPC and other variants addressed DPC\u2019s limitations somewhat, the arbitrarily fixed number of neighbors to calculate the local density of a point will bring the bias, particularly for the dataset containing dense and sparse clusters simultaneously, resulting in the bias to cluster centers and that in the final clustering. To remedy these limitations, this paper proposes a novel Fuzzy Weighted Natural Nearest Neighbor based parameter-free Density Peak clustering algorithm named FWNNN-DPC. It proposes a novel local density of a point utilizing its natural nearest neighbors by assuming that there is at least one \u201ctrue friend\u201d for a point when its natural nearest neighborhood is empty. Furthermore, a novel divide-and-conquer assignment strategy is proposed, which assigns non-outliers and outliers to the most appropriate clusters utilizing natural nearest neighbors based shortest distance principle, and fuzzy weighted natural nearest neighbors based membership degree, respectively. Extensive experiments on benchmark datasets and the statistic test demonstrate that the proposed FWNNN-DPC outperforms DPC and its variants, and the typical clustering algorithms DBSCAN and K-means.\n                  <\/jats:p>","DOI":"10.1038\/s41598-025-34175-0","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T19:04:32Z","timestamp":1768935872000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fuzzy weighted natural nearest neighbor based density peak clustering"],"prefix":"10.1038","volume":"16","author":[{"given":"Mingzhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangzhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juanying","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"34175_CR1","volume-title":"Introduction to Data Mining","author":"P-N Tan","year":"2016","unstructured":"Tan, P.-N., Steinbach, M. & Kumar, V. Introduction to Data Mining (Pearson Education India, 2016)."},{"key":"34175_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1049\/cje.2021.03.001","volume":"30","author":"Z Gu","year":"2021","unstructured":"Gu, Z. et al. A multi-granularity density peak clustering algorithm based on variational mode decomposition. Chin. J. Electron.30, 658\u2013668. https:\/\/doi.org\/10.1049\/cje.2021.03.001 (2021).","journal-title":"Chin. J. Electron."},{"key":"34175_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","volume":"450","author":"R Liu","year":"2018","unstructured":"Liu, R., Wang, H. & Yu, X. Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inform. Sci.450, 200\u2013226. https:\/\/doi.org\/10.1016\/j.ins.2018.03.031 (2018).","journal-title":"Inform. Sci."},{"key":"34175_CR4","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1145\/3589335.3651534","volume":"517\u2013520","author":"R Liu","year":"2024","unstructured":"Liu, R., Liu, Y. & Liu, J. Llace: Locally linear contrastive embedding. Companion Proc. ACM Web Con.517\u2013520, 2024. https:\/\/doi.org\/10.1145\/3589335.3651534 (2024) ((Association for Computing Machinery, New York, NY, USA)).","journal-title":"Companion Proc. ACM Web Con."},{"key":"34175_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108123","volume":"240","author":"T Gao","year":"2022","unstructured":"Gao, T. et al. Adaptive density peaks clustering: Towards exploratory eeg analysis. Knowl.-Based Syst.240, 108123. https:\/\/doi.org\/10.1016\/j.knosys.2022.108123 (2022).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108513","volume":"244","author":"M Yan","year":"2022","unstructured":"Yan, M. et al. A lightweight weakly supervised learning segmentation algorithm for imbalanced image based on rotation density peaks. Knowl.-Based Syst.244, 108513. https:\/\/doi.org\/10.1016\/j.knosys.2022.108513 (2022).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2024.124584","volume":"377","author":"H Yang","year":"2025","unstructured":"Yang, H., Ran, M., Feng, H. & Hou, D. K-pcd: A new clustering algorithm for building energy consumption time series analysis and predicting model accuracy improvement. Appl. Energy377, 124584. https:\/\/doi.org\/10.1016\/j.apenergy.2024.124584 (2025).","journal-title":"Appl. Energy"},{"key":"34175_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2025.107206","volume":"185","author":"X Xie","year":"2025","unstructured":"Xie, X., Chen, W. & Kang, Z. Robust graph structure learning under heterophily. Neural Netw.185, 107206. https:\/\/doi.org\/10.1016\/j.neunet.2025.107206 (2025).","journal-title":"Neural Netw."},{"key":"34175_CR9","first-page":"21688","volume":"39","author":"X Xie","year":"2025","unstructured":"Xie, X. et al. One node one model: Featuring the missing-half for graph clustering. Proc. AAAI Conf. Artif. Intell.39, 21688\u201321696 (2025).","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"34175_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2025.112590","volume":"172","author":"H Hou","year":"2026","unstructured":"Hou, H. et al. A comprehensive survey of image clustering based on deep learning. Pattern Recognit.172, 112590. https:\/\/doi.org\/10.1016\/j.patcog.2025.112590 (2026).","journal-title":"Pattern Recognit."},{"key":"34175_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ijcce.2024.11.004","volume":"6","author":"A Petukhova","year":"2025","unstructured":"Petukhova, A., Matos-Carvalho, J. P. & Fachada, N. Text clustering with large language model embeddings. Int. J. Cognit. Comput. Eng.6, 100\u2013108. https:\/\/doi.org\/10.1016\/j.ijcce.2024.11.004 (2025).","journal-title":"Int. J. Cognit. Comput. Eng."},{"key":"34175_CR12","first-page":"281","volume":"1","author":"J MacQueen","year":"1967","unstructured":"MacQueen, J. Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Stat. Probability1, 281\u2013297 (1967).","journal-title":"Proc. Fifth Berkeley Symp. Math. Stat. Probability"},{"key":"34175_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R. & Livny, M. BIRCH: an efficient data clustering method for very large databases. ACM Sigmod Rec.25, 103\u2013114. https:\/\/doi.org\/10.1145\/235968.233324 (1996).","journal-title":"ACM Sigmod Rec."},{"key":"34175_CR14","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. A density-based algorithm for discovering clusters in large spatial databases with noise. KDD96, 226\u2013231 (1996).","journal-title":"KDD"},{"key":"34175_CR15","doi-asserted-by":"publisher","first-page":"3939","DOI":"10.1109\/TSMC.2019.2956527","volume":"51","author":"Y Chen","year":"2021","unstructured":"Chen, Y. et al. Knn-block dbscan: Fast clustering for large-scale data. IEEE Trans. Syst. Man Cybernetics Syst.51, 3939\u20133953. https:\/\/doi.org\/10.1109\/TSMC.2019.2956527 (2021).","journal-title":"IEEE Trans. Syst. Man Cybernetics Syst."},{"key":"34175_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s007780050009","volume":"8","author":"G Sheikholeslami","year":"2000","unstructured":"Sheikholeslami, G., Chatterjee, S. & Zhang, A. WaveCluster: A wavelet-based clustering approach for spatial data in very large databases. VLDB J.8, 289\u2013304. https:\/\/doi.org\/10.1007\/s007780050009 (2000).","journal-title":"VLDB J."},{"key":"34175_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102587","volume":"113","author":"R Zhang","year":"2025","unstructured":"Zhang, R. et al. Anchor-based fast spectral ensemble clustering. Inform. Fusion113, 102587. https:\/\/doi.org\/10.1016\/j.inffus.2024.102587 (2025).","journal-title":"Inform. Fusion"},{"key":"34175_CR18","doi-asserted-by":"publisher","first-page":"13177","DOI":"10.1109\/TNNLS.2024.3473618","volume":"36","author":"Z Kang","year":"2024","unstructured":"Kang, Z., Xie, X., Li, B. & Pan, E. Cdc: A simple framework for complex data clustering. IEEE Trans. Neural Netw. Learn. Syst.36, 13177\u201313188 (2024).","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"34175_CR19","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A. & Laio, A. Clustering by fast search and find of density peaks. Science344, 1492\u20131496. https:\/\/doi.org\/10.1126\/science.1242072 (2014).","journal-title":"Science"},{"key":"34175_CR20","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1360\/N112015-00135","volume":"46","author":"J Xie","year":"2016","unstructured":"Xie, J., Gao, H. & Xie, W. K-nearest neighbors optimized clustering algorithm by fast search and finding the density peaks of a datase. Scientia Sinica Informationis46, 258\u2013280. https:\/\/doi.org\/10.1360\/N112015-00135 (2016).","journal-title":"Scientia Sinica Informationis"},{"key":"34175_CR21","doi-asserted-by":"publisher","unstructured":"Xie, J. et al. Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors. Inform. Sci. 354, 19\u201340. https:\/\/doi.org\/10.1016\/j.ins.2016.03.011 (2016).","DOI":"10.1016\/j.ins.2016.03.011"},{"key":"34175_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119788","volume":"653","author":"J Xie","year":"2024","unstructured":"Xie, J., Liu, X. & Wang, M. SFKNN-DPC: Standard deviation weighted distance based density peak clustering algorithm. Inform. Sci.653, 119788. https:\/\/doi.org\/10.1016\/j.ins.2023.119788 (2024).","journal-title":"Inform. Sci."},{"key":"34175_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","volume":"99","author":"M Du","year":"2016","unstructured":"Du, M., Ding, S. & Jia, H. Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl.-Based Syst.99, 135\u2013145. https:\/\/doi.org\/10.1016\/j.knosys.2016.02.001 (2016).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109052","volume":"134","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., Dai, Y. & Wang, G. Density peaks clustering based on balance density and connectivity. Pattern Recognit.134, 109052. https:\/\/doi.org\/10.1016\/j.patcog.2022.109052 (2023).","journal-title":"Pattern Recognit."},{"key":"34175_CR25","doi-asserted-by":"crossref","unstructured":"Xie, J. & Jiang, W. An adaptive clustering algorithm by finding density peaks. In Pacific rim international conference on artificial intelligence, 317\u2013325 (Cham: Springer International Publishing, Cham, Switzerland, 2018).","DOI":"10.1007\/978-3-319-97310-4_36"},{"key":"34175_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108501","volume":"243","author":"W Guo","year":"2022","unstructured":"Guo, W. et al. Density peak clustering with connectivity estimation. Knowl.-Based Syst.243, 108501. https:\/\/doi.org\/10.1016\/j.knosys.2022.108501 (2022).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR27","doi-asserted-by":"publisher","first-page":"34301","DOI":"10.1109\/ACCESS.2019.2904254","volume":"7","author":"D Yu","year":"2019","unstructured":"Yu, D., Liu, G., Guo, M., Liu, X. & Yao, S. Density peaks clustering based on weighted local density sequence and nearest neighbor assignment. IEEE Access7, 34301\u201334317. https:\/\/doi.org\/10.1109\/ACCESS.2019.2904254 (2019).","journal-title":"IEEE Access"},{"key":"34175_CR28","doi-asserted-by":"crossref","unstructured":"Xie, J., Liu, X., Wang, M. & Zhang, W.S.D.W.-D.P.C. In An Advanced Clustering Algorithm by Searching Density Peaks using Standard Deviation Weighted Distance 131\u2013137 ((IEEE, Chengdu, China, 2022).","DOI":"10.1109\/CCIS57298.2022.10016309"},{"key":"34175_CR29","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.23919\/cje.2022.00.165","volume":"32","author":"C Zhang","year":"2023","unstructured":"Zhang, C., Xie, B. & Zhang, Y. Reverse-nearest-neighbor-based clustering by fast search and find of density peaks. Chin. J. Electron.32, 1341\u20131354. https:\/\/doi.org\/10.23919\/cje.2022.00.165 (2023).","journal-title":"Chin. J. Electron."},{"key":"34175_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111748","volume":"294","author":"H Yan","year":"2024","unstructured":"Yan, H., Wang, M. & Xie, J. ANN-DPC: Density peak clustering by finding the adaptive nearest neighbors. Knowl.-Based Syst.294, 111748. https:\/\/doi.org\/10.1016\/j.knosys.2024.111748 (2024).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2025.111953","volume":"170","author":"J Xie","year":"2026","unstructured":"Xie, J., Yan, H., Wang, M., Grant, P. W. & Pedrycz, W. Wann-dpc: Density peaks finding clustering based on weighted adaptive nearest neighbors. Pattern Recognit.170, 111953. https:\/\/doi.org\/10.1016\/j.patcog.2025.111953 (2026).","journal-title":"Pattern Recognit."},{"key":"34175_CR32","doi-asserted-by":"publisher","first-page":"13465","DOI":"10.1007\/s00521-020-04754-5","volume":"32","author":"Y Wang","year":"2020","unstructured":"Wang, Y. et al. McDPC: Multi-center density peak clustering. Neural Comput. Appl.32, 13465\u201313478. https:\/\/doi.org\/10.1007\/s00521-020-04754-5 (2020).","journal-title":"Neural Comput. Appl."},{"key":"34175_CR33","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.ins.2022.11.091","volume":"621","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Wang, D., Zhou, Y., Zhang, X. & Quek, C. VDPC: Variational density peak clustering algorithm. Inform. Sci.621, 627\u2013651. https:\/\/doi.org\/10.1016\/j.ins.2022.11.091 (2023).","journal-title":"Inform. Sci."},{"key":"34175_CR34","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TPAMI.2023.3327471","volume":"46","author":"J Tobin","year":"2023","unstructured":"Tobin, J. & Zhang, M. A theoretical analysis of density peaks clustering and the component-wise peak-finding algorithm. IEEE Trans. Pattern Anal. Mach. Intell.46, 1109\u20131120. https:\/\/doi.org\/10.1109\/TPAMI.2023.3327471 (2023).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"34175_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120685","volume":"672","author":"W Zhang","year":"2024","unstructured":"Zhang, W. et al. Density peaks clustering based on superior nodes and fuzzy correlation. Inform. Sci.672, 120685. https:\/\/doi.org\/10.1016\/j.ins.2024.120685 (2024).","journal-title":"Inform. Sci."},{"key":"34175_CR36","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.01.013","volume":"436","author":"Y-A Geng","year":"2018","unstructured":"Geng, Y.-A. et al. RECOME: A new density-based clustering algorithm using relative KNN kernel density. Inform. Sci.436, 13\u201330. https:\/\/doi.org\/10.1016\/j.ins.2018.01.013 (2018).","journal-title":"Inform. Sci."},{"key":"34175_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110458","volume":"152","author":"J Guan","year":"2024","unstructured":"Guan, J., Li, S., Zhu, J., He, X. & Chen, J. Fast main density peak clustering within relevant regions via a robust decision graph. Pattern Recognit.152, 110458. https:\/\/doi.org\/10.1016\/j.patcog.2024.110458 (2024).","journal-title":"Pattern Recognit."},{"key":"34175_CR38","doi-asserted-by":"publisher","first-page":"994","DOI":"10.4028\/www.scientific.net\/AMR.219-220.994","volume":"219","author":"X Zou","year":"2011","unstructured":"Zou, X., Zhu, Q. & Yang, R. Natural nearest neighbor for Isomap algorithm without free-parameter. Adv. Mater. Res.219, 994\u2013998. https:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.219-220.994 (2011).","journal-title":"Adv. Mater. Res."},{"key":"34175_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110665","volume":"274","author":"Q Leng","year":"2023","unstructured":"Leng, Q., Guo, J., Jiao, E., Meng, X. & Wang, C. NanBDOS: Adaptive and parameter-free borderline oversampling via natural neighbor search for class-imbalance learning. Knowl.-Based Syst.274, 110665. https:\/\/doi.org\/10.1016\/j.knosys.2023.110665 (2023).","journal-title":"Knowl.-Based Syst."},{"key":"34175_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.array.2022.100232","volume":"15","author":"W Zuo","year":"2022","unstructured":"Zuo, W. & Hou, X. An improved probability propagation algorithm for density peak clustering based on natural nearest neighborhood. Array15, 100232. https:\/\/doi.org\/10.1016\/j.array.2022.100232 (2022).","journal-title":"Array"},{"key":"34175_CR41","unstructured":"Markelle, K., Longjohn, R. & Nottingham, K. UCI Machine Learning Repository."},{"key":"34175_CR42","doi-asserted-by":"publisher","unstructured":"Vinh, N.\u00a0X., Epps, J. & Bailey, J. Information theoretic measures for clusterings comparison: is a correction for chance necessary? In Proceedings of the 26th annual international conference on machine learning, 1073\u20131080, https:\/\/doi.org\/10.1145\/1553374.1553511 (2009).","DOI":"10.1145\/1553374.1553511"},{"key":"34175_CR43","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"100","author":"CT Zahn","year":"1971","unstructured":"Zahn, C. T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Computers100, 68\u201386 (1971).","journal-title":"IEEE Trans. Computers"},{"key":"34175_CR44","unstructured":"K\u00e4rkk\u00e4inen, I. & Fr\u00e4nti, P. Dynamic local search algorithm for the clustering problem (Citeseer, 2002)."},{"key":"34175_CR45","unstructured":"Ultsch, A. Clustering wih som: U* c. In Proceedings of the 5th workshop on self-organizing maps, vol.\u00a02, 75\u201382 (2005)."},{"key":"34175_CR46","unstructured":"Zelnik-Manor, L. & Perona, P. Self-tuning spectral clustering. Advances in neural information processing systems17 (2004)."},{"key":"34175_CR47","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang, H. & Yeung, D.-Y. Robust path-based spectral clustering. Pattern Recognit.41, 191\u2013203 (2008).","journal-title":"Pattern Recognit."},{"key":"34175_CR48","doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H. & Tsaparas, P. Clustering aggregation. Acm transactions on knowledge discovery from data (tkdd)1, 4\u2013es (2007).","DOI":"10.1145\/1217299.1217303"},{"key":"34175_CR49","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Franti","year":"2006","unstructured":"Franti, P., Virmajoki, O. & Hautamaki, V. Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. Pattern Anal. Mach. Intell.28, 1875\u20131881 (2006).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-34175-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-34175-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-34175-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T16:52:54Z","timestamp":1781628774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-34175-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["34175"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-34175-0","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"9 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"4072"}}