{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:33:00Z","timestamp":1774020780255,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:00:00Z","timestamp":1773964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:00:00Z","timestamp":1773964800000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08416-6","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T14:20:28Z","timestamp":1774016428000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TDDL-PIM: platform-agnostic influence maximization via topology-decoupled diffusion learning"],"prefix":"10.1007","volume":"82","author":[{"given":"Dongxia","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaoqing","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiuyang","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,20]]},"reference":[{"issue":"9","key":"8416_CR1","first-page":"1","volume":"17","author":"Y Li","year":"2023","unstructured":"Li Y, Gao H, Gao Y, Guo J, Wu W (2023) A survey on influence maximization: from an ml-based combinatorial optimization. ACM Trans Knowl Discov Data 17(9):1\u201350","journal-title":"ACM Trans Knowl Discov Data"},{"key":"8416_CR2","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, Lee W-C (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 671\u2013680","DOI":"10.1145\/2348283.2348373"},{"key":"8416_CR3","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"1","key":"8416_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s11227-024-06598-5","volume":"81","author":"RK Gautam","year":"2025","unstructured":"Gautam RK, Kare AS, Bhavani SD (2025) Interest maximization in social networks. J Supercomput 81(1):146","journal-title":"J Supercomput"},{"key":"8416_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.inffus.2021.02.001","volume":"73","author":"T Wen","year":"2021","unstructured":"Wen T, Cheong KH (2021) The fractal dimension of complex networks: a review. Inf Fusion 73:87\u2013102","journal-title":"Inf Fusion"},{"issue":"4","key":"8416_CR6","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 (2022) Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Trans Emerg Topics Comput Intell 7(4):995\u20131009","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"8416_CR7","doi-asserted-by":"crossref","unstructured":"Domingos, P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"8416_CR8","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"},{"key":"8416_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"8416_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u201397. IEEE","DOI":"10.1109\/ICDM.2010.118"},{"key":"8416_CR11","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM","DOI":"10.1137\/1.9781611973402.70"},{"key":"8416_CR12","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"8416_CR13","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"8416_CR14","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":"8416_CR15","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Xiao X, Yuan J (2018) Online processing algorithms for influence maximization. In: Proceedings of the 2018 International Conference on Management of Data, pp. 991\u20131005","DOI":"10.1145\/3183713.3183749"},{"key":"8416_CR16","doi-asserted-by":"crossref","unstructured":"Guo Q, Wang S, Wei Z, Chen M (2020) Influence maximization revisited: efficient reverse reachable set generation with bound tightened. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2167\u20132181","DOI":"10.1145\/3318464.3389740"},{"issue":"3","key":"8416_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3533817","volume":"47","author":"Q Guo","year":"2022","unstructured":"Guo Q, Wang S, Wei Z, Lin W, Tang J (2022) Influence maximization revisited: efficient sampling with bound tightened. ACM Trans Database Syst(TODS) 47(3):1\u201345","journal-title":"ACM Trans Database Syst(TODS)"},{"key":"8416_CR18","first-page":"20000","volume":"33","author":"S Manchanda","year":"2020","unstructured":"Manchanda S, Mittal A, Dhawan A, Medya S, Ranu S, Singh A (2020) Gcomb: learning budget-constrained combinatorial algorithms over billion-sized graphs. Adv Neural Inf Process Syst 33:20000\u201320011","journal-title":"Adv Neural Inf Process Syst"},{"key":"8416_CR19","unstructured":"Li H, Xu M, Bhowmick SS, Sun C, Jiang Z, Cui J (2019) Disco: influence maximization meets network embedding and deep learning. arXiv preprint arXiv:1906.07378"},{"issue":"3","key":"8416_CR20","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","volume":"10","author":"H Li","year":"2022","unstructured":"Li H, Xu M, Bhowmick SS, Rayhan JS, Sun C, Cui J (2022) Piano: influence maximization meets deep reinforcement learning. IEEE Trans Comput Social Syst 10(3):1288\u20131300","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"1","key":"8416_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11227-024-06621-9","volume":"81","author":"J Wang","year":"2025","unstructured":"Wang J, Cao Z, Xie C, Li Y, Liu J, Gao Z (2025) Dgn: influence maximization based on deep reinforcement learning. J Supercomput 81(1):130","journal-title":"J Supercomput"},{"issue":"2","key":"8416_CR22","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","volume":"11","author":"T Chen","year":"2023","unstructured":"Chen T, Yan S, Guo J, Wu W (2023) Touplegdd: a fine-designed solution of influence maximization by deep reinforcement learning. IEEE Trans Comput Social Syst 11(2):2210\u20132221","journal-title":"IEEE Trans Comput Social Syst"},{"key":"8416_CR23","unstructured":"Ling C, Jiang J, Wang J, Thai MT, Xue R, Song J, Qiu M, Zhao L (2023) Deep graph representation learning and optimization for influence maximization. In: International Conference on Machine Learning, pp. 21350\u201321361. PMLR"},{"key":"8416_CR24","doi-asserted-by":"crossref","unstructured":"Hevapathige A, Wang Q, Zehmakan AN (2025) Deepsn: a sheaf neural framework for influence maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, pp. 17177\u201317185","DOI":"10.1609\/aaai.v39i16.33888"},{"key":"8416_CR25","doi-asserted-by":"crossref","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","DOI":"10.1145\/1281192.1281239"},{"key":"8416_CR26","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":"10","key":"8416_CR27","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27(10):2770\u20132783","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8416_CR28","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"},{"key":"8416_CR29","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: European Conference on Principles of Data Mining and Knowledge Discovery, pp. 259\u2013271. Springer","DOI":"10.1007\/11871637_27"},{"key":"8416_CR30","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"8416_CR31","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u201397. IEEE","DOI":"10.1109\/ICDM.2010.118"},{"key":"8416_CR32","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp. 211\u2013220. IEEE","DOI":"10.1109\/ICDM.2011.132"},{"issue":"15","key":"8416_CR33","doi-asserted-by":"publisher","first-page":"22190","DOI":"10.1007\/s11227-024-06300-9","volume":"80","author":"R Li","year":"2024","unstructured":"Li R, Zhu J, Wang G (2024) Influence maximization under equilibrious groups in social networks. J Supercomput 80(15):22190\u201322212","journal-title":"J Supercomput"},{"issue":"2","key":"8416_CR34","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TCSS.2024.3459853","volume":"12","author":"S Ghosh","year":"2025","unstructured":"Ghosh S, Chen T, Wu W (2025) Enhanced group influence maximization in social networks using deep reinforcement learning. IEEE Trans Comput Social Syst 12(2):573\u2013585","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"5","key":"8416_CR35","doi-asserted-by":"publisher","first-page":"6809","DOI":"10.1007\/s11227-023-05695-1","volume":"80","author":"S Ghafouri","year":"2024","unstructured":"Ghafouri S, Khasteh SH, Azarkasb SO (2024) Influence maximization (IM) in complex networks with limited visibility using statistical methods. J Supercomput 80(5):6809\u20136854","journal-title":"J Supercomput"},{"issue":"13","key":"8416_CR36","doi-asserted-by":"publisher","first-page":"19898","DOI":"10.1007\/s11227-024-06217-3","volume":"80","author":"M Ganguly","year":"2024","unstructured":"Ganguly M, Dey P, Roy S (2024) Influence maximization in community-structured social networks: a centrality-based approach. J Supercomput 80(13):19898\u201319941","journal-title":"J Supercomput"},{"key":"8416_CR37","doi-asserted-by":"crossref","unstructured":"Yuan Z, Shao M, Chen Z (2024) Graph bayesian optimization for multiplex influence maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 22475\u201322483","DOI":"10.1609\/aaai.v38i20.30255"},{"issue":"10380","key":"8416_CR38","first-page":"10413","volume":"37","author":"S Chowdhary","year":"2024","unstructured":"Chowdhary S, De Pasquale G, Lanzetti N, Stoica A-A, D\u00f6rfler F (2024) Fairness in social influence maximization via optimal transport. Adv Neural Inf Process Syst 37(10380):10413","journal-title":"Adv Neural Inf Process Syst"},{"key":"8416_CR39","doi-asserted-by":"crossref","unstructured":"Feng Y, Tan VYF, Cautis B (2024) Influence maximization via graph neural bandits. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 771\u2013781","DOI":"10.1145\/3637528.3671983"},{"key":"8416_CR40","doi-asserted-by":"crossref","unstructured":"Zhang Z, Chen W, Sun X, Zhang J (2022) Online influence maximization with node-level feedback using standard offline oracles. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 9153\u20139161","DOI":"10.1609\/aaai.v36i8.20901"},{"issue":"1","key":"8416_CR41","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 Netw Sci 9(1):16","journal-title":"Appl Netw Sci"},{"key":"8416_CR42","unstructured":"Khalil EB, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pp. 6348\u20136358"},{"key":"8416_CR43","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30"},{"key":"8416_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101609","volume":"88","author":"Q Hu","year":"2024","unstructured":"Hu Q, Jiang J, Xu H, Kassim M (2024) Imne: maximizing influence through deep learning-based node embedding in social network. Swarm Evol Comput 88:101609","journal-title":"Swarm Evol Comput"},{"key":"8416_CR45","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","volume":"607","author":"S Kumar","year":"2022","unstructured":"Kumar S, Mallik A, Khetarpal A, Panda BS (2022) Influence maximization in social networks using graph embedding and graph neural network. Inf Sci 607:1617\u20131636","journal-title":"Inf Sci"},{"key":"8416_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.130939","volume":"651","author":"X Ju","year":"2025","unstructured":"Ju X, Seyfi A, Bouyer A, Rouhi A, Liu X, Arasteh B (2025) Influence maximization in multilayer social networks using transformer-based node embeddings and deep neural networks. Neurocomputing 651:130939","journal-title":"Neurocomputing"},{"key":"8416_CR47","unstructured":"Hu Q, Wang G, Yu PS (2014) Transferring influence: supervised learning for efficient influence maximization across networks. In: 10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing, pp. 45\u201354"},{"key":"8416_CR48","doi-asserted-by":"crossref","unstructured":"Shen X, Chung F-l, Mao S (2017) Leveraging cross-network information for graph sparsification in influence maximization. In: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 801\u2013804","DOI":"10.1145\/3077136.3080646"},{"issue":"9","key":"8416_CR49","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.1109\/TFUZZ.2019.2931272","volume":"28","author":"X Shen","year":"2020","unstructured":"Shen X, Mao S, Chung F (2020) Cross-network learning with fuzzy labels for seed selection and graph sparsification in influence maximization. IEEE Trans Fuzzy Syst 28(9):2195\u20132208","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"1987","key":"8416_CR50","first-page":"20120375","volume":"371","author":"A-L Barab\u00e1si","year":"2013","unstructured":"Barab\u00e1si A-L (2013) Network science. Philos Trans Royal Soc A Math Phys Eng Sci 371(1987):20120375","journal-title":"Philos Trans Royal Soc A Math Phys Eng Sci"},{"key":"8416_CR51","unstructured":"Mikolov T (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"key":"8416_CR52","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. Adv Neural Inf Process Syst 26"},{"key":"8416_CR53","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"8416_CR54","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"8416_CR55","doi-asserted-by":"crossref","unstructured":"Feng S, Cong G, Khan A, Li X, Liu Y, Chee YM (2018) Inf2vec: latent representation model for social influence embedding. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 941\u2013952. IEEE","DOI":"10.1109\/ICDE.2018.00089"},{"key":"8416_CR56","doi-asserted-by":"crossref","unstructured":"Chen H-W, Yang D-N, Lee W-C, Yu PS, Chen M-S (2023) Cminet: a graph learning framework for content-aware multi-channel influence diffusion. In: Proceedings of the ACM Web Conference 2023, pp. 545\u2013555","DOI":"10.1145\/3543507.3583465"},{"key":"8416_CR57","unstructured":"Rozemberczki B, Sarkar R (2021) Twitch gamers: a dataset for evaluating proximity preserving and structural role-based node embeddings. arXiv preprint arXiv:2101.03091"},{"key":"8416_CR58","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"},{"key":"8416_CR59","unstructured":"Takac L, Zabovsky M (2012) Data analysis in public social networks. In: International Scientific Conference & International Workshop: Present Day Trends of Innovations, Lomza, Poland"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08416-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08416-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08416-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T14:20:42Z","timestamp":1774016442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08416-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,20]]},"references-count":59,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["8416"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08416-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,20]]},"assertion":[{"value":"28 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 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"}}],"article-number":"274"}}