{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:24:31Z","timestamp":1761791071182,"version":"build-2065373602"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1824897","2034503"],"award-info":[{"award-number":["CMMI-1824897","2034503"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100030807","name":"Commonwealth Cyber Initiative","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100030807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We study submodular optimization in adversarial context, applicable to machine learning problems such as feature selection using data susceptible to uncertainties and attacks. We focus on Stackelberg zero-sum games (also referred to as interdiction games) between an attacker (or interdictor) and a defender where the attacker aims to minimize the defender\u2019s objective of maximizing a\n                    <jats:italic>k<\/jats:italic>\n                    -submodular function. We allow uncertainties arising from the success of attacks and inherent data noise, and address challenges due to incomplete knowledge of the probability distribution of random parameters. Specifically, we introduce Distributionally Robust\n                    <jats:italic>k<\/jats:italic>\n                    -Submodular Interdiction Problem (DRO\n                    <jats:italic>k<\/jats:italic>\n                    -SIP) and Distributionally Risk-Receptive\n                    <jats:italic>k<\/jats:italic>\n                    -Submodular Interdiction Problem (DRR\n                    <jats:italic>k<\/jats:italic>\n                    -SIP) along with finitely convergent exact algorithms for solving them. When solving the DRO\n                    <jats:italic>k<\/jats:italic>\n                    -SIP, the attacker optimizes their expected payoff with respect to the worst-case probability distribution within the ambiguity set, and thereby have robust attack strategies despite distributional ambiguity. In contrast, the DRR\n                    <jats:italic>k<\/jats:italic>\n                    -SIP identifies attacker strategies with the best-case probability distribution, and identifies critical vulnerabilities for the defender. The optimal values derived from both DRO\n                    <jats:italic>k<\/jats:italic>\n                    -SIP and DRR\n                    <jats:italic>k<\/jats:italic>\n                    -SIP offer a confidence interval-like range for the expected value of the defender\u2019s objective function, capturing distributional ambiguity. We conduct computational experiments on instances of feature selection and sensor placement problems, using Wisconsin breast cancer data and synthetic data, respectively.\n                  <\/jats:p>","DOI":"10.1007\/s10287-025-00541-6","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T18:20:43Z","timestamp":1756232443000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-submodular interdiction problems under distributional risk-receptiveness and robustness: application to machine learning"],"prefix":"10.1007","volume":"22","author":[{"given":"Seonghun","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"issue":"2","key":"541_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ejor.2019.05.033","volume":"279","author":"M Bansal","year":"2019","unstructured":"Bansal M, Mehrotra S (2019) On solving two-stage distributionally robust disjunctive programs with a general ambiguity set. Eur J Oper Res 279(2):296\u2013307. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.033","journal-title":"Eur J Oper Res"},{"issue":"2","key":"541_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10898-020-00986-w","volume":"81","author":"M Bansal","year":"2021","unstructured":"Bansal M, Zhang Y (2021) Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs. J Glob Optim 81(2):391\u2013433","journal-title":"J Glob Optim"},{"issue":"3","key":"541_CR3","doi-asserted-by":"publisher","first-page":"2360","DOI":"10.1137\/17M1115046","volume":"28","author":"M Bansal","year":"2018","unstructured":"Bansal M, Huang K-L, Mehrotra S (2018) Decomposition algorithms for two-stage distributionally robust mixed binary programs. SIAM J Optim 28(3):2360\u20132383","journal-title":"SIAM J Optim"},{"key":"541_CR4","doi-asserted-by":"crossref","unstructured":"Bayraksan, G., Love, D.K. (2015): Data-Driven Stochastic Programming Using phi-Divergences. INFORMS TutORials in Operations Research, pp. 1\u201319.","DOI":"10.1287\/educ.2015.0134"},{"key":"541_CR5","doi-asserted-by":"publisher","unstructured":"Boykov YY, Jolly M-P (2001) Interactive graph cuts for optimal boundary & region segmentation of objects in nd images. In: IEEE international conference on computer vision. ICCV 2001, vol 1. IEEE, pp 105\u2013112. https:\/\/doi.org\/10.1109\/iccv.2001.937505","DOI":"10.1109\/iccv.2001.937505"},{"issue":"6","key":"541_CR6","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.dam.2007.05.060","volume":"156","author":"E Carrizosa","year":"2008","unstructured":"Carrizosa E, Martin-Barragan B, Morales DR (2008) Multi-group support vector machines with measurement costs: a biobjective approach. Discrete Appl Math 156(6):950\u2013966. https:\/\/doi.org\/10.1016\/j.dam.2007.05.060","journal-title":"Discrete Appl Math"},{"key":"541_CR7","doi-asserted-by":"publisher","unstructured":"Dai H, Li H, Tian T, Huang X, Wang L, Zhu J, Song L (2018) Adversarial attack on graph structured data. In: International conference on machine learning (ICML). PMLR, pp 1115\u20131124. https:\/\/doi.org\/10.48550\/arXiv.1806.02371","DOI":"10.48550\/arXiv.1806.02371"},{"issue":"5","key":"541_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/16m1073807","volume":"39","author":"JA De Loera","year":"2017","unstructured":"De Loera JA, Haddock J, Needell D (2017) A sampling Kaczmarz\u2013Motzkin algorithm for linear feasibility. SIAM J Sci Comput 39(5):66\u201387. https:\/\/doi.org\/10.1137\/16m1073807","journal-title":"SIAM J Sci Comput"},{"key":"541_CR9","doi-asserted-by":"publisher","unstructured":"Dekel O, Shamir O (2008) Learning to classify with missing and corrupted features. In: International conference on machine learning (ICML), pp 216\u2013223. https:\/\/doi.org\/10.1145\/1390156.1390184","DOI":"10.1145\/1390156.1390184"},{"issue":"3","key":"541_CR10","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper Res 58(3):595\u2013612","journal-title":"Oper Res"},{"issue":"1","key":"541_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/17442508708833436","volume":"20","author":"J Dupa\u010dov\u00e1","year":"1987","unstructured":"Dupa\u010dov\u00e1 J (1987) The minimax approach to stochastic programming and an illustrative application. Stoch Int J Probab Stoch Process 20(1):73\u201388. https:\/\/doi.org\/10.1080\/17442508708833436","journal-title":"Stoch Int J Probab Stoch Process"},{"issue":"1","key":"541_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"DR Fulkerson","year":"1977","unstructured":"Fulkerson DR, Harding GC (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math Program 13(1):116\u2013118. https:\/\/doi.org\/10.1007\/BF01584329","journal-title":"Math Program"},{"issue":"3","key":"541_CR13","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1137\/20M1378600","volume":"32","author":"H Gangammanavar","year":"2022","unstructured":"Gangammanavar H, Bansal M (2022) Stochastic decomposition method for two-stage distributionally robust linear optimization. SIAM J Optim 32(3):1901\u20131930. https:\/\/doi.org\/10.1137\/20M1378600","journal-title":"SIAM J Optim"},{"issue":"2","key":"541_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/moor.2022.1275","volume":"48","author":"R Gao","year":"2023","unstructured":"Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with Wasserstein distance. Math Oper Res 48(2):603\u2013655. https:\/\/doi.org\/10.1287\/moor.2022.1275","journal-title":"Math Oper Res"},{"key":"541_CR15","doi-asserted-by":"publisher","unstructured":"Globerson A, Roweis S (2006) Nightmare at test time: robust learning by feature deletion. In: International conference on machine learning (ICML), pp 353\u2013360. https:\/\/doi.org\/10.1145\/1143844.1143889","DOI":"10.1145\/1143844.1143889"},{"key":"541_CR16","unstructured":"Goodfellow IJ, Shlens J, Szegedy C (2014) Explaining and harnessing adversarial examples. arXiv:1412.6572"},{"key":"541_CR17","doi-asserted-by":"publisher","unstructured":"Huber A, Kolmogorov V (2012) Towards minimizing k-submodular functions. In: Combinatorial optimization: second international symposium, ISCO 2012, Athens, Greece, April 19\u201321, 2012, Revised selected papers 2. Springer, pp 451\u2013462. https:\/\/doi.org\/10.1007\/978-3-642-32147-4_40","DOI":"10.1007\/978-3-642-32147-4_40"},{"key":"541_CR18","unstructured":"Israeli E, Wood RK (1999) System interdiction and defense. PhD thesis, Citeseer"},{"issue":"2","key":"541_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks Int J 40(2):97\u2013111. https:\/\/doi.org\/10.1002\/net.10039","journal-title":"Networks Int J"},{"issue":"1","key":"541_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.22114","volume":"81","author":"S Kang","year":"2023","unstructured":"Kang S, Bansal M (2023) Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set. Networks 81(1):3\u201322. https:\/\/doi.org\/10.1002\/net.22114","journal-title":"Networks"},{"key":"541_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02192-y","author":"S Kang","year":"2025","unstructured":"Kang S, Bansal M (2025) Distributionally risk-receptive and robust multistage stochastic integer programs and interdiction models. Math Program. https:\/\/doi.org\/10.1007\/s10107-024-02192-y","journal-title":"Math Program"},{"key":"541_CR22","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"541_CR23","doi-asserted-by":"publisher","unstructured":"Kothawade S, Kaushal V, Ramakrishnan G, Bilmes J, Iyer R (2022) Prism: a rich class of parameterized submodular information measures for guided data subset selection. In: AAAI conference on artificial intelligence, vol 36, pp 10238\u201310246. https:\/\/doi.org\/10.1609\/aaai.v36i9.21264","DOI":"10.1609\/aaai.v36i9.21264"},{"issue":"71\u2013104","key":"541_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/cbo9781139177801.004","volume":"3","author":"A Krause","year":"2014","unstructured":"Krause A, Golovin D (2014) Submodular function maximization. Tractability 3(71\u2013104):3. https:\/\/doi.org\/10.1017\/cbo9781139177801.004","journal-title":"Tractability"},{"key":"541_CR25","unstructured":"Krause A, McMahan HB, Guestrin C, Gupta A (2008b) Robust submodular observation selection 9. https:\/\/api.semanticscholar.org\/CorpusID:11626236"},{"key":"541_CR26","doi-asserted-by":"publisher","unstructured":"Krause A, Singh A, Guestrin C (2008c) Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies, vol 9. https:\/\/doi.org\/10.5555\/1390681.1390689","DOI":"10.5555\/1390681.1390689"},{"key":"541_CR27","doi-asserted-by":"publisher","unstructured":"Kurakin A, Goodfellow I, Bengio S (2016) Adversarial machine learning at scale. arXiv:1611.01236. https:\/\/doi.org\/10.48550\/arXiv.1611.01236","DOI":"10.48550\/arXiv.1611.01236"},{"key":"541_CR28","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10115-017-1059-8","volume":"53","author":"Y Li","year":"2017","unstructured":"Li Y, Li T, Liu H (2017) Recent advances in feature selection and its applications. Knowl Inf Syst 53:551\u2013577. https:\/\/doi.org\/10.1007\/s10115-017-1059-8","journal-title":"Knowl Inf Syst"},{"key":"541_CR29","doi-asserted-by":"publisher","unstructured":"Lin H, Bilmes J (2010) Multi-document summarization via budgeted maximization of submodular functions. In: Human language technologies: the 2010 annual conference of the North American chapter of the Association for Computational Linguistics, pp 912\u2013920. https:\/\/doi.org\/10.5555\/1857999.1858133","DOI":"10.5555\/1857999.1858133"},{"key":"541_CR30","doi-asserted-by":"publisher","unstructured":"Krause A, Leskovec J, Guestrin C, VanBriesen J, Faloutsos C (2008a) Efficient sensor placement optimization for securing large water distribution networks. J Water Resour Plan Manag 134(6):516\u2013526. https:\/\/doi.org\/10.1061\/(asce)0733-9496(2008)134:6(516)","DOI":"10.1061\/(asce)0733-9496(2008)134:6(516)"},{"key":"541_CR31","doi-asserted-by":"publisher","unstructured":"Lin H, Bilmes JA (2009) How to select a good training-data subset for transcription: submodular active selection for sequences. In: Interspeech, pp 2859\u20132862. https:\/\/doi.org\/10.21437\/interspeech.2009-730","DOI":"10.21437\/interspeech.2009-730"},{"key":"541_CR32","doi-asserted-by":"publisher","unstructured":"Liu Y, Wei K, Kirchhoff K, Song Y, Bilmes J (2013) Submodular feature selection for high-dimensional acoustic score spaces. In: 2013 IEEE international conference on acoustics, speech and signal processing. IEEE, pp 7184\u20137188. https:\/\/doi.org\/10.1109\/icassp.2013.6639057","DOI":"10.1109\/icassp.2013.6639057"},{"key":"541_CR33","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/bf01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2013i. Math Program 14:265\u2013294. https:\/\/doi.org\/10.1007\/bf01588971","journal-title":"Math Program"},{"key":"541_CR34","doi-asserted-by":"publisher","unstructured":"Ohsaka N, Yoshida Y (2015) Monotone k-submodular function maximization with size constraints, vol 28.https:\/\/doi.org\/10.5555\/2969239.2969317","DOI":"10.5555\/2969239.2969317"},{"key":"541_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TASE.2024.3350973","volume":"22","author":"S Park","year":"2025","unstructured":"Park S, Bansal M (2025) Algorithms for cameras view-frame placement problems in the presence of an adversary and distributional ambiguity. IEEE Trans Autom Sci Eng 22:353\u2013364. https:\/\/doi.org\/10.1109\/TASE.2024.3350973","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"541_CR36","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TEVC.2017.2749263","volume":"22","author":"C Qian","year":"2017","unstructured":"Qian C, Shi J-C, Tang K, Zhou Z-H (2017) Constrained monotone $$k$$-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee. IEEE Trans Evol Comput 22(4):595\u2013608. https:\/\/doi.org\/10.1109\/TEVC.2017.2749263","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR37","doi-asserted-by":"publisher","unstructured":"Rafiey A, Yoshida Y (2020) Fast and private submodular and $$k$$-submodular functions maximization with matroid constraints. In: International conference on machine learning (ICML). PMLR, pp 7887\u20137897. https:\/\/doi.org\/10.5555\/3524938.3525669","DOI":"10.5555\/3524938.3525669"},{"key":"541_CR38","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.01.003","volume-title":"On maximizing a monotone k-submodular function subject to a matroid constraint","author":"S Sakaue","year":"2017","unstructured":"Sakaue S (2017) On maximizing a monotone k-submodular function subject to a matroid constraint, vol 23. Elsevier, Amsterdam, pp 105\u2013113. https:\/\/doi.org\/10.1016\/j.disopt.2017.01.003"},{"key":"541_CR39","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1057\/9781137024381_3","volume-title":"A min-max solution of an inventory problem","author":"H Scarf","year":"2005","unstructured":"Scarf H (2005) A min-max solution of an inventory problem. Palgrave Macmillan UK, London, pp 19\u201327. https:\/\/doi.org\/10.1057\/9781137024381_3"},{"key":"541_CR40","unstructured":"Singh A, Guillory A, Bilmes J (2012) On bisubmodular maximization. In: Artificial intelligence and statistics. PMLR, pp 1055\u20131063. proceedings.mlr.press\/v22\/singh12.html"},{"issue":"3","key":"541_CR41","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith JC, Song Y (2020) A survey of network interdiction models and algorithms. Eur J Oper Res 283(3):797\u2013811. https:\/\/doi.org\/10.1016\/j.ejor.2019.06.024","journal-title":"Eur J Oper Res"},{"issue":"1","key":"541_CR42","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.orl.2021.11.010","volume":"50","author":"Z Tang","year":"2022","unstructured":"Tang Z, Wang C, Chan H (2022) On maximizing a monotone k-submodular function under a knapsack constraint. Oper Res Lett 50(1):28\u201331. https:\/\/doi.org\/10.1016\/j.orl.2021.11.010","journal-title":"Oper Res Lett"},{"issue":"5","key":"541_CR43","doi-asserted-by":"publisher","first-page":"2634","DOI":"10.1287\/ijoc.2022.1196","volume":"34","author":"K Tan\u0131nm\u0131\u015f","year":"2022","unstructured":"Tan\u0131nm\u0131\u015f K, Sinnl M (2022) A branch-and-cut algorithm for submodular interdiction games. INFORMS J Comput 34(5):2634\u20132657. https:\/\/doi.org\/10.1287\/ijoc.2022.1196","journal-title":"INFORMS J Comput"},{"issue":"2","key":"541_CR44","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0166-218X(93)90006-A","volume":"43","author":"RV Vohra","year":"1993","unstructured":"Vohra RV, Hall NG (1993) A probabilistic analysis of the maximal covering location problem. Discrete Appl Math 43(2):175\u2013183. https:\/\/doi.org\/10.1016\/0166-218X(93)90006-A","journal-title":"Discrete Appl Math"},{"key":"541_CR45","doi-asserted-by":"publisher","unstructured":"Wei K, Iyer R, Bilmes J (2015) Submodularity in data subset selection and active learning. In: International conference on machine learning (ICML). PMLR, pp 1954\u20131963. https:\/\/doi.org\/10.5555\/3045118.3045326","DOI":"10.5555\/3045118.3045326"},{"key":"541_CR46","doi-asserted-by":"publisher","unstructured":"Wolberg W, Mangasarian O, Street N, Street W (1995) Breast Cancer Wisconsin (Diagnostic). UCI Machine Learning Repository. https:\/\/doi.org\/10.24432\/C5DW2B","DOI":"10.24432\/C5DW2B"},{"issue":"6","key":"541_CR47","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R Wollmer","year":"1964","unstructured":"Wollmer R (1964) Removing arcs from a network. Oper Res 12(6):934\u2013940. https:\/\/doi.org\/10.1287\/opre.12.6.934","journal-title":"Oper Res"},{"key":"541_CR48","doi-asserted-by":"publisher","unstructured":"Xu K, Chen H, Liu S, Chen P-Y, Weng T-W, Hong M, Lin X (2019) Topology attack and defense for graph neural networks: an optimization perspective. arXiv:1906.04214. https:\/\/doi.org\/10.24963\/ijcai.2019\/550","DOI":"10.24963\/ijcai.2019\/550"},{"key":"541_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2021.100670","volume":"42","author":"Q Yu","year":"2021","unstructured":"Yu Q, K\u00fc\u00e7\u00fckyavuz S (2021) An exact cutting plane method for k-submodular function maximization. Discrete Optim 42:100670. https:\/\/doi.org\/10.1016\/j.disopt.2021.100670","journal-title":"Discrete Optim"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00541-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-025-00541-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00541-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:20:20Z","timestamp":1761790820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-025-00541-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s10287-025-00541-6","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2025,8,26]]},"assertion":[{"value":"25 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 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 competing interests","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"15"}}