{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T10:16:59Z","timestamp":1765966619210,"version":"3.48.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T00:00:00Z","timestamp":1741651200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T00:00:00Z","timestamp":1741651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"University Grants Commission, Government of India.","award":["3703\/(NET-DEC 2018)"],"award-info":[{"award-number":["3703\/(NET-DEC 2018)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-025-01411-4","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T04:42:34Z","timestamp":1741668154000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning automata-enabled ant colony optimization for group influence maximization in social networks: a two-stage approach"],"prefix":"10.1007","volume":"15","author":[{"given":"Gouri","family":"Kundu","sequence":"first","affiliation":[]},{"given":"Sankhayan","family":"Choudhury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,11]]},"reference":[{"issue":"1","key":"1411_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/0952813X.2020.1725650","volume":"33","author":"M Alirezanejad","year":"2021","unstructured":"Alirezanejad M, Enayatifar R, Motameni H et al (2021) GSA-LA: gravitational search algorithm based on learning automata. J Exp Theor Artif Intell 33(1):109\u2013125","journal-title":"J Exp Theor Artif Intell"},{"issue":"14","key":"1411_CR2","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1016\/S0305-0548(03)00197-7","volume":"31","author":"N Azizi","year":"2004","unstructured":"Azizi N, Zolfaghari S (2004) Adaptive temperature control for simulated annealing: a comparative study. Comput Op Res 31(14):2439\u20132451","journal-title":"Comput Op Res"},{"issue":"1538","key":"1411_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1098\/rstb.2009.0169","volume":"365","author":"M Baddeley","year":"2010","unstructured":"Baddeley M (2010) Herding, social influence and economic decision-making: socio-psychological and neuroscientific analyses. Philos Trans R Soc B Biol Sci 365(1538):281\u2013290","journal-title":"Philos Trans R Soc B Biol Sci"},{"key":"1411_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","volume":"556","author":"TK Biswas","year":"2021","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2021) An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks. Info Sci 556:27\u201348","journal-title":"Info Sci"},{"key":"1411_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116342","volume":"192","author":"TK Biswas","year":"2022","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2022) A two-stage VIKOR assisted multi-operator differential evolution approach for influence maximization in social networks. Expert Syst Appl 192:116342","journal-title":"Expert Syst Appl"},{"key":"1411_CR6","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R et al (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Expe 10:P10008","journal-title":"J Stat Mech Theory Expe"},{"issue":"6","key":"1411_CR7","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS et al (2016) INCIM: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199","journal-title":"Inf Process Manag"},{"key":"1411_CR8","doi-asserted-by":"publisher","first-page":"152115","DOI":"10.1109\/ACCESS.2019.2944350","volume":"7","author":"F Cai","year":"2019","unstructured":"Cai F, Qiu L, Kuai X et al (2019) CBIM-RSRW: an community-based method for influence maximization in social network. IEEE Access 7:152115\u2013152125","journal-title":"IEEE Access"},{"key":"1411_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"1","key":"1411_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1146\/annurev.psych.55.090902.142015","volume":"55","author":"RB Cialdini","year":"2004","unstructured":"Cialdini RB, Goldstein NJ (2004) Social influence: compliance and conformity. Annu Rev Psychol 55(1):591\u2013621","journal-title":"Annu Rev Psychol"},{"key":"1411_CR11","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"1411_CR12","doi-asserted-by":"crossref","unstructured":"Dorigo M, Di\u00a0Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), IEEE, pp 1470\u20131477","DOI":"10.1109\/CEC.1999.782657"},{"key":"1411_CR13","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. Handbook of metaheuristics pp 250\u2013285","DOI":"10.1007\/0-306-48056-5_9"},{"key":"1411_CR14","first-page":"311","volume-title":"Ant colony optimization: overview and recent advances","author":"M Dorigo","year":"2019","unstructured":"Dorigo M, St\u00fctzle T (2019) Ant colony optimization: overview and recent advances. Springer, Cham, pp 311\u2013351"},{"issue":"1","key":"1411_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"1411_CR16","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","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:600\u2013614","journal-title":"Inf Sci"},{"key":"1411_CR17","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"issue":"1","key":"1411_CR18","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.asoc.2009.12.030","volume":"11","author":"AB Hashemi","year":"2011","unstructured":"Hashemi AB, Meybodi MR (2011) A note on the learning automata based algorithms for adaptive parameter selection in PSO. Appl Soft Comput 11(1):689\u2013705","journal-title":"Appl Soft Comput"},{"key":"1411_CR19","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z et al (2019) Community-based influence maximization for viral marketing. Appl Intell 49:2137\u20132150","journal-title":"Appl Intell"},{"key":"1411_CR20","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2020","unstructured":"Huang H, Shen H, Meng Z (2020) Community-based influence maximization in attributed networks. Appl Intell 50:354\u2013364","journal-title":"Appl Intell"},{"issue":"5","key":"1411_CR21","doi-asserted-by":"publisher","first-page":"832","DOI":"10.26599\/TST.2021.9010062","volume":"27","author":"P Huang","year":"2022","unstructured":"Huang P, Guo L, Zhong Y (2022) Efficient algorithms for maximizing group influence in social networks. Tsinghua Sci Technol 27(5):832\u2013842","journal-title":"Tsinghua Sci Technol"},{"key":"1411_CR22","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, et\u00a0al (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the 25th AAAI conference on artificial intelligence, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"issue":"2","key":"1411_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan M, Mohammadi M, Meyer P et al (2022) Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur J Oper Res 296(2):393\u2013422","journal-title":"Eur J Oper Res"},{"key":"1411_CR24","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (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, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"6","key":"1411_CR25","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1007\/s11280-021-00996-y","volume":"25","author":"S Kumar","year":"2022","unstructured":"Kumar S, Gupta A, Khatri I (2022) CSR: a community based spreaders ranking algorithm for influence maximization in social networks. World Wide Web 25(6):2303\u20132322","journal-title":"World Wide Web"},{"issue":"3","key":"1411_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11334-021-00396-5","volume":"17","author":"G Kundu","year":"2021","unstructured":"Kundu G, Choudhury S (2021) A discrete genetic learning enabled PSO for targeted positive influence maximization in consumer review networks. Innov Syst Softw Eng 17(3):247\u2013259","journal-title":"Innov Syst Softw Eng"},{"key":"1411_CR27","first-page":"93","volume":"13","author":"G Kundu","year":"2022","unstructured":"Kundu G, Choudhury S (2022) Discrete genetic learning-enabled PSO for influence maximization. Adv Comput Syst Secur 13:93\u2013104","journal-title":"Adv Comput Syst Secur"},{"key":"1411_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ins.2015.04.024","volume":"316","author":"S Kundu","year":"2015","unstructured":"Kundu S, Pal SK (2015) Deprecation based greedy strategy for target set selection in large scale social networks. Inf Sci 316:107\u2013122","journal-title":"Inf Sci"},{"key":"1411_CR29","doi-asserted-by":"crossref","unstructured":"Kundu S, Murthy C, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: International conference on pattern recognition and machine intelligence, Springer, pp 242\u2013247","DOI":"10.1007\/978-3-642-21786-9_40"},{"issue":"1145\/1217299","key":"1411_CR30","first-page":"1217301","volume":"10","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007a) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 10(1145\/1217299):1217301","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1411_CR31","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, et\u00a0al (2007b) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1411_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.neucom.2017.03.003","volume":"260","author":"D Li","year":"2017","unstructured":"Li D, Wang C, Zhang S et al (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69\u201378","journal-title":"Neurocomputing"},{"key":"1411_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114207","volume":"169","author":"W Li","year":"2021","unstructured":"Li W, Zhong K, Wang J et al (2021) A dynamic algorithm based on cohesive entropy for influence maximization in social networks. Expert Syst Appl 169:114207","journal-title":"Expert Syst Appl"},{"key":"1411_CR34","unstructured":"Mehrizi MA, Cor\u00f2 F, Cruciani E, et\u00a0al (2019) Models and algorithms for election control through influence maximization. In: Proceedings of the 20th Italian conference on theoretical computer science, volume 2504 of CEUR Workshop Proceedings, pp 97\u2013103"},{"key":"1411_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119970","volume":"224","author":"H Morteza","year":"2023","unstructured":"Morteza H, Jameii SM, Sohrabi MK (2023) An improved learning automata based multi-objective whale optimization approach for multi-objective portfolio optimization in financial markets. Expert Syst Appl 224:119970","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1411_CR36","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1038\/srep01783","volume":"3","author":"L Muchnik","year":"2013","unstructured":"Muchnik L, Pei S, Parra LC et al (2013) Origins of power-law degree distribution in the heterogeneity of human activity in social networks. Sci Rep 3(1):1783","journal-title":"Sci Rep"},{"issue":"1","key":"1411_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"key":"1411_CR38","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"1411_CR39","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X et al (2017) COFIM: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100","journal-title":"Knowl Based Syst"},{"issue":"19","key":"1411_CR40","doi-asserted-by":"publisher","first-page":"14287","DOI":"10.1007\/s00500-020-05195-x","volume":"24","author":"J Sheng","year":"2020","unstructured":"Sheng J, Chen L, Chen Y et al (2020) Positive influence maximization in signed social networks under independent cascade model. Soft Comput 24(19):14287\u201314303","journal-title":"Soft Comput"},{"key":"1411_CR41","first-page":"107","volume-title":"Misinformation processing model: how users process misinformation when using recommender algorithms","author":"D Shin","year":"2024","unstructured":"Shin D (2024) Misinformation processing model: how users process misinformation when using recommender algorithms. Springer, Cham, pp 107\u2013136"},{"issue":"2","key":"1411_CR42","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/08838151.2024.2323712","volume":"68","author":"D Shin","year":"2024","unstructured":"Shin D, Akhtar F (2024) Algorithmic inoculation against misinformation: how to build cognitive immunity against misinformation. J Broadcast Electron Media 68(2):153\u2013175","journal-title":"J Broadcast Electron Media"},{"key":"1411_CR43","doi-asserted-by":"publisher","DOI":"10.1177\/10776990241246680","author":"D Shin","year":"2024","unstructured":"Shin D, Zhou S (2024) A value and diversity-aware news recommendation systems: can algorithmic gatekeeping nudge readers to view diverse news? Journal Mass Commun Q. https:\/\/doi.org\/10.1177\/10776990241246680","journal-title":"Journal Mass Commun Q"},{"issue":"5","key":"1411_CR44","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1108\/OIR-04-2023-0167","volume":"48","author":"D Shin","year":"2024","unstructured":"Shin D, Jitkajornwanich K, Lim JS et al (2024) Debiasing misinformation: how do people diagnose health recommendations from AI? Online Inf Rev 48(5):1025\u20131044","journal-title":"Online Inf Rev"},{"key":"1411_CR45","doi-asserted-by":"publisher","DOI":"10.1177\/14614448241234040","author":"D Shin","year":"2024","unstructured":"Shin D, Koerber A, Lim JS (2024) Impact of misinformation from generative ai on user information processing: how people understand misinformation from generative AI. New Media Soc. https:\/\/doi.org\/10.1177\/14614448241234040","journal-title":"New Media Soc"},{"key":"1411_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554","volume":"82","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K et al (2019) LAPSO-IM: a learning-based influence maximization approach for social networks. Appl Soft Comput 82:105554","journal-title":"Appl Soft Comput"},{"issue":"13","key":"1411_CR47","doi-asserted-by":"publisher","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2020","unstructured":"Singh SS, Singh K, Kumar A et al (2020) ACO-IM: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203","journal-title":"Soft Comput"},{"issue":"8","key":"1411_CR48","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max-min ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"issue":"6","key":"1411_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459664","volume":"54","author":"EG Talbi","year":"2021","unstructured":"Talbi EG (2021) Machine learning into metaheuristics: a survey and taxonomy. ACM Comput Surv (CSUR) 54(6):1\u201332","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1411_CR50","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y et al (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl Based Syst 160:88\u2013103","journal-title":"Knowl Based Syst"},{"key":"1411_CR51","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.physa.2018.09.040","volume":"513","author":"J Tang","year":"2019","unstructured":"Tang J, Zhang R, Yao Y et al (2019) Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Physica A Stat Mech Appl 513:477\u2013496","journal-title":"Physica A Stat Mech Appl"},{"issue":"6","key":"1411_CR52","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TSMCB.2002.1049606","volume":"32","author":"MA Thathachar","year":"2002","unstructured":"Thathachar MA, Sastry PS (2002) Varieties of learning automata: an overview. IEEE Trans Syst Man Cybern, Part B (Cybern) 32(6):711\u2013722","journal-title":"IEEE Trans Syst Man Cybern, Part B (Cybern)"},{"key":"1411_CR53","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD workshop on mining data semantics, pp 1\u20138","DOI":"10.1145\/2350190.2350193"},{"issue":"2","key":"1411_CR54","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.asoc.2009.08.040","volume":"10","author":"J Yang","year":"2010","unstructured":"Yang J, Zhuang Y (2010) An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl Soft Comput 10(2):653\u2013660","journal-title":"Appl Soft Comput"},{"key":"1411_CR55","doi-asserted-by":"crossref","unstructured":"Yin H, Benson AR, Leskovec J, et\u00a0al (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 555\u2013564","DOI":"10.1145\/3097983.3098069"},{"key":"1411_CR56","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zou K (2017) Simple ant colony algorithm for combinatorial optimization problems. In: 2017 36th Chinese control conference (CCC), IEEE, pp 9835\u20139840","DOI":"10.23919\/ChiCC.2017.8028925"},{"key":"1411_CR57","doi-asserted-by":"crossref","unstructured":"Zhao Q, Lu H, Gan Z, et\u00a0al (2015) A k-shell decomposition based algorithm for influence maximization. In: International conference on web engineering, Springer, pp 269\u2013283","DOI":"10.1007\/978-3-319-19890-3_18"},{"key":"1411_CR58","doi-asserted-by":"crossref","unstructured":"Zhong Y, Guo L, Huang P (2021) Maximizing group coverage in social networks. In: Parallel and distributed computing, applications and technologies: 21st international conference, PDCAT 2020, Shenzhen, China, December 28\u201330, 2020, Proceedings 21, Springer, pp 274\u2013284","DOI":"10.1007\/978-3-030-69244-5_24"},{"issue":"6","key":"1411_CR59","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSS.2019.2938575","volume":"6","author":"J Zhu","year":"2019","unstructured":"Zhu J, Ghosh S, Wu W (2019) Group influence maximization problem in social networks. IEEE Trans Comput Soc Syst 6(6):1156\u20131164","journal-title":"IEEE Trans Comput Soc Syst"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01411-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01411-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01411-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T10:10:54Z","timestamp":1765966254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01411-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,11]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1411"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01411-4","relation":{},"ISSN":["1869-5469"],"issn-type":[{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2025,3,11]]},"assertion":[{"value":"25 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}