{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T22:10:28Z","timestamp":1740694228683,"version":"3.38.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00500-025-10490-6","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:43:59Z","timestamp":1739839439000},"page":"1567-1585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A community-based simulated annealing approach with a new structure-based neighborhood search to identify influential nodes in social networks"],"prefix":"10.1007","volume":"29","author":[{"given":"Farzaneh Rajaee","family":"Abyaneh","sequence":"first","affiliation":[]},{"given":"Nasrollah Moghadam","family":"Charkari","sequence":"additional","affiliation":[]},{"given":"Mehdy","family":"Roayaei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"10490_CR1","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1007\/s00607-021-00945-7","volume":"103","author":"Z Aghaee","year":"2021","unstructured":"Aghaee Z, Beni MMGHA, Bouyer A (2021) A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103:2437\u20132477","journal-title":"Computing"},{"key":"10490_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-30310-2","volume":"8","author":"S Ahajjam","year":"2018","unstructured":"Ahajjam S, Badir H (2018) Identification of influential spreaders in complex networks using HybridRank algorithm. Sci Rep 8:1\u201310","journal-title":"Sci Rep"},{"key":"10490_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395:549\u2013559","journal-title":"Physica A"},{"key":"10490_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaver\u0161nik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5:129\u2013145","journal-title":"Adv Data Anal Classif"},{"key":"10490_CR5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.procs.2020.04.072","volume":"171","author":"N Bhat","year":"2020","unstructured":"Bhat N, Aggarwal N, Kumar S (2020) Identification of influential spreaders in social networks using improved hybrid rank method. Procedia Comput Sci 171:662\u2013671","journal-title":"Procedia Comput Sci"},{"key":"10490_CR6","doi-asserted-by":"crossref","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. Inf Sci 556:27\u201348","journal-title":"Inf Sci"},{"key":"10490_CR7","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109856","volume":"256","author":"TK Biswas","year":"2022","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2022) An improved clustering based multi-objective evolutionary algorithm for influence maximization under variable-length solutions. Knowl-Based Syst 256:109856","journal-title":"Knowl-Based Syst"},{"key":"10490_CR8","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"10490_CR9","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","volume":"62","author":"P Bonacich","year":"1987","unstructured":"Bonacich P (1987) Communication patterns in task-oriented groups. Am Sociol Rev 62:1170\u20131182","journal-title":"Am Sociol Rev"},{"key":"10490_CR10","doi-asserted-by":"crossref","unstructured":"Cao T, Wu X, Wang S, Hu X (2010) OASNET: an optimal allocation approach to influence maximization in modular social networks. In: Proceedings of the 2010 ACM symposium on applied computing, pp 1088\u201394","DOI":"10.1145\/1774088.1774314"},{"key":"10490_CR11","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118702","volume":"212","author":"C Dong","year":"2023","unstructured":"Dong C, Guiqiong Xu, Yang P, Meng L (2023) TSIFIM: a three-stage iterative framework for influence maximization in complex networks. Expert Syst Appl 212:118702","journal-title":"Expert Syst Appl"},{"key":"10490_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1:215\u2013239","journal-title":"Soc Netw"},{"key":"10490_CR13","first-page":"238","volume-title":"Social network: critical concepts in sociology","author":"LC Freeman","year":"2002","unstructured":"Freeman LC (2002) Centrality in social networks: conceptual clarification. Social network: critical concepts in sociology, vol 1. Routledge, Londres, pp 238\u2013263"},{"key":"10490_CR14","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014Part I. ORSA J Comput 1:90\u2013206","journal-title":"ORSA J Comput"},{"key":"10490_CR15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014Part 2. ORSA J Comput 2:4\u201332","journal-title":"ORSA J Comput"},{"key":"10490_CR16","unstructured":"Goldberg DE (1989) Cenetic algorithms in search. Optim Mach Learn"},{"key":"10490_CR17","first-page":"1","volume":"9","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad Mark Sci Rev 9:1\u201318","journal-title":"Acad Mark Sci Rev"},{"key":"10490_CR18","doi-asserted-by":"crossref","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, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600\u2013614","journal-title":"Inf Sci"},{"key":"10490_CR19","first-page":"361","volume":"54","author":"C Gou","year":"2017","unstructured":"Gou C, Du P, Min H, Yue L, Xueqi C (2017) Tsk-shell: an algorithm for finding topic-sensitive influential spreaders. J Comput Res Develop 54:361\u2013368","journal-title":"J Comput Res Develop"},{"key":"10490_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (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"},{"key":"10490_CR21","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K (2011a) Simulated annealing based influence maximization in social networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"10490_CR22","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K (2011b) Simulated annealing based influence maximization in social networks. In: Proceedings of the AAAI conference on artificial intelligence, pp 127\u201332","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"10490_CR23","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K (2011c) Simulated annealing based influence maximization in social networks. In: Twenty-fifth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"10490_CR24","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003a) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"10490_CR25","unstructured":"Kempe D, Kleinberg J, Tardos E (2003b) Mining the network value of customers. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u201346"},{"key":"10490_CR26","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Lev Muchnik H, Stanley E, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888\u2013893","journal-title":"Nat Phys"},{"key":"10490_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007a) The dynamics of viral marketing. ACM Trans Web (TWEB) 1:5","journal-title":"ACM Trans Web (TWEB)"},{"key":"10490_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007b) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data (ACM TKDD) 1","DOI":"10.1145\/1217299.1217301"},{"key":"10490_CR29","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007c) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u201329","DOI":"10.1145\/1281192.1281239"},{"key":"10490_CR30","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6:29\u2013123","journal-title":"Internet Math"},{"key":"10490_CR31","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.cam.2018.05.051","volume":"320","author":"C Li","year":"2018","unstructured":"Li C, Wang L, Sun S, Xia C (2018) Identification of influential spreaders based on classified neighbors in real-world complex networks. Appl Math Comput 320:512\u2013523","journal-title":"Appl Math Comput"},{"key":"10490_CR32","volume":"61","author":"Y Li","year":"2024","unstructured":"Li Y, Tun Lu, Li W, Zhang P (2024) HCCKshell: a heterogeneous cross-comparison improved Kshell algorithm for influence maximization. Inf Process Manag 61:103681","journal-title":"Inf Process Manag"},{"key":"10490_CR33","doi-asserted-by":"crossref","first-page":"3767","DOI":"10.1007\/s12652-021-03510-4","volume":"14","author":"I Lozano-Osorio","year":"2023","unstructured":"Lozano-Osorio I, S\u00e1nchez-Oro J, Duarte A, Cord\u00f3n \u00d3 (2023) A quick GRASP-based method for influence maximization in social networks. J Ambient Intell Humaniz Comput 14:3767\u20133779","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"10490_CR34","first-page":"1","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Zhou T, Zhang Q-M, Eugene Stanley H (2016) The H-index of a network node and its relation to degree and coreness. Nat Commun 7:1\u20137","journal-title":"Nat Commun"},{"key":"10490_CR35","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait? Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"10490_CR36","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"L-L Ma","year":"2016","unstructured":"Ma L-L, Ma C, Zhang H-F, Wang B-H (2016) Identifying influential spreaders in complex networks based on gravity formula. Physica A 451:205\u2013212","journal-title":"Physica A"},{"key":"10490_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2019.101055","volume":"39","author":"G Maji","year":"2020","unstructured":"Maji G (2020) Influential spreaders identification in complex networks with potential edge weight based k-shell degree neighborhood method. J Comput Sci 39:101055","journal-title":"J Comput Sci"},{"key":"10490_CR38","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113681","volume":"161","author":"G Maji","year":"2020","unstructured":"Maji G, Mandal S, Sen S (2020a) A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques. Expert Syst Appl 161:113681","journal-title":"Expert Syst Appl"},{"key":"10490_CR39","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.113092","volume":"144","author":"G Maji","year":"2020","unstructured":"Maji G, Namtirtha A, Dutta A, Malta MC (2020b) Influential spreaders identification in complex networks with improved k-shell hybrid method. Expert Syst Appl 144:113092","journal-title":"Expert Syst Appl"},{"key":"10490_CR40","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2022.101591","volume":"60","author":"L Meng","year":"2022","unstructured":"Meng L, Guiqiong Xu, Yang P, Dengqin Tu (2022) A novel potential edge weight method for identifying influential nodes in complex networks based on neighborhood and position. J Comput Sci 60:101591","journal-title":"J Comput Sci"},{"key":"10490_CR41","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087\u20131092","journal-title":"J Chem Phys"},{"key":"10490_CR42","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103:8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"10490_CR43","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B Pittel","year":"1996","unstructured":"Pittel B, Spencer J, Wormald N (1996) Sudden emergence of a giant k-core in a random graph. J Comb Theory Ser B 67:111\u2013151","journal-title":"J Comb Theory Ser B"},{"issue":"6","key":"10490_CR44","doi-asserted-by":"crossref","first-page":"3406","DOI":"10.1109\/TCSS.2022.3198096","volume":"10","author":"B Razaghi","year":"2022","unstructured":"Razaghi B, Roayaei M, Charkari NM (2022) On the group-fairness-aware influence maximization in social networks. IEEE Trans Comput Soc Syst 10(6):3406\u20133414","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"10490_CR45","doi-asserted-by":"crossref","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: The Semantic Web-ISWC 2003: second international semantic web conference, Sanibel Island, FL, USA, October 20\u201323, 2003. Proceedings 2, pp 351\u201368. Springer","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"10490_CR46","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2021.126258","volume":"582","author":"AM Samir","year":"2021","unstructured":"Samir AM, Rady S, Gharib TF (2021) LKG: a fast scalable community-based approach for influence maximization problem in social networks. Physica A 582:126258","journal-title":"Physica A"},{"key":"10490_CR47","volume":"120","author":"PG Sun","year":"2021","unstructured":"Sun PG, Miao Q, Staab S (2021) Community-based k-shell decomposition for identifying influential spreaders. Pattern Recogn 120:108130","journal-title":"Pattern Recogn"},{"key":"10490_CR48","doi-asserted-by":"crossref","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, Rongjing Hu, Yang F, Zhao Z, Yuan Y (2019) Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Physica A 513:477\u2013496","journal-title":"Physica A"},{"key":"10490_CR49","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan Li, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl-Based Syst 187:104833","journal-title":"Knowl-Based Syst"},{"key":"10490_CR50","doi-asserted-by":"crossref","first-page":"11041","DOI":"10.1007\/s00500-023-08391-7","volume":"27","author":"M Venunath","year":"2023","unstructured":"Venunath M, Sujatha P, Dharavath S, Natarajasivan D, Koti P (2023) Efficient method for identifying prominent supplier in large-scale healthcare information networks in Medicare. Soft Comput 27:11041\u201311052","journal-title":"Soft Comput"},{"key":"10490_CR51","doi-asserted-by":"crossref","unstructured":"Wang P, Zhang R (2024) Influence maximization in social networks using an improved multi-objective particle swarm optimization. Comput J bxad128","DOI":"10.1093\/comjnl\/bxad128"},{"key":"10490_CR52","first-page":"388","volume":"334","author":"J Wang","year":"2018","unstructured":"Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388\u2013400","journal-title":"Appl Math Comput"},{"key":"10490_CR53","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.future.2021.01.025","volume":"118","author":"Z Wang","year":"2021","unstructured":"Wang Z, Sun C, Xi J, Li X (2021) Influence maximization in social graphs based on community structure and node coverage gain. Future Gener Comput Syst 118:327\u2013338","journal-title":"Future Gener Comput Syst"},{"key":"10490_CR54","doi-asserted-by":"crossref","first-page":"101955","DOI":"10.1016\/j.jocs.2023.101955","volume":"67","author":"C Wang","year":"2023","unstructured":"Wang C, Ma L, Ma L, Lai JW, Zhao J, Wang L, Cheong KH (2023) Identification of influential users with cost minimization via an improved moth flame optimization. J Comput Sci 67:101955","journal-title":"J Comput Sci"},{"key":"10490_CR55","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.jocs.2018.12.010","volume":"31","author":"M Weskida","year":"2019","unstructured":"Weskida M, Michalski R (2019) Finding influentials in social networks using evolutionary algorithm. J Comput Sci 31:77\u201385","journal-title":"J Comput Sci"},{"key":"10490_CR56","volume":"238","author":"Q Yang","year":"2024","unstructured":"Yang Q, Wang Y, Senbin Yu, Wang W (2024) Identifying influential nodes through an improved k-shell iteration factor model. Expert Syst Appl 238:122077","journal-title":"Expert Syst Appl"},{"key":"10490_CR57","volume":"551","author":"Z-J Zhao","year":"2019","unstructured":"Zhao Z-J, Guo Q, Kai Yu, Liu J-G (2019) Identifying influential nodes for the networks with community structure. Physica A 551:123893","journal-title":"Physica A"},{"key":"10490_CR58","volume":"551","author":"Z-J Zhao","year":"2020","unstructured":"Zhao Z-J, Guo Q, Kai Yu, Liu J-G (2020) Identifying influential nodes for the networks with community structure. Physica A 551:123893","journal-title":"Physica A"},{"key":"10490_CR59","volume":"25","author":"N Zhao","year":"2023","unstructured":"Zhao N, Wang H, Wen J-J, Li J, Jing M, Wang J (2023) Identifying critical nodes in complex networks based on neighborhood information. New J Phys 25:083020","journal-title":"New J Phys"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10490-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T21:46:32Z","timestamp":1740692792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10490-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10490"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10490-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Hereby, the authors consciously assure that for the manuscript entitled \"A community-based Simulated Annealing approach with a new structure-based neighborhood search to identify influential nodes in social networks\", the following is fulfilled:","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical statement"}}]}}