{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T16:15:37Z","timestamp":1779207337107,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2021J011146"],"award-info":[{"award-number":["2021J011146"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2021J011142"],"award-info":[{"award-number":["2021J011142"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2023J011063"],"award-info":[{"award-number":["2023J011063"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s13042-025-02754-2","type":"journal-article","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T08:15:33Z","timestamp":1753517733000},"page":"9271-9293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph regularized symmetric non-negative matrix factorization with degree-related spectral clustering and topological structure for link prediction in complex network"],"prefix":"10.1007","volume":"16","author":[{"given":"Guangfu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaofei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jizhi","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"issue":"6","key":"2754_CR1","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L Linyuan","year":"2011","unstructured":"Linyuan L, Zhou T (2011) Link prediction in complex networks: a survey. Physica A 390(6):1150\u20131170","journal-title":"Physica A"},{"key":"2754_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-018-0503-4","volume":"8","author":"D Kagan","year":"2018","unstructured":"Kagan D, Elovichi Y, Fire M (2018) Generic anomalous vertices detection utilizing a link prediction algorithm. Soc Netw Anal Min 8:1\u201313","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"2754_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TCSS.2022.3168010","volume":"10","author":"H-F Zhang","year":"2022","unstructured":"Zhang H-F, Ma X-J, Wang J, Zhang X, Pan D, Zhong K (2022) Privacy-preserving link prediction in multiple private networks. IEEE Trans Comput Soc Syst 10(2):538\u2013550","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"2","key":"2754_CR4","first-page":"754","volume":"33","author":"S Yu","year":"2019","unstructured":"Yu S, Zhao M, Fu C, Zheng J, Huang H, Shu X, Xuan Q, Chen G (2019) Target defense against link-prediction-based attacks via evolutionary perturbations. IEEE Trans Knowl Data Eng 33(2):754\u2013767","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2754_CR5","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102","journal-title":"Phys Rev E"},{"issue":"4","key":"2754_CR6","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, Lv L, Zhang YC (2009) Predicting missing links via local information. Eur Phys J B 71(4):623\u2013630","journal-title":"Eur Phys J B"},{"key":"2754_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","volume":"452","author":"Z Wu","year":"2016","unstructured":"Wu Z, Lin Y, Wang J, Gregory S (2016) Link prediction with node clustering coefficient. Physica A Stat Mech Appl 452:1\u20138","journal-title":"Physica A Stat Mech Appl"},{"key":"2754_CR8","volume":"8","author":"Z Wu","year":"2016","unstructured":"Wu Z, Lin Y, Wan H (2016) Jamil W (2016) Predicting top-l missing links with node and link clustering information in large-scale networks. J Stat Mech-Theory E 8:083202","journal-title":"J Stat Mech-Theory E"},{"key":"2754_CR9","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.122950","volume":"539","author":"S Rafiee","year":"2020","unstructured":"Rafiee S, Salavati C, Abdollahpouri A (2020) CNDP: link prediction based on common neighbors degree penalization. Physica A Stat Mech Appl 539:122950","journal-title":"Physica A Stat Mech Appl"},{"key":"2754_CR10","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.121319","volume":"528","author":"R Pech","year":"2019","unstructured":"Pech R, Hao D, Lee Y-L, Yuan Y, Zhou T (2019) Link prediction via linear optimization. Physica A Stat Mech Appl 528:121319","journal-title":"Physica A Stat Mech Appl"},{"issue":"8","key":"2754_CR11","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","volume":"112","author":"L L\u00fc","year":"2015","unstructured":"L\u00fc L, Pan L, Zhou T, Zhang Y-C, Stanley HE (2015) Toward link predictability of complex networks. Proc Natl Acad Sci 112(8):2325\u20132330","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"2754_CR12","volume":"80","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc L, Jin C-H, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev EStat Nonlinear Soft Matter Phys 80(4):046122","journal-title":"Phys Rev EStat Nonlinear Soft Matter Phys"},{"key":"2754_CR13","volume":"564","author":"T Zhou","year":"2021","unstructured":"Zhou T, Lee Y-L, Wang G (2021) Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms. Physica A Stat Mech Appl 564:125532","journal-title":"Physica A Stat Mech Appl"},{"key":"2754_CR14","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1016\/j.ins.2022.07.030","volume":"608","author":"Y Liu","year":"2022","unstructured":"Liu Y, Liu S, Yu F, Yang X (2022) Link prediction algorithm based on the initial information contribution of nodes. Inf Sci 608:1591\u20131616","journal-title":"Inf Sci"},{"key":"2754_CR15","volume":"175","author":"AK Rai","year":"2023","unstructured":"Rai AK, Tripathi SP, Yadav RK (2023) A novel similarity-based parameterized method for link prediction. Chaos Solitons Fractals 175:114046","journal-title":"Chaos Solitons Fractals"},{"key":"2754_CR16","doi-asserted-by":"crossref","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2019) Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning. Physica A 122882","DOI":"10.1016\/j.physa.2019.122882"},{"key":"2754_CR17","doi-asserted-by":"crossref","unstructured":"Li T, Zhang R, Yao Y, Liu Y, Ma J, Tang J (2024) Graph regularized autoencoding-inspired non-negative matrix factorization for link prediction in complex networks using clustering information and biased random walk. J Supercomput 1\u201337","DOI":"10.1007\/s11227-024-06013-z"},{"key":"2754_CR18","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110998","volume":"280","author":"R Mahmoodi","year":"2023","unstructured":"Mahmoodi R, Seyedi SA, Tab FA, Abdollahpouri A (2023) Link prediction by adversarial nonnegative matrix factorization. Knowl-Based Syst 280:110998","journal-title":"Knowl-Based Syst"},{"key":"2754_CR19","doi-asserted-by":"crossref","unstructured":"Chen W-S, Xie K, Liu R, Pan B (2023) Symmetric nonnegative matrix factorization: a systematic review. Neurocomputing 126721","DOI":"10.1016\/j.neucom.2023.126721"},{"issue":"11","key":"2754_CR20","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.1109\/TKDE.2017.2730207","volume":"29","author":"L Duan","year":"2017","unstructured":"Duan L, Ma S, Aggarwal C, Ma T, Huai J (2017) An ensemble approach to link prediction. IEEE Trans Knowl Data Eng 29(11):2402\u20132416","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2754_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.patcog.2017.06.025","volume":"71","author":"X Ma","year":"2017","unstructured":"Ma X, Sun P, Qin G (2017) Nonnegative matrix factorization algorithms for link prediction in temporal networks using graph communicability. Pattern Recogn 71:361\u2013374","journal-title":"Pattern Recogn"},{"key":"2754_CR22","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Physica A Stat Mech Appl 553:124289","journal-title":"Physica A Stat Mech Appl"},{"issue":"3","key":"2754_CR23","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1007\/s11227-023-05591-8","volume":"80","author":"D Arrar","year":"2024","unstructured":"Arrar D, Kamel N, Lakhfif A (2024) A comprehensive survey of link prediction methods. J Supercomput 80(3):3902\u20133942","journal-title":"J Supercomput"},{"issue":"4","key":"2754_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez V, Berzal F, Cubero J-C (2016) A survey of link prediction in complex networks. ACM Comput Surv (CSUR) 49(4):1\u201333","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2754_CR25","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1007\/s13278-013-0128-6","volume":"3","author":"P Symeonidis","year":"2013","unstructured":"Symeonidis P, Mantas N (2013) Spectral clustering for link prediction in social networks with positive and negative links. Soc Netw Anal Min 3:1433\u20131447","journal-title":"Soc Netw Anal Min"},{"key":"2754_CR26","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.datak.2013.05.008","volume":"87","author":"P Symeonidis","year":"2013","unstructured":"Symeonidis P, Iakovidou N, Mantas N, Manolopoulos Y (2013) From biological to social networks: link prediction based on multi-way spectral clustering. Data Knowl Eng 87:226\u2013242","journal-title":"Data Knowl Eng"},{"issue":"2","key":"2754_CR27","volume":"80","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc L, Jin CH, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(2):046122","journal-title":"Phys Rev E"},{"issue":"1","key":"2754_CR28","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1038\/s41598-019-57304-y","volume":"10","author":"I Ahmad","year":"2020","unstructured":"Ahmad I, Akhtar MU, Noor S, Shahnaz A (2020) Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci Rep 10(1):364","journal-title":"Sci Rep"},{"key":"2754_CR29","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2023.128546","volume":"616","author":"H Yuliansyah","year":"2023","unstructured":"Yuliansyah H, Othman ZA, Bakar AA (2023) A new link prediction method to alleviate the cold-start problem based on extending common neighbor and degree centrality. Physica A Stat Mech Appl 616:128546","journal-title":"Physica A Stat Mech Appl"},{"issue":"11","key":"2754_CR30","first-page":"0208185","volume":"13","author":"W Wang","year":"2018","unstructured":"Wang W, Tang M, Jiao P (2018) A unified framework for link prediction based on non-negative matrix factorization with coupling multivariate information. PLoS ONE 13(11):0208185","journal-title":"PLoS ONE"},{"issue":"2","key":"2754_CR31","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TCSS.2021.3114419","volume":"9","author":"C He","year":"2021","unstructured":"He C, Fei X, Cheng Q, Li H, Hu Z, Tang Y (2021) A survey of community detection in complex networks using nonnegative matrix factorization. IEEE Trans Comput Soc Syst 9(2):440\u2013457","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2754_CR32","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/j.ins.2023.03.119","volume":"634","author":"C Li","year":"2023","unstructured":"Li C, Che H, Leung M-F, Liu C, Yan Z (2023) Robust multi-view non-negative matrix factorization with adaptive graph and diversity constraints. Inf Sci 634:587\u2013607","journal-title":"Inf Sci"},{"key":"2754_CR33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.neunet.2018.03.003","volume":"103","author":"H Che","year":"2018","unstructured":"Che H, Wang J (2018) A nonnegative matrix factorization algorithm based on a discrete-time projection neural network. Neural Netw 103:63\u201371","journal-title":"Neural Netw"},{"key":"2754_CR34","doi-asserted-by":"crossref","first-page":"38938","DOI":"10.1038\/srep38938","volume":"6","author":"W Wang","year":"2016","unstructured":"Wang W, Cai F, Jiao P, Pan L (2016) A perturbation-based framework for link prediction via non-negative matrix factorization. Sci Rep 6:38938","journal-title":"Sci Rep"},{"key":"2754_CR35","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.knosys.2017.09.020","volume":"137","author":"W Wang","year":"2017","unstructured":"Wang W, Feng Y, Jiao P, Yu W (2017) Kernel framework based on non-negative matrix factorization for networks reconstruction and link prediction. Knowl Based Syst 137:104\u2013114","journal-title":"Knowl Based Syst"},{"key":"2754_CR36","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.neucom.2019.08.068","volume":"369","author":"G Chen","year":"2019","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2019) Graph regularization weighted nonnegative matrix factorization for link prediction in weighted complex network. Neurocomputing 369:50\u201360","journal-title":"Neurocomputing"},{"key":"2754_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113290","volume":"148","author":"G Chen","year":"2020","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2020) Nonnegative matrix factorization for link prediction in directed complex networks using PageRank and asymmetric link clustering information. Expert Syst Appl 148:113290","journal-title":"Expert Syst Appl"},{"key":"2754_CR38","doi-asserted-by":"crossref","unstructured":"Zhao Z, Hu A, Zhang N (2024) Mining node attributes for link prediction with a non-negative matrix factorization-based approach. Knowl-Based Syst 112045","DOI":"10.1016\/j.knosys.2024.112045"},{"issue":"5","key":"2754_CR39","first-page":"1","volume":"28","author":"G Chen","year":"2025","unstructured":"Chen G, Xie B, Li X, Zhao J (2025) Pairwisely constrained symmetric non-negative matrix factorization for link prediction in complex networks using degree-related clustering coefficient and improved closeness centrality. Clust Comput 28(5):1\u201326","journal-title":"Clust Comput"},{"issue":"5","key":"2754_CR40","doi-asserted-by":"crossref","first-page":"4095","DOI":"10.1007\/s10489-024-05365-6","volume":"54","author":"T Li","year":"2024","unstructured":"Li T, Zhang R, Yao Y, Liu Y, Ma J (2024) Link prediction using deep autoencoder-like non-negative matrix factorization with l21-norm. Appl Intell 54(5):4095\u20134120","journal-title":"Appl Intell"},{"key":"2754_CR41","doi-asserted-by":"crossref","unstructured":"Qiu J, Dong Y, Ma H, Li J, Wang K, Tang J (2018) Network embedding as matrix factorization: unifying DeepWalk, LINE, PTE, and node2vec. In: Proceedings of the eleventh ACM international conference on web search and data mining, pp 459\u2013467","DOI":"10.1145\/3159652.3159706"},{"key":"2754_CR42","doi-asserted-by":"crossref","unstructured":"Wang X, Cui P, Wang J, Pei J, Zhu W, Yang S (2017) Community preserving network embedding. In: Proceedings of the AAAI conference on artificial intelligence, p 31","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"2754_CR43","doi-asserted-by":"crossref","unstructured":"Zhang Z, Cui P, Wang X, Pei J, Yao X, Zhu W (2018) Arbitrary-order proximity preserved network embedding. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2778\u20132786","DOI":"10.1145\/3219819.3219969"},{"key":"2754_CR44","doi-asserted-by":"crossref","first-page":"225967","DOI":"10.1109\/ACCESS.2020.3045532","volume":"8","author":"Q Tian","year":"2020","unstructured":"Tian Q, Pan L, Guo X, Li X, Yu W, Li F (2020) Local structure and high-order feature preserved network embedding based on non-negative matrix factorization. IEEE Access 8:225967\u2013225980","journal-title":"IEEE Access"},{"key":"2754_CR45","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ins.2021.04.095","volume":"572","author":"Q Tian","year":"2021","unstructured":"Tian Q, Pan L, Zhang W, Li T, Wu H, Jiao P, Wang W (2021) Lower order information preserved network embedding based on non-negative matrix decomposition. Inf Sci 572:43\u201356","journal-title":"Inf Sci"},{"key":"2754_CR46","doi-asserted-by":"crossref","unstructured":"Kuang D, Ding C, Park H (2012) Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of the 2012 SIAM international conference on data mining. SIAM, pp 106\u2013117","DOI":"10.1137\/1.9781611972825.10"},{"issue":"3","key":"2754_CR47","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TNNLS.2020.3041360","volume":"33","author":"X Luo","year":"2021","unstructured":"Luo X, Liu Z, Jin L, Zhou Y, Zhou M (2021) Symmetric nonnegative matrix factorization-based community detection models and their convergence analysis. IEEE Trans Neural Netw Learn Syst 33(3):1203\u20131215","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2754_CR48","unstructured":"Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems. pp 556\u2013562"},{"issue":"1","key":"2754_CR49","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inform Syst 22(1):5\u201353","journal-title":"ACM Trans Inform Syst"},{"issue":"1","key":"2754_CR50","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143(1):29\u201336","journal-title":"Radiology"},{"issue":"3","key":"2754_CR51","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10115-014-0789-0","volume":"45","author":"Y Yang","year":"2015","unstructured":"Yang Y, Lichtenwalter RN, Chawla NV (2015) Evaluating link prediction methods. Knowl Inf Syst 45(3):751\u2013782","journal-title":"Knowl Inf Syst"},{"key":"2754_CR52","unstructured":"Rossi RA, Ahmed NK Network repository datasets. http:\/\/networkrepository.com\/index.php"},{"key":"2754_CR53","unstructured":"Kunegis J KONECT network dataset. http:\/\/konect.cc\/networks\/"},{"key":"2754_CR54","doi-asserted-by":"crossref","unstructured":"Shang K-K, Li T-C, Small M, Burton D, Wang Y (2019) Link prediction for tree-like networks. Chaos Interdiscipl J Nonlinear Sci 29(6)","DOI":"10.1063\/1.5107440"},{"issue":"1","key":"2754_CR55","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00607-022-01115-z","volume":"105","author":"Y Tian","year":"2023","unstructured":"Tian Y, Nie G, Tian H, Cui Q (2023) Impact of endpoint structure attributes on local information algorithms based on link prediction. Computing 105(1):115\u2013129","journal-title":"Computing"},{"key":"2754_CR56","volume":"159","author":"L Lv","year":"2022","unstructured":"Lv L, Bardou D, Hu P, Liu Y, Yu G (2022) Graph regularized nonnegative matrix factorization for link prediction in directed temporal networks using PageRank centrality. Chaos Solitons Fractals 159:112107","journal-title":"Chaos Solitons Fractals"},{"key":"2754_CR57","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108641","volume":"133","author":"R Mahmoodi","year":"2024","unstructured":"Mahmoodi R, Seyedi SA, Abdollahpouri A, Tab FA (2024) Enhancing link prediction through adversarial training in deep nonnegative matrix factorization. Eng Appl Artif Intell 133:108641","journal-title":"Eng Appl Artif Intell"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02754-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02754-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02754-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T11:24:51Z","timestamp":1762514691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02754-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,26]]},"references-count":57,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2754"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02754-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,26]]},"assertion":[{"value":"10 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2025","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The data used in this study were publicly available data sets on the Internet. No animals or humans were victims.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}