{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:00:54Z","timestamp":1778212854610,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:00:00Z","timestamp":1748390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:00:00Z","timestamp":1748390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01181-y","type":"journal-article","created":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:50:52Z","timestamp":1748440252000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Overlapping community-based fair influence maximization under a multi-transformation optimization algorithm"],"prefix":"10.1186","volume":"12","author":[{"given":"Chunfeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zegang","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingru","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Rezaeipanah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,28]]},"reference":[{"key":"1181_CR1","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. PHEE: Identifying influential nodes in social networks with a phased evaluation-enhanced search. Neurocomputing. 2024;572: 127195.","journal-title":"Neurocomputing"},{"issue":"8","key":"1181_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3653711","volume":"56","author":"A Saxena","year":"2024","unstructured":"Saxena A, Fletcher G, Pechenizkiy M. Fairsna: algorithmic fairness in social network analysis. ACM Comput Surv. 2024;56(8):1\u201345.","journal-title":"ACM Comput Surv"},{"issue":"6","key":"1181_CR3","doi-asserted-by":"publisher","first-page":"3406","DOI":"10.1109\/TCSS.2022.3198096","volume":"10","author":"B Razaghi","year":"2022","unstructured":"Razaghi B, Roayaei M, Charkari NM. On the group-fairness-aware influence maximization in social networks. IEEE Transact Computat Soc Syst. 2022;10(6):3406\u201314.","journal-title":"IEEE Transact Computat Soc Syst"},{"key":"1181_CR4","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M. Mining the network value of customers. In\u00a0Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 2001: pp. 57\u201366.","DOI":"10.1145\/502512.502525"},{"key":"1181_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1186\/s40537-025-01159-w","volume":"12","author":"X Wang","year":"2025","unstructured":"Wang X, Wang Z. Identifying influential nodes in weighted complex networks by considering the importance of shortest paths. J Big Data. 2025;12:100.","journal-title":"J Big Data"},{"issue":"1","key":"1181_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/TETC.2024.3403891","volume":"13","author":"K Ma","year":"2024","unstructured":"Ma K, Xu X, Yang H, Cao R, Zhang L. Fair influence maximization in social networks: a community-based evolutionary algorithm. IEEE Trans Emerg Top Comput. 2024;13(1):262\u201375.","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"1181_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.129687","volume":"629","author":"L Chen","year":"2025","unstructured":"Chen L, Rezaeipanah A. SFIMCO: scalable fair influence maximization based on overlapping communities and optimization algorithms. Neurocomputing. 2025;629: 129687.","journal-title":"Neurocomputing"},{"key":"1181_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.129123","volume":"618","author":"Y Peng","year":"2025","unstructured":"Peng Y, Zhao Y, Dong J, Hu J. Adaptive opinion dynamics over community networks when agents cannot express opinions freely. Neurocomputing. 2025;618: 129123.","journal-title":"Neurocomputing"},{"key":"1181_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.ins.2022.11.101","volume":"621","author":"Y Peng","year":"2023","unstructured":"Peng Y, Zhao Y, Hu J. On the role of community structure in evolution of opinion formation: a new bounded confidence opinion dynamics. Inf Sci. 2023;621:672\u201390.","journal-title":"Inf Sci"},{"key":"1181_CR10","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1613\/jair.1.14450","volume":"76","author":"M Lin","year":"2023","unstructured":"Lin M, Sun L, Yang R, Liu X, Wang Y, Li D, Li W, Lu S. Fair influence maximization in large-scale social networks based on attribute-aware reverse influence sampling. J Artific Intell Res. 2023;76:925\u201357.","journal-title":"J Artific Intell Res"},{"issue":"3","key":"1181_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2015","unstructured":"Gupta A, Ong YS, Feng L. Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput. 2015;20(3):343\u201357.","journal-title":"IEEE Trans Evol Comput"},{"key":"1181_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12559-018-9620-7","volume":"11","author":"A Gupta","year":"2019","unstructured":"Gupta A, Ong YS. Back to the roots: multi-x evolutionary computation. Cogn Comput. 2019;11:1\u201317.","journal-title":"Cogn Comput"},{"key":"1181_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 2007: pp. 420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"1181_CR14","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S. Efficient influence maximization in social networks. In\u00a0Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 2009. (pp. 199\u2013208).","DOI":"10.1145\/1557019.1557047"},{"issue":"10","key":"1181_CR15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0164393","volume":"11","author":"X Wang","year":"2016","unstructured":"Wang X, Zhang X, Zhao C, Yi D. Maximizing the spread of influence via generalized degree discount. PLoS ONE. 2016;11(10): e0164393.","journal-title":"PLoS ONE"},{"issue":"3","key":"1181_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Song C, Duan C, Ma L, Shen B. An efficient memetic algorithm for influence maximization in social networks. IEEE Comput Intell Mag. 2016;11(3):22\u201333.","journal-title":"IEEE Comput Intell Mag"},{"key":"1181_CR17","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, Ma L, Cai Q. Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci. 2016;367:600\u201314.","journal-title":"Inf Sci"},{"key":"1181_CR18","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, Biswas B. LAPSO-IM: a learning-based influence maximization approach for social networks. Appl Soft Comput. 2019;82: 105554.","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1181_CR19","doi-asserted-by":"publisher","first-page":"435","DOI":"10.3390\/sym17030435","volume":"17","author":"B Chai","year":"2025","unstructured":"Chai B, Fu J, Zhang R, Tang J. A landscape-aware discrete particle swarm optimization for the influence maximization problem in social networks. Symmetry. 2025;17(3):435.","journal-title":"Symmetry"},{"issue":"1","key":"1181_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCI.2022.3222050","volume":"18","author":"C Wang","year":"2023","unstructured":"Wang C, Zhao J, Li L, Jiao L, Liu J, Wu K. A multi-transformation evolutionary framework for influence maximization in social networks. IEEE Comput Intell Mag. 2023;18(1):52\u201367.","journal-title":"IEEE Comput Intell Mag"},{"issue":"4","key":"1181_CR21","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TETCI.2021.3136643","volume":"7","author":"L Ma","year":"2022","unstructured":"Ma L, Shao Z, Li X, Lin Q, Li J, Leung VC, Nandi AK. Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Transact Emerg Topics Computat Intellig. 2022;7(4):995\u20131009.","journal-title":"IEEE Transact Emerg Topics Computat Intellig"},{"key":"1181_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2024.115192","volume":"186","author":"P Wei","year":"2024","unstructured":"Wei P, Zhou J, Yan B, Zeng Y. ENIMNR: enhanced node influence maximization through node representation in social networks. Chaos Solitons Fractals. 2024;186: 115192.","journal-title":"Chaos Solitons Fractals"},{"issue":"1","key":"1181_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00607-024-01376-w","volume":"107","author":"H Li","year":"2025","unstructured":"Li H, Tian Z, Li X, Arebi P. Identifying effective nodes in term of the influence maximization on the social IoT networks using deep learning-based node embedding. Computing. 2025;107(1):1\u201334.","journal-title":"Computing"},{"key":"1181_CR24","doi-asserted-by":"crossref","unstructured":"Rahmattalabi A, Jabbari S, Lakkaraju H, Vayanos P, Izenberg M, Brown R, Rice E, Tambe M. Fair influence maximization: a welfare optimization approach. In\u00a0Proceedings of the AAAI Conference on Artificial Intelligence. 2021: 35(13), pp. 11630\u201311638.","DOI":"10.1609\/aaai.v35i13.17383"},{"issue":"3","key":"1181_CR25","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1049\/cit2.12158","volume":"8","author":"L Zhang","year":"2023","unstructured":"Zhang L, Liu Y, Yang H, Cheng F, Liu Q, Zhang X. Overlapping community-based particle swarm optimization algorithm for influence maximization in social networks. CAAI Transact Intellig Technol. 2023;8(3):893\u2013913.","journal-title":"CAAI Transact Intellig Technol"},{"key":"1181_CR26","doi-asserted-by":"crossref","unstructured":"Zhao Z, Li W, Ma J, Jiang J, Bai Q. Fair influence maximization in social networks: a group-fairness-aware multi-objective grey wolf optimizer. In\u00a02024 IEEE International Conference on Agents (ICA)\u00a0(pp. 88\u201393). IEEE. 2024.","DOI":"10.1109\/ICA63002.2024.00026"},{"key":"1181_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li J, Cai T, Deng K, Wang X, Sellis T, Xia F. Community-diversified influence maximization in social networks. Inf Syst. 2020;92: 101522.","journal-title":"Inf Syst"},{"key":"1181_CR28","doi-asserted-by":"crossref","unstructured":"Tsang A, Wilder B, Rice E, Tambe M, Zick Y. Group-fairness in influence maximization.\u00a0in Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019: pp. 5997\u20136005.","DOI":"10.24963\/ijcai.2019\/831"},{"issue":"3","key":"1181_CR29","doi-asserted-by":"publisher","DOI":"10.18280\/ria.380327","volume":"38","author":"S Dharavath","year":"2024","unstructured":"Dharavath S, Devarajan N, Chidambaram N. An influence maximization in social networks based on community structure (IMSC). Revue d\u2019Intelligence Artificielle. 2024;38(3): p1017.","journal-title":"Revue d'Intelligence Artificielle"},{"issue":"3","key":"1181_CR30","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S, Kert\u00e9sz J. Detecting the overlapping and hierarchical community structure in complex networks. New J Phys. 2009;11(3): 033015.","journal-title":"New J Phys"},{"issue":"4","key":"1181_CR31","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S. Finding statistically significant communities in networks. PLoS ONE. 2011;6(4): e18961.","journal-title":"PLoS ONE"},{"key":"1181_CR32","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J. Overlapping community detection at scale: a nonnegative matrix factorization approach. In\u00a0Proceedings of the sixth ACM international conference on Web search and data mining. 2013: pp. 587\u2013596.","DOI":"10.1145\/2433396.2433471"},{"key":"1181_CR33","unstructured":"Xie J, Szymanski BK. Towards linear time overlapping community detection in social networks. In\u00a0advances in knowledge discovery and data mining: 16th Pacific-Asia Conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29\u2013June 1, 2012, Proceedings, Part II 16\u00a0(pp. 25\u201336). Springer Berlin Heidelberg. 2012."},{"issue":"8","key":"1181_CR34","volume":"2023","author":"C Xiao","year":"2023","unstructured":"Xiao C, Wang Y, Wang S. Machine learning to set hyperparameters for overlapping community detection algorithms. J Eng. 2023;2023(8): e12292.","journal-title":"J Eng"},{"key":"1181_CR35","doi-asserted-by":"crossref","unstructured":"Kuzmin K, Shah SY, Szymanski BK. Parallel overlapping community detection with SLPA. In\u00a02013 International Conference on Social Computing. 2013. (pp. 204\u2013212). IEEE.","DOI":"10.1109\/SocialCom.2013.37"},{"key":"1181_CR36","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K. Simulated annealing based influence maximization in social networks. In\u00a0Proceedings of the AAAI conference on artificial intelligence. 2011: 25(1); 127\u2013132).","DOI":"10.1609\/aaai.v25i1.7838"},{"issue":"3","key":"1181_CR37","first-page":"2875","volume":"35","author":"J Ali","year":"2021","unstructured":"Ali J, Babaei M, Chakraborty A, Mirzasoleiman B, Gummadi KP, Singla A. On the fairness of time-critical influence maximization in social networks. IEEE Trans Knowl Data Eng. 2021;35(3):2875\u201386.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1181_CR38","first-page":"66675","volume":"36","author":"X Rui","year":"2023","unstructured":"Rui X, Wang Z, Zhao J, Sun L, Chen W. Scalable fair influence maximization. Adv Neural Inf Process Syst. 2023;36:66675\u201391.","journal-title":"Adv Neural Inf Process Syst"},{"key":"1181_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2019.105094","volume":"83","author":"DA Vega-Oliveros","year":"2020","unstructured":"Vega-Oliveros DA, da Fontoura Costa L, Rodrigues FA. Influence maximization by rumor spreading on correlated networks through community identification. Commun Nonlinear Sci Numer Simul. 2020;83: 105094.","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"1","key":"1181_CR40","doi-asserted-by":"publisher","first-page":"11","DOI":"10.54216\/JAIM.090102","volume":"9","author":"KSh Gaber","year":"2025","unstructured":"Gaber KSh, Singla MK. Predictive analysis of groundwater resources using random forest regression. J Artific Intell Metaheurist. 2025;9(1):11\u20139.","journal-title":"J Artific Intell Metaheurist"},{"issue":"2","key":"1181_CR41","doi-asserted-by":"publisher","first-page":"47","DOI":"10.54216\/MOR.030205","volume":"3","author":"ME Mohamed","year":"2025","unstructured":"Mohamed ME. A review on waste management techniques for sustainable energy production. Metaheuristic Optimizat Rev. 2025;3(2):47\u201358.","journal-title":"Metaheuristic Optimizat Rev"},{"key":"1181_CR42","doi-asserted-by":"publisher","first-page":"74449","DOI":"10.1109\/ACCESS.2022.3190508","volume":"10","author":"DS Khafaga","year":"2022","unstructured":"Khafaga DS, Alhussan AA, El-Kenawy ESM, Ibrahim A, Eid MM, Abdelhamid AA. Solving optimization problems of metamaterial and double T-shape antennas using advanced meta-heuristics algorithms. IEEE Access. 2022;10:74449\u201371.","journal-title":"IEEE Access"},{"issue":"10","key":"1181_CR43","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech: Theory Exp. 2008;2008(10):P10008.","journal-title":"J Stat Mech: Theory Exp"},{"issue":"1","key":"1181_CR44","doi-asserted-by":"publisher","first-page":"749","DOI":"10.32604\/cmc.2022.029605","volume":"73","author":"DS Khafaga","year":"2022","unstructured":"Khafaga DS, Alhussan AA, El-kenawy ESM, Takieldeen AE, Hassan TM, Hegazy EA, Eid EA, Ibrahim A, Abdelhamid AA. Meta-heuristics for feature selection and classification in diagnostic breast cancer. Comput Mater Continua. 2022;73(1):749\u201365.","journal-title":"Comput Mater Continua"},{"issue":"7","key":"1181_CR45","doi-asserted-by":"publisher","first-page":"5760","DOI":"10.1109\/JIOT.2019.2937110","volume":"7","author":"G Sun","year":"2019","unstructured":"Sun G, Xu Z, Yu H, Chen X, Chang V, Vasilakos AV. Low-latency and resource-efficient service function chaining orchestration in network function virtualization. IEEE Internet Things J. 2019;7(7):5760\u201372.","journal-title":"IEEE Internet Things J"},{"issue":"11","key":"1181_CR46","doi-asserted-by":"publisher","first-page":"16313","DOI":"10.1109\/TNNLS.2023.3293689","volume":"35","author":"H Li","year":"2023","unstructured":"Li H, Xia C, Wang T, Wang Z, Cui P, Li X. Grass: learning spatial\u2013temporal properties from chainlike cascade data for microscopic diffusion prediction. IEEE Transact Neural Netw Learn Syst. 2023;35(11):16313\u201327.","journal-title":"IEEE Transact Neural Netw Learn Syst"},{"issue":"CoNEXT3","key":"1181_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3676870","volume":"2","author":"S Zhang","year":"2024","unstructured":"Zhang S, Li T, Jin D, Li Y. NetDiff: a service-guided hierarchical diffusion model for network flow trace generation. Proceed ACM Network. 2024;2(CoNEXT3):1\u201321.","journal-title":"Proceed ACM Network"},{"issue":"4","key":"1181_CR48","doi-asserted-by":"publisher","first-page":"4369","DOI":"10.1109\/TNSM.2024.3416947","volume":"21","author":"Y Ma","year":"2024","unstructured":"Ma Y, Li T, Zhou Y, Yu L, Jin D. Mitigating energy consumption in heterogeneous mobile networks through data-driven optimization. IEEE Trans Netw Serv Manage. 2024;21(4):4369\u201382.","journal-title":"IEEE Trans Netw Serv Manage"},{"issue":"3","key":"1181_CR49","doi-asserted-by":"publisher","first-page":"3382","DOI":"10.1007\/s11227-023-05592-7","volume":"80","author":"X Gu","year":"2024","unstructured":"Gu X, Chen X, Lu P, Lan X, Li X, Du Y. SiMaLSTM-SNP: novel semantic relatedness learning model preserving both Siamese networks and membrane computing. J Supercomput. 2024;80(3):3382\u2013411.","journal-title":"J Supercomput"},{"issue":"18","key":"1181_CR50","doi-asserted-by":"publisher","first-page":"20481","DOI":"10.1007\/s11227-023-05439-1","volume":"79","author":"J Ding","year":"2023","unstructured":"Ding J, Chen X, Lu P, Yang Z, Li X, Du Y. DialogueINAB: an interaction neural network based on attitudes and behaviors of interlocutors for dialogue emotion recognition. J Supercomput. 2023;79(18):20481\u2013514.","journal-title":"J Supercomput"},{"key":"1181_CR51","doi-asserted-by":"publisher","first-page":"15548","DOI":"10.1016\/j.egyr.2022.10.402","volume":"8","author":"A Djaafari","year":"2022","unstructured":"Djaafari A, Ibrahim A, Bailek N, Bouchouicha K, Hassan MA, Kuriqi A, Al-Ansari N, El-Kenawy ESM. Hourly predictions of direct normal irradiation using an innovative hybrid LSTM model for concentrating solar power projects in hyper-arid regions. Energy Rep. 2022;8:15548\u201362.","journal-title":"Energy Rep"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01181-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01181-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01181-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T15:02:22Z","timestamp":1748444542000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-025-01181-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,28]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1181"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01181-y","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,28]]},"assertion":[{"value":"23 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent for participation"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"133"}}