{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T08:01:07Z","timestamp":1780128067743,"version":"3.54.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Gansu Provincial University Teachers Innovation Foundation","award":["2024A-024"],"award-info":[{"award-number":["2024A-024"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62162040"],"award-info":[{"award-number":["62162040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s13042-026-03077-6","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T07:51:14Z","timestamp":1774857074000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structural evolutionary agent meets deep learning: a novel incremental updating framework for dynamic influence maximization in temporal social networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jitao","family":"Qu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenshuo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunxia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,30]]},"reference":[{"key":"3077_CR1","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, pp 137\u2013146, https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"3077_CR2","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1109\/TEM.2023.3336370","volume":"71","author":"Z Wang","year":"2024","unstructured":"Wang Z, Song J, Zhao J (2024) Enhancing product promotion in social networks: Leveraging adaptive discount-offering and the crowd effect. IEEE Trans Eng Manage 71:1613\u20131628. https:\/\/doi.org\/10.1109\/TEM.2023.3336370","journal-title":"IEEE Trans Eng Manage"},{"key":"3077_CR3","doi-asserted-by":"publisher","unstructured":"Yao X, Zhao Y, Gao N, et\u00a0al (2023) Causal related rumors controlling in social networks of multiple information. IEEE-ACM Transactions on Networking pp 1\u201314. https:\/\/doi.org\/10.1109\/TNET.2023.3337774","DOI":"10.1109\/TNET.2023.3337774"},{"key":"3077_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123429","volume":"248","author":"LBR Myriam","year":"2024","unstructured":"Myriam LBR (2024) A survey on influence maximization models. Expert Syst Appl 248:123429. https:\/\/doi.org\/10.1016\/j.eswa.2024.123429","journal-title":"Expert Syst Appl"},{"issue":"9","key":"3077_CR5","doi-asserted-by":"publisher","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","volume":"34","author":"SS Singh","year":"2022","unstructured":"Singh SS, Srivastva D, Verma M et al (2022) Influence maximization frameworks, performance, challenges and directions on social network: a theoretical study. J King Saud Univ Comput Info Sci 34(9):7570\u20137603. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.009","journal-title":"J King Saud Univ Comput Info Sci"},{"key":"3077_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113642","volume":"159","author":"N Hafiene","year":"2020","unstructured":"Hafiene N, Karoui W, Ben RL (2020) Influential nodes detection in dynamic social networks: A survey. Expert Syst Appl 159:113642. https:\/\/doi.org\/10.1016\/j.eswa.2020.113642","journal-title":"Expert Syst Appl"},{"key":"3077_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.102.042307","volume":"102","author":"\u015e Erkol","year":"2020","unstructured":"Erkol \u015e, Mazzilli D, Radicchi F (2020) Influence maximization on temporal networks. Phys Rev E 102:042307. https:\/\/doi.org\/10.1103\/PhysRevE.102.042307","journal-title":"Phys Rev E"},{"issue":"1","key":"3077_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s41109-024-00625-3","volume":"9","author":"E Yanchenko","year":"2024","unstructured":"Yanchenko E, Murata T, Holme P (2024) Influence maximization on temporal networks: a review. Appl Network Sci 9(1):16. https:\/\/doi.org\/10.1007\/s41109-024-00625-3","journal-title":"Appl Network Sci"},{"issue":"1","key":"3077_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s40649-018-0056-8","volume":"5","author":"THK Murata","year":"2018","unstructured":"Murata T, H. K, (2018) Extended methods for influence maximization in dynamic networks. Comput Soc Networks 5(1):9. https:\/\/doi.org\/10.1186\/s40649-018-0056-8","journal-title":"Comput Soc Networks"},{"issue":"3","key":"3077_CR10","doi-asserted-by":"publisher","first-page":"2305111","DOI":"10.1360\/SSPMA-2023-0134","volume":"54","author":"X Zhan","year":"2024","unstructured":"Zhan X, Xie X, Zhang K et al (2024) A node-embedding-based influence maximization algorithm in temporal network. Scientia Sinica Physica Mechanica & Astronomica 54(3):2305111. https:\/\/doi.org\/10.1360\/SSPMA-2023-0134","journal-title":"Scientia Sinica Physica Mechanica & Astronomica"},{"issue":"2","key":"3077_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TKDE.2016.2620141","volume":"29","author":"G Song","year":"2016","unstructured":"Song G, Li Y, Chen X et al (2016) Influential node tracking on dynamic social network: An interchange greedy approach. IEEE Trans Knowl Data Eng 29(2):359\u2013372. https:\/\/doi.org\/10.1109\/TKDE.2016.2620141","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"3077_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s42979-023-02453-1","volume":"5","author":"S Dizaji","year":"2024","unstructured":"Dizaji S, Patil K, Avrachenkov K (2024) Influence maximization in dynamic networks using reinforcement learning. SN Comput Sci 5(1):169. https:\/\/doi.org\/10.1007\/s42979-023-02453-1","journal-title":"SN Comput Sci"},{"key":"3077_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"JJ Lotf","year":"2022","unstructured":"Lotf JJ, Azgomi MA, Dishabi MRE (2022) An improved influence maximization method for social networks based on genetic algorithm. Physica A 586:126480. https:\/\/doi.org\/10.1016\/j.physa.2021.126480","journal-title":"Physica A"},{"key":"3077_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110062","volume":"136","author":"W Li","year":"2023","unstructured":"Li W, Hu Y, Jiang C et al (2023) ABEM: An adaptive agent-based evolutionary approach for influence maximization in dynamic social networks. Appl Soft Comput 136:110062. https:\/\/doi.org\/10.1016\/j.asoc.2023.110062","journal-title":"Appl Soft Comput"},{"key":"3077_CR15","doi-asserted-by":"publisher","first-page":"119349","DOI":"10.22967\/hcis.2023.13.040","volume":"215","author":"S Yang","year":"2023","unstructured":"Yang S, Song J, Tong S et al (2023) Extending influence maximization by optimizing the network topology. Expert Syst Appl 215:119349. https:\/\/doi.org\/10.22967\/hcis.2023.13.040","journal-title":"Expert Syst Appl"},{"key":"3077_CR16","doi-asserted-by":"publisher","unstructured":"Zhang S, Liu S, Tang K (2024) A sample reuse strategy for dynamic influence maximization problem. In: Bio-Inspired Computing: Theories and Applications, pp 107\u2013120, https:\/\/doi.org\/10.1007\/978-981-97-2275-4_9","DOI":"10.1007\/978-981-97-2275-4_9"},{"key":"3077_CR17","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2021.827468","volume":"9","author":"W Sheng","year":"2022","unstructured":"Sheng W, Song W, Li D et al (2022) Dynamic influence maximization via network representation learning. Front Phys 9:827468. https:\/\/doi.org\/10.3389\/fphy.2021.827468","journal-title":"Front Phys"},{"key":"3077_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2022.104689","volume":"95","author":"J Chandran","year":"2022","unstructured":"Chandran J, Viswanatham V (2022) Dynamic node influence tracking based influence maximization on dynamic social networks. Microprocess Microsyst 95:104689. https:\/\/doi.org\/10.1016\/j.micpro.2022.104689","journal-title":"Microprocess Microsyst"},{"key":"3077_CR19","doi-asserted-by":"crossref","unstructured":"Dupuis D, Du\u00a0Mouza C, Travers N, et\u00a0al (2019) Rtim: a real-time influence maximization strategy. In: International Conference on Web Information Systems Engineering, pp 277\u2013292","DOI":"10.1007\/978-3-030-34223-4_18"},{"key":"3077_CR20","first-page":"628","volume":"3","author":"H Peng","year":"2021","unstructured":"Peng H, Yang R, Wang Z et al (2021) Lime: Low-cost and incremental learning for dynamic heterogeneous information networks. IEEE Trans Comput 3:628\u2013642","journal-title":"IEEE Trans Comput"},{"key":"3077_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104175","volume":"334","author":"R Yang","year":"2024","unstructured":"Yang R, Peng H, Liu C et al (2024) Incremental measurement of structural entropy for dynamic graphs. Artif Intell 334:104175","journal-title":"Artif Intell"},{"key":"3077_CR22","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhu J, Ming Q (2017) Incremental influence maximization for dynamic social networks. In: International Conference of Pioneering Computer Scientists, Engineers and Educators, pp 13\u201327","DOI":"10.1007\/978-981-10-6388-6_2"},{"issue":"9","key":"3077_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TETC.2024.3403891","volume":"17","author":"Y Li","year":"2023","unstructured":"Li Y, Gao H, Gao Y et al (2023) A survey on influence maximization: From an ML-based combinatorial optimization. ACM Trans Knowl Discov Data 17(9):1\u201350. https:\/\/doi.org\/10.1109\/TETC.2024.3403891","journal-title":"ACM Trans Knowl Discov Data"},{"key":"3077_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.10.070","volume":"618","author":"Q Zhang","year":"2022","unstructured":"Zhang Q, Shuai B, Lu M (2022) A novel method to identify influential nodes in complex networks based on gravity centrality. Inf Sci 618:98\u2013117. https:\/\/doi.org\/10.1016\/j.ins.2022.10.070","journal-title":"Inf Sci"},{"issue":"1","key":"3077_CR25","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCSS.2022.3216587","volume":"11","author":"M Jaouadi","year":"2024","unstructured":"Jaouadi M, Ben Romdhane L (2024) A graph sampling-based model for influence maximization in large-scale social networks. IEEE Trans Comput Soc Syst 11(1):144\u2013160. https:\/\/doi.org\/10.1109\/TCSS.2022.3216587","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"3077_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.102002","volume":"97","author":"J Tang","year":"2025","unstructured":"Tang J, Fu J, Li X et al (2025) Probing the fitness landscape of the influential nodes for the influence maximization problem in social networks. Swarm Evol Comput 97:102002","journal-title":"Swarm Evol Comput"},{"key":"3077_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111037","volume":"149","author":"K Inder","year":"2023","unstructured":"Inder K, Arjun C, Aryaman R et al (2023) Influence maximization in social networks using discretized harris\u2019 hawks optimization algorithm. Appl Soft Comput 149:111037. https:\/\/doi.org\/10.1016\/j.asoc.2023.111037","journal-title":"Appl Soft Comput"},{"key":"3077_CR28","doi-asserted-by":"publisher","unstructured":"He Q, Zhang L, Fang H, et\u00a0al (2024) Multistage competitive opinion maximization with q-learning-based method in social networks. IEEE Transactions on Neural Networks and Learning Systems pp 1\u201311. https:\/\/doi.org\/10.1109\/TNNLS.2024.33872934","DOI":"10.1109\/TNNLS.2024.33872934"},{"key":"3077_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118770","volume":"212","author":"K Sanjay","year":"2023","unstructured":"Sanjay K, Abhishek M, Panda B (2023) Influence maximization in social networks using transfer learning via graph-based LSTM. IEEE Trans Comput Soc Syst 212:118770. https:\/\/doi.org\/10.1016\/j.eswa.2022.118770","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"3077_CR30","unstructured":"Ling C, Jiang J, Wang J, et\u00a0al (2023) Deep graph representation learning and optimization for influence maximization. In: International conference on machine learning, pp 21350\u201321361"},{"key":"3077_CR31","doi-asserted-by":"crossref","unstructured":"Panagopoulos G, Tziortziotis N, Vazirgiannis M, et\u00a0al (2023) Maximizing influence with graph neural networks. In: Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, pp 237\u2013244","DOI":"10.1145\/3625007.3627293"},{"key":"3077_CR32","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.neucom.2021.04.084","volume":"453","author":"AK Singh","year":"2021","unstructured":"Singh AK, Kailasam L (2021) Link prediction-based influence maximization in online social networks. Neurocomputing 453:151\u2013163. https:\/\/doi.org\/10.1016\/j.neucom.2021.04.084","journal-title":"Neurocomputing"},{"issue":"8","key":"3077_CR33","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.3390\/math10081341","volume":"10","author":"L Zhang","year":"2022","unstructured":"Zhang L, Li K (2022) Influence maximization based on snapshot prediction in dynamic online social networks. Mathematics 10(8):1341. https:\/\/doi.org\/10.3390\/math10081341","journal-title":"Mathematics"},{"issue":"1","key":"3077_CR34","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/s41109-023-00594-z","volume":"8","author":"E Yanchenko","year":"2023","unstructured":"Yanchenko E, Murata T, Holme P (2023) Link prediction for ex ante influence maximization on temporal networks. Appl Network Sci 8(1):70. https:\/\/doi.org\/10.1007\/s41109-023-00594-z","journal-title":"Appl Network Sci"},{"key":"3077_CR35","doi-asserted-by":"publisher","first-page":"12494","DOI":"10.1038\/s41598-020-69379-z","volume":"10","author":"E Yu","year":"2020","unstructured":"Yu E, Fu Y, Chen X et al (2020) Identifying critical nodes in temporal networks by network embedding. Sci Rep 10:12494","journal-title":"Sci Rep"},{"key":"3077_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119086","volume":"214","author":"A Rezaei","year":"2023","unstructured":"Rezaei A, Munoz J, Jalili M et al (2023) A machine learning-based approach for vital node identification in complex networks. Exp Syst Appl 214:119086","journal-title":"Exp Syst Appl"},{"issue":"6","key":"3077_CR37","doi-asserted-by":"publisher","first-page":"2535","DOI":"10.1007\/s11280-021-00998-w","volume":"25","author":"M Mendon\u00e7a","year":"2022","unstructured":"Mendon\u00e7a M, Barreto A, Ziviani A (2022) Efficient information diffusion in time-varying graphs through deep reinforcement learning. World Wide Web 25(6):2535\u20132560. https:\/\/doi.org\/10.1007\/s11280-021-00998-w","journal-title":"World Wide Web"},{"issue":"8","key":"3077_CR38","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1007\/s41109-024-00625-3","volume":"17","author":"X Qin","year":"2023","unstructured":"Qin X, Zhong C, Lin H (2023) Community-based influence maximization using network embedding in dynamic heterogeneous social networks. ACM Trans Knowl Discov Data 17(8):1556\u20134681. https:\/\/doi.org\/10.1007\/s41109-024-00625-3","journal-title":"ACM Trans Knowl Discov Data"},{"key":"3077_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105893","volume":"198","author":"E Yu","year":"2020","unstructured":"Yu E, Wang Y, Fu Y et al (2020) Identifying critical nodes in complex networks via graph convolutional networks. Knowl-Based Syst 198:105893. https:\/\/doi.org\/10.1016\/j.knosys.2020.105893","journal-title":"Knowl-Based Syst"},{"key":"3077_CR40","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neucom.2022.05.010","volume":"497","author":"M Zhang","year":"2022","unstructured":"Zhang M, Wang X, Jin L et al (2022) A new approach for evaluating node importance in complex networks via deep learning methods. Knowl-Based Syst 497:13\u201327. https:\/\/doi.org\/10.1016\/j.neucom.2022.05.010","journal-title":"Knowl-Based Syst"},{"issue":"7","key":"3077_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117515","volume":"35","author":"Y Ou","year":"2023","unstructured":"Ou Y, Guo Q, Xing J et al (2023) Key nodes identification in complex networks based on subnetwork feature extraction. J King Saud Univ Comput Infor Sci 35(7):101631. https:\/\/doi.org\/10.1016\/j.eswa.2022.117515","journal-title":"J King Saud Univ Comput Infor Sci"},{"key":"3077_CR42","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367\u2013368","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B et al (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367\u2013368:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"key":"3077_CR43","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.knosys.2019.07.004","volume":"472","author":"G Xue","year":"2022","unstructured":"Xue G, Zhong M, Li J et al (2022) Dynamic network embedding survey. Neurocomputing 472:212\u2013223. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Neurocomputing"},{"key":"3077_CR44","doi-asserted-by":"publisher","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the tenth ACM International Conference on Web Wearch and Data Mining, pp 601\u2013610, https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"3077_CR45","unstructured":"Simonyan K, Zisserman A (2014) Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556"},{"key":"3077_CR46","doi-asserted-by":"crossref","unstructured":"Huang G, Liu Z, M. VD, et\u00a0al (2017) Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 4700\u20134708","DOI":"10.1109\/CVPR.2017.243"},{"key":"3077_CR47","doi-asserted-by":"publisher","unstructured":"Radosavovic I, Kosaraju RP, Girshick R, et\u00a0al (2020) Designing network design spaces. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 10428\u201310436, https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"3077_CR48","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F et al (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Networks Learn Syst 32:4\u201324","journal-title":"IEEE Trans Neural Networks Learn Syst"},{"key":"3077_CR49","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2306.10759","author":"Q Wu","year":"2024","unstructured":"Wu Q, Zhao W, Yang C et al (2024) Simplifying and empowering transformers for large-graph representations. Adv Neural Inf Process Syst. https:\/\/doi.org\/10.48550\/arXiv.2306.10759","journal-title":"Adv Neural Inf Process Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-026-03077-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T07:02:46Z","timestamp":1780124566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-026-03077-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,30]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3077"],"URL":"https:\/\/doi.org\/10.1007\/s13042-026-03077-6","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,30]]},"assertion":[{"value":"6 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"231"}}