{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:12:38Z","timestamp":1758078758705,"version":"3.44.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}]},{"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 Technological Innovation Guidance Plan","award":["24CXGA046"],"award-info":[{"award-number":["24CXGA046"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07831-5","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T08:45:15Z","timestamp":1758012315000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A layer weight-driven evolutionary optimization for influence maximization problem in multilayer social networks"],"prefix":"10.1007","volume":"81","author":[{"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jitao","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenshuo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"7831_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100393.127195","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Ben-Romdhane L (2021) New trends in influence maximization models. Comput Sci Rev. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100393.127195","journal-title":"Comput Sci Rev"},{"issue":"9","key":"7831_CR2","doi-asserted-by":"publisher","first-page":"6162","DOI":"10.1109\/TII.2020.3026013","volume":"17","author":"A Castiglione","year":"2021","unstructured":"Castiglione A, Cozzolino G, Moscato F, Moscato V (2021) Cognitive analysis in social networks for viral marketing. IEEE Trans Ind Inf 17(9):6162\u20136169. https:\/\/doi.org\/10.1109\/TII.2020.3026013","journal-title":"IEEE Trans Ind Inf"},{"key":"7831_CR3","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 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 137\u2013146. https:\/\/doi.org\/10.4086\/toc.2015.v011a004","DOI":"10.4086\/toc.2015.v011a004"},{"issue":"2","key":"7831_CR4","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1109\/TCYB.2019.2917059","volume":"51","author":"S Wang","year":"2021","unstructured":"Wang S, Liu J, Jin Y (2021) Finding influential nodes in multiplex networks using a memetic algorithm. IEEE Trans Cybern 51(2):900\u2013912. https:\/\/doi.org\/10.1109\/TCYB.2019.2917059","journal-title":"IEEE Trans Cybern"},{"key":"7831_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.14.021007","author":"G Nicoletti","year":"2024","unstructured":"Nicoletti G, Busiello DM (2024) Information propagation in multilayer systems with higher-order interactions across timescales. Phys Rev X. https:\/\/doi.org\/10.1103\/PhysRevX.14.021007","journal-title":"Phys Rev X"},{"issue":"1","key":"7831_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"S Boccaletti","year":"2014","unstructured":"Boccaletti S, Bianconi G, Criado R, Genio CID, G\u00f3mez-Gardenes J (2014) The structure and dynamics of multilayer networks. Phys Rep 544(1):1\u2013122. https:\/\/doi.org\/10.1016\/j.physrep.2014.07.001","journal-title":"Phys Rep"},{"key":"7831_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2024.102466","volume":"127","author":"S Wang","year":"2025","unstructured":"Wang S, Liu W, Chen L, Zong S (2025) Influence maximization based on discrete particle swarm optimization on multilayer network. Inf Syst 127:102466. https:\/\/doi.org\/10.1016\/j.is.2024.102466","journal-title":"Inf Syst"},{"key":"7831_CR8","doi-asserted-by":"publisher","first-page":"108750","DOI":"10.1016\/j.asoc.2022.108750","volume":"121","author":"S Wang","year":"2022","unstructured":"Wang S, Tan X (2022) Solving the robust influence maximization problem on multi-layer networks via a memetic algorithm. Appl Soft Comput 121:108750. https:\/\/doi.org\/10.1016\/j.asoc.2022.108750","journal-title":"Appl Soft Comput"},{"key":"7831_CR9","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.ins.2022.07.103","volume":"609","author":"KV Rao","year":"2022","unstructured":"Rao KV, Chowdary CR (2022) CBIM: community-based influence maximization in multilayer networks. Inf Sci 609:578\u2013594. https:\/\/doi.org\/10.1016\/j.ins.2022.07.103","journal-title":"Inf Sci"},{"key":"7831_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109916","volume":"234","author":"KV Rao","year":"2023","unstructured":"Rao KV, Chowdary CR (2023) K++Shell: influence maximization in multilayer networks using community detection. Comput Netw 234:109916. https:\/\/doi.org\/10.1016\/j.comnet.2023.109916","journal-title":"Comput Netw"},{"key":"7831_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TNSE.2022.3208343","volume":"10","author":"C Ni","year":"2022","unstructured":"Ni C, Yang J, Pang Z, Gong Y (2022) Seeding strategy based on weighted gravity centrality in multiplex networks. IEEE Trans Netw Sci Eng 10:331\u2013345. https:\/\/doi.org\/10.1109\/TNSE.2022.3208343","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"7831_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122171","volume":"238","author":"L Lv","year":"2024","unstructured":"Lv L, Zhang T, Hu P, Bardou D, Niu S, Zheng Z, Yu G, Wu H (2024) An improved gravity centrality for finding important nodes in multi-layer networks based on multi-pagerank. Expert Syst Appl 238:122171. https:\/\/doi.org\/10.1016\/j.eswa.2023.122171","journal-title":"Expert Syst Appl"},{"key":"7831_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113769","volume":"173","author":"X Zhou","year":"2023","unstructured":"Zhou X, Bouyer A, Maleki M, Mohammadi M, Arasteh B (2023) Identifying top influential spreaders based on the influence weight of layers in multiplex networks. Chaos Solitons Fractals 173:113769. https:\/\/doi.org\/10.1016\/j.chaos.2023.113769","journal-title":"Chaos Solitons Fractals"},{"issue":"21","key":"7831_CR14","doi-asserted-by":"publisher","first-page":"25070","DOI":"10.1007\/s10489-023-04884-y","volume":"53","author":"J Tang","year":"2023","unstructured":"Tang J, Song S, Lan J, Zhang L, Zhao F (2023) Steering the spread of influence adaptively in social networks via a discrete scheduled particle swarm optimization. Appl Intell 53(21):25070\u201325091. https:\/\/doi.org\/10.1007\/s10489-023-04884-y","journal-title":"Appl Intell"},{"key":"7831_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127195","volume":"572","author":"E Zhu","year":"2024","unstructured":"Zhu E, Wang H, Zhang Y, Zhang K, Liu C (2024) PHEE: identifying influential nodes in social networks with a phased evaluation-enhanced search. Neurocomputing 572:127195. https:\/\/doi.org\/10.1016\/j.neucom.2023.127195","journal-title":"Neurocomputing"},{"key":"7831_CR16","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 420\u2013429. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"2","key":"7831_CR17","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/TKDE.2021.3093934","volume":"35","author":"Y Zhu","year":"2023","unstructured":"Zhu Y, Tang J, Tang X, Wang S, Lim A (2023) 2-hop+ sampling: efficient and effective influence estimation. IEEE Trans Knowl Data Eng 35(2):1088\u20131103. https:\/\/doi.org\/10.1109\/TKDE.2021.3093934","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"7831_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112513","volume":"162","author":"Y Wang","year":"2022","unstructured":"Wang Y, Li H, Zhang L, Zhao L, Li W (2022) Identifying influential nodes in social networks: centripetal centrality and seed exclusion approach. Chaos Solitons Fractals 162:112513. https:\/\/doi.org\/10.1016\/j.chaos.2022.112513","journal-title":"Chaos Solitons Fractals"},{"key":"7831_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.127314","volume":"598","author":"F Kazemzadeh","year":"2022","unstructured":"Kazemzadeh F, Safaei AA, Mirzarezaee M (2022) Influence maximization in social networks using effective community detection. Physica A 598:127314. https:\/\/doi.org\/10.1016\/j.physa.2022.127314","journal-title":"Physica A"},{"key":"7831_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.102002","author":"J Tang","year":"2025","unstructured":"Tang J, Fu J, Li X, Geng L, Pang J (2025) Probing the fitness landscape of the influential nodes for the influence maximization problem in social networks. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2025.102002","journal-title":"Swarm Evol Comput"},{"key":"7831_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2024.102183","author":"J Tang","year":"2024","unstructured":"Tang J, Qu J, Song S, Zhao Z, Du Q (2024) GCNT: identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers. J King Saud Univ Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2024.102183","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"9","key":"7831_CR22","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1038\/s41567-023-02132-1","volume":"19","author":"M De Domenico","year":"2023","unstructured":"De Domenico M (2023) More is different in real-world multilayer networks. Nat Phys 19(9):1247\u20131262. https:\/\/doi.org\/10.1038\/s41567-023-02132-1","journal-title":"Nat Phys"},{"key":"7831_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125990","volume":"266","author":"O Achour","year":"2025","unstructured":"Achour O, Romdhane LB (2025) A theoretical review on multiplex influence maximization models: theories, methods, challenges, and future directions. Expert Syst Appl 266:125990. https:\/\/doi.org\/10.1016\/j.eswa.2024.125990","journal-title":"Expert Syst Appl"},{"issue":"2","key":"7831_CR24","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TCSS.2018.2813262","volume":"5","author":"A Kuhnle","year":"2018","unstructured":"Kuhnle A, Alim MA, Li X, Zhang H, Thai MT (2018) Multiplex influence maximization in online social networks with heterogeneous diffusion models. IEEE Trans Comput Soc Syst 5(2):418\u2013429. https:\/\/doi.org\/10.1109\/TCSS.2018.2813262","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"5","key":"7831_CR25","doi-asserted-by":"publisher","first-page":"5173","DOI":"10.1007\/s10489-021-02656-0","volume":"52","author":"K Venkatakrishna Rao","year":"2022","unstructured":"Venkatakrishna Rao K, Katukuri M, Jagarapu M (2022) CIM: Clique-based heuristic for finding influential nodes in multilayer networks. Appl Intell 52(5):5173\u20135184. https:\/\/doi.org\/10.1007\/s10489-021-02656-0","journal-title":"Appl Intell"},{"issue":"1","key":"7831_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TNSE.2017.2775152","volume":"6","author":"P Basaras","year":"2019","unstructured":"Basaras P, Iosifidis G, Katsaros D, Tassiulas L (2019) Identifying influential spreaders in complex multilayer networks: a centrality perspective. IEEE Trans Netw Sci Eng 6(1):31\u201345. https:\/\/doi.org\/10.1109\/TNSE.2017.2775152","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"2","key":"7831_CR27","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1109\/TCSS.2023.3297902","volume":"11","author":"L Lv","year":"2024","unstructured":"Lv L, Hu P, Zheng Z, Bardou D, Zhang T, Wu H, Niu S, Yu G (2024) A community-based centrality measure for identifying key nodes in multilayer networks. IEEE Trans Comput Soc Syst 11(2):2448\u20132463. https:\/\/doi.org\/10.1109\/TCSS.2023.3297902","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"6","key":"7831_CR28","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1109\/TCSS.2022.3161305","volume":"9","author":"L Wan","year":"2022","unstructured":"Wan L, Zhang M, Li X, Sun L, Wang X, Liu K (2022) Identification of important nodes in multilayer heterogeneous networks incorporating multirelational information. IEEE Trans Comput Soc Syst 9(6):1715\u20131724. https:\/\/doi.org\/10.1109\/TCSS.2022.3161305","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"7831_CR29","doi-asserted-by":"publisher","first-page":"4318","DOI":"10.1109\/ACCESS.2019.2963100","volume":"8","author":"L Qiu","year":"2020","unstructured":"Qiu L, Tian X, Sai S, Gu C (2020) LGIM: a global selection algorithm based on local influence for influence maximization in social networks. IEEE Access 8:4318\u20134328. https:\/\/doi.org\/10.1109\/ACCESS.2019.2963100","journal-title":"IEEE Access"},{"key":"7831_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102973","volume":"178","author":"L Qiu","year":"2021","unstructured":"Qiu L, Tian X, Zhang J, Gu C, Sai S (2021) LIDDE: a differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks. J Netw Comput Appl 178:102973. https:\/\/doi.org\/10.1016\/j.jnca.2020.102973","journal-title":"J Netw Comput Appl"},{"key":"7831_CR31","doi-asserted-by":"publisher","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 L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl Based Syst 187:104833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Knowl Based Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07831-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07831-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07831-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T08:45:16Z","timestamp":1758012316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07831-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":31,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7831"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07831-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"21 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1344"}}