{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:03:25Z","timestamp":1780761805736,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Provincial Science and Technology Support Program","doi-asserted-by":"publisher","award":["2023YFQ0044,2023YFG0300"],"award-info":[{"award-number":["2023YFQ0044,2023YFG0300"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06621-9","type":"journal-article","created":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T14:04:14Z","timestamp":1730815454000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["DGN: influence maximization based on deep reinforcement learning"],"prefix":"10.1007","volume":"81","author":[{"given":"Jingwen","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhoulin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunzhi","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanli","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhisheng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,5]]},"reference":[{"issue":"15","key":"6621_CR1","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. https:\/\/doi.org\/10.1007\/s11227-024-06300-9","journal-title":"J Supercomput"},{"issue":"13","key":"6621_CR2","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. https:\/\/doi.org\/10.1007\/s11227-024-06217-3","journal-title":"J Supercomput"},{"issue":"13","key":"6621_CR3","doi-asserted-by":"publisher","first-page":"19624","DOI":"10.1007\/s11227-024-06215-5","volume":"80","author":"J Tang","year":"2024","unstructured":"Tang J, Zhu H, Han L, Song S (2024) Identifying Top-k Influential Nodes in Social Networks: A Discrete Hybrid Optimizer by Integrating Butterfly Optimization Algorithm with Differential Evolution. J Supercomput 80(13):19624\u201319668. https:\/\/doi.org\/10.1007\/s11227-024-06215-5","journal-title":"J Supercomput"},{"issue":"13","key":"6621_CR4","doi-asserted-by":"publisher","first-page":"15023","DOI":"10.1007\/s11227-023-05213-3","volume":"79","author":"SM Ebadi Jokandan","year":"2023","unstructured":"Ebadi Jokandan SM, Bayat P, Farrokhbakht Foumani M (2023) Predicting Product Advertisement Links Using Hybrid Learning Within Social Networks. J Supercomput 79(13):15023\u201315050. https:\/\/doi.org\/10.1007\/s11227-023-05213-3","journal-title":"J Supercomput"},{"issue":"7","key":"6621_CR5","doi-asserted-by":"publisher","first-page":"9713","DOI":"10.1007\/s11227-023-05801-3","volume":"80","author":"Z Zhou","year":"2024","unstructured":"Zhou Z, Huang X, Xiong N, Liao G, Deng X (2024) A Self-attention Model with Contrastive Learning for Online Group Recommendation in Event-Based Social Networks. J Supercomput 80(7):9713\u20139741. https:\/\/doi.org\/10.1007\/s11227-023-05801-3","journal-title":"J Supercomput"},{"key":"6621_CR6","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E ( 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\u2013 146","DOI":"10.1145\/956750.956769"},{"issue":"14","key":"6621_CR7","doi-asserted-by":"publisher","first-page":"21149","DOI":"10.1007\/s11227-024-06252-0","volume":"80","author":"W Zhu","year":"2024","unstructured":"Zhu W, Peng C, Miao Y, Bai Y, Diao Y, Yang S (2024) Time and Value Aware Influence Blocking Maximization in Geo-Social Networks. J Supercomput 80(14):21149\u201321178. https:\/\/doi.org\/10.1007\/s11227-024-06252-0","journal-title":"J Supercomput"},{"issue":"14","key":"6621_CR8","doi-asserted-by":"publisher","first-page":"15905","DOI":"10.1007\/s11227-022-04418-2","volume":"78","author":"M Taherinia","year":"2022","unstructured":"Taherinia M, Esmaeili M, Minaei-Bidgoli B (2022) A High-Performance Algorithm for Finding Influential Nodes in Large-Scale Social Networks. J Supercomput 78(14):15905\u201315952. https:\/\/doi.org\/10.1007\/s11227-022-04418-2","journal-title":"J Supercomput"},{"key":"6621_CR9","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\u2013 957. SIAM","DOI":"10.1137\/1.9781611973402.70"},{"key":"6621_CR10","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\u2013 86","DOI":"10.1145\/2588555.2593670"},{"key":"6621_CR11","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\u2013 1554","DOI":"10.1145\/2723372.2723734"},{"key":"6621_CR12","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\u2013 208","DOI":"10.1145\/1557019.1557047"},{"key":"6621_CR13","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 509\u2013 518","DOI":"10.1145\/2505515.2505541"},{"key":"6621_CR14","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K-i ( 2014) Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"6621_CR15","doi-asserted-by":"crossref","unstructured":"Chen W, Lin T, Tan Z, Zhao M, Zhou X ( 2016) Robust Influence Maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013 804","DOI":"10.1145\/2939672.2939745"},{"issue":"7540","key":"6621_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu A.A, Veness J, Bellemare M.G, Graves A, Riedmiller M, Fidjeland A.K, Ostrovski G et al (2015) Human-Level Control Through Deep Reinforcement Learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"6621_CR17","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning Combinatorial Optimization Algorithms Over Graphs. Adv Neural Inf Process Syst 30"},{"key":"6621_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-Cconstrained Combinatorial Algorithms Over Billion-Sized Graphs. Adv Neural Inf Process Syst 33:20000\u201320011","journal-title":"Adv Neural Inf Process Syst"},{"issue":"3","key":"6621_CR19","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 Soc Syst 10(3):1288\u20131300","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"6621_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M (2020) Graph Neural Networks: A Review of Methods and Applications. AI Open 1:57\u201381","journal-title":"AI Open"},{"issue":"8","key":"6621_CR21","doi-asserted-by":"publisher","first-page":"8295","DOI":"10.1007\/s11227-022-04985-4","volume":"79","author":"Y Fu","year":"2023","unstructured":"Fu Y, Xie X, Zhang T (2023) Mran: A Attention-Based Approach for Social Recommendation. J Supercomput 79(8):8295\u20138321. https:\/\/doi.org\/10.1007\/s11227-022-04985-4","journal-title":"J Supercomput"},{"key":"6621_CR22","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\u2013 1554","DOI":"10.1145\/2723372.2723734"},{"issue":"2","key":"6621_CR23","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 Soc Syst 11(2):2210\u20132221","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"6621_CR24","doi-asserted-by":"crossref","unstructured":"Domingos PM, Richardson M ( 2001) Mining the Network Value of Customers. In: Acm Sigkdd International Conference on Knowledge Discovery & Data Mining","DOI":"10.1145\/502512.502525"},{"key":"6621_CR25","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\u2013 70","DOI":"10.1145\/775047.775057"},{"key":"6621_CR26","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\u2013 208","DOI":"10.1145\/1557019.1557047"},{"issue":"11","key":"6621_CR27","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of Influential Spreaders in Complex Networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"1","key":"6621_CR28","doi-asserted-by":"publisher","first-page":"27823","DOI":"10.1038\/srep27823","volume":"6","author":"J-X Zhang","year":"2016","unstructured":"Zhang J-X, Chen D-B, Dong Q, Zhao Z-D (2016) Identifying a Set of Influential Spreaders in Complex Networks. Sci Rep 6(1):27823","journal-title":"Sci Rep"},{"key":"6621_CR29","doi-asserted-by":"publisher","first-page":"124215","DOI":"10.1016\/j.physa.2020.124215","volume":"553","author":"S Kumar","year":"2020","unstructured":"Kumar S, Panda B (2020) Identifying Influential Nodes in Social Networks: Neighborhood Coreness Based Voting Approach. Phys A: Stat Mech Appl 553:124215","journal-title":"Phys A: Stat Mech Appl"},{"issue":"1","key":"6621_CR30","doi-asserted-by":"publisher","first-page":"43330","DOI":"10.1038\/srep43330","volume":"7","author":"D Liu","year":"2017","unstructured":"Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks. Sci Rep 7(1):43330","journal-title":"Sci Rep"},{"issue":"2","key":"6621_CR31","doi-asserted-by":"publisher","first-page":"103161","DOI":"10.1016\/j.ipm.2022.103161","volume":"60","author":"M Xie","year":"2023","unstructured":"Xie M, Zhan X-X, Liu C, Zhang Z-K (2023) An Efficient Adaptive Degree-Based Heuristic Algorithm for Influence Maximization in Hypergraphs. Inf Process & Manag 60(2):103161. https:\/\/doi.org\/10.1016\/j.ipm.2022.103161","journal-title":"Inf Process & Manag"},{"key":"6621_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","volume":"414","author":"G Zhao","year":"2020","unstructured":"Zhao G, Jia P, Zhou A, Zhang B (2020) Infgcn: Identifying Influential Nodes in Complex Networks with Graph Convolutional Networks. Neurocomputing 414:18\u201326","journal-title":"Neurocomputing"},{"key":"6621_CR33","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation Learning on Graphs: Methods and Applications. arXiv preprint arXiv:1709.05584"},{"key":"6621_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-024-06436-8","author":"O Rashnodi","year":"2024","unstructured":"Rashnodi O, Rastegarpour M, Moradi P, Zamanifar A (2024) Community Detection in Attributed Social Networks Using Deep Learning. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-024-06436-8","journal-title":"J Supercomput"},{"key":"6621_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105893","volume":"198","author":"E-Y Yu","year":"2020","unstructured":"Yu E-Y, Wang Y-P, Fu Y, Chen D-B, Xie M (2020) Identifying Critical Nodes in Complex Networks via Graph Convolutional Networks. Knowl-Based Syst 198:105893","journal-title":"Knowl-Based Syst"},{"key":"6621_CR36","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR ( 2017) struc2vec: Learning Node Representations from Structural Identity. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 385\u2013 394"},{"key":"6621_CR37","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":"6621_CR38","doi-asserted-by":"publisher","first-page":"118770","DOI":"10.1016\/j.eswa.2022.118770","volume":"212","author":"S Kumar","year":"2023","unstructured":"Kumar S, Mallik A, Panda B (2023) Influence Maximization in Social Networks Using Transfer Learning via Graph-Based LSTM. Expert Syst Appl 212:118770","journal-title":"Expert Syst Appl"},{"key":"6621_CR39","doi-asserted-by":"publisher","first-page":"126936","DOI":"10.1016\/j.neucom.2023.126936","volume":"564","author":"C Guo","year":"2024","unstructured":"Guo C, Li W, Liu F, Zhong K, Wu X, Zhao Y, Jin Q (2024) Influence Maximization Algorithm Based on Group Trust and Local Topology Structure. Neurocomputing 564:126936. https:\/\/doi.org\/10.1016\/j.neucom.2023.126936","journal-title":"Neurocomputing"},{"issue":"1","key":"6621_CR40","doi-asserted-by":"publisher","first-page":"6122","DOI":"10.1038\/s41598-023-33010-8","volume":"13","author":"A Rezvanian","year":"2023","unstructured":"Rezvanian A, Vahidipour SM, Meybodi MR (2023) A New Stochastic Diffusion Model for Influence Maximization in Social Networks. Sci Rep 13(1):6122","journal-title":"Sci Rep"},{"key":"6621_CR41","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\u2013 21361 . PMLR"},{"issue":"6","key":"6621_CR42","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","volume":"2","author":"C Fan","year":"2020","unstructured":"Fan C, Zeng L, Sun Y, Liu Y-Y (2020) Finding Key Players in Complex Networks Through Deep Reinforcement Learning. Nat Mach Intell 2(6):317\u2013324","journal-title":"Nat Mach Intell"},{"key":"6621_CR43","doi-asserted-by":"crossref","unstructured":"Liu Y, Sze W, Gao X, Chen G ( 2021) Multiple Agents Reinforcement Learning Based Influence Maximization in Social Network Services. In: Service-Oriented Computing: 19th International Conference, ICSOC 2021, Virtual Event, November 22\u201325, 2021, Proceedings 19, pp. 431\u2013 445 . Springer","DOI":"10.1007\/978-3-030-91431-8_27"},{"key":"6621_CR44","doi-asserted-by":"crossref","unstructured":"Van\u00a0Hasselt H, Guez A, Silver D (2016) Deep Reinforcement Learning with Double Q-Learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"6621_CR45","doi-asserted-by":"crossref","unstructured":"Ali K, Wang C-Y, Yeh M-Y, Chen Y-S ( 2020) Addressing Competitive Influence Maximization on Unknown Social Network with Deep Reinforcement Learning. In: 2020 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 196\u2013 203 . IEEE","DOI":"10.1109\/ASONAM49781.2020.9381471"},{"key":"6621_CR46","doi-asserted-by":"crossref","unstructured":"Ali K, Wang C-Y, Yeh M-Y, Li C-T, Chen Y-S ( 2021) Nedrl-cim: Network Embedding Meets Deep Reinforcement Learning to Tackle Competitive Influence Maximization on Evolving Social Networks. In: 2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA), pp. 1\u2013 9 . IEEE","DOI":"10.1109\/DSAA53316.2021.9564111"},{"issue":"5","key":"6621_CR47","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1109\/TCSS.2021.3120421","volume":"9","author":"Q He","year":"2021","unstructured":"He Q, Wang X, Zhao Y, Yi B, Lu X, Yang M, Huang M (2021) Reinforcement-Learning-Based Competitive Opinion Maximization Approach in Signed Social Networks. IEEE Trans Comput Soc Syst 9(5):1505\u20131514","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"6621_CR48","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\u2013 1038","DOI":"10.1145\/1835804.1835934"},{"key":"6621_CR49","unstructured":"Maas AL, Hannun AY, Ng AY, et al ( 2013) Rectifier Nonlinearities Improve Neural Network Acoustic Models. In: Proc. Icml, vol. 30, p. 3 . Atlanta, GA"},{"key":"6621_CR50","unstructured":"Jure L (2014) Snap datasets: Stanford Large Network Dataset Collection. Retrieved December 2021 from http:\/\/snap.stanford.edu\/data"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06621-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06621-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06621-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T14:05:40Z","timestamp":1730815540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06621-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,5]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6621"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06621-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,5]]},"assertion":[{"value":"14 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"130"}}