{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T16:06:33Z","timestamp":1767197193329,"version":"3.48.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Project of Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, China","award":["KF202405"],"award-info":[{"award-number":["KF202405"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10878-025-01366-4","type":"journal-article","created":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:59:46Z","timestamp":1762102786000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Valid inequalities for the $$\\beta $$-edge disruptor problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Sheng-Jie","family":"Chen","sequence":"first","affiliation":[]},{"given":"Guang-Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Caixia","family":"Kou","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,2]]},"reference":[{"issue":"16\u201317","key":"1366_CR1","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2013.03.021","volume":"161","author":"B Addis","year":"2013","unstructured":"Addis B, Di Summa M, Grosso A (2013) Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret Appl Math 161(16\u201317):2349\u20132360","journal-title":"Discret Appl Math"},{"issue":"6794","key":"1366_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"issue":"3","key":"1366_CR3","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.1109\/TPWRS.2022.3180363","volume":"38","author":"D Alvarado","year":"2022","unstructured":"Alvarado D, Moreno R, Street A, Panteli M, Mancarella P, Strbac G (2022) Co-optimizing substation hardening and transmission expansion against earthquakes: A decision-dependent probability approach. IEEE Trans Power Syst 38(3):2058\u20132070","journal-title":"IEEE Trans Power Syst"},{"key":"1366_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","volume":"55","author":"R Aringhieri","year":"2016","unstructured":"Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2016) A general evolutionary framework for different classes of critical node problems. Eng Appl Artif Intell 55:128\u2013145","journal-title":"Eng Appl Artif Intell"},{"issue":"7","key":"1366_CR5","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36(7):2193\u20132200","journal-title":"Comput Oper Res"},{"key":"1366_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk A, Nemhauser GL, Savelsbergh MW (2000) The mixed vertex packing problem. Math Program 89:35\u201353","journal-title":"Math Program"},{"issue":"5439","key":"1366_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"1366_CR8","doi-asserted-by":"crossref","unstructured":"Bissias GD, Levine BN, Rosenberg A (2007) Bounding damage from link destruction, with application to the internet. In: Proceedings of the 2007 ACM SIGMETRICS International Conference on Meas Mod of Comput Sys, ACM, pp 367\u2013368","DOI":"10.1145\/1254882.1254933"},{"issue":"5","key":"1366_CR9","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich P (1987) Power and centrality: A family of measures. Am J Sociol 92(5):1170\u20131182","journal-title":"Am J Sociol"},{"key":"1366_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10589-025-00698-5","volume":"92","author":"SJ Chen","year":"2025","unstructured":"Chen SJ, Chen L, Li GM, Dai YH (2025) Preprocessing and valid inequalities for exact detection of critical nodes via integer programming. Comput Optim Appl 92:215\u2013263","journal-title":"Comput Optim Appl"},{"key":"1366_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Di Summa","year":"2012","unstructured":"Di Summa M, Grosso A, Locatelli M (2012) Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput Optim Appl 53:649\u2013680","journal-title":"Comput Optim Appl"},{"key":"1366_CR12","doi-asserted-by":"crossref","unstructured":"Dinh TN, Thai MT (2011) Precise structural vulnerability assessment via mathematical programming. In: 2011-MILCOM 2011 Military Comn Conf, IEEE, pp 1351\u20131356","DOI":"10.1109\/MILCOM.2011.6127492"},{"issue":"3","key":"1366_CR13","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1109\/TNET.2014.2317486","volume":"23","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Thai MT (2014) Network under joint node and link attacks: Vulnerability assessment methods and analysis. IEEE\/ACM Trans Network 23(3):1001\u20131011","journal-title":"IEEE\/ACM Trans Network"},{"key":"1366_CR14","doi-asserted-by":"crossref","unstructured":"Dinh TN, Thai MT (2015) Assessing attack vulnerability in networks with uncertainty. In: 2015 IEEE Conf Comput Comn (INFOCOM), IEEE, pp 2380\u20132388","DOI":"10.1109\/INFOCOM.2015.7218626"},{"issue":"2","key":"1366_CR15","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"TN Dinh","year":"2011","unstructured":"Dinh TN, Xuan Y, Thai MT, Pardalos PM, Znati T (2011) On new approaches of assessing network vulnerability: Hardness and approximation. IEEE\/ACM Trans Network 20(2):609\u2013619","journal-title":"IEEE\/ACM Trans Network"},{"key":"1366_CR16","doi-asserted-by":"crossref","unstructured":"Dinh TN, Shen Y, Thai MT (2012) An efficient spectral bound for link vulnerability assessment in large-scale networks. In: 2012-MILCOM 2012 Military Comn Conf, IEEE, pp 1\u20136","DOI":"10.1109\/MILCOM.2012.6415860"},{"key":"1366_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10878-014-9742-0","volume":"28","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Thai MT, Nguyen HT (2014) Bound and exact methods for assessing link vulnerability in complex networks. J Comb Optim 28:3\u201324","journal-title":"J Comb Optim"},{"issue":"1","key":"1366_CR18","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"1366_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ijcip.2017.11.004","volume":"20","author":"L Faramondi","year":"2018","unstructured":"Faramondi L, Setola R, Panzieri S, Pascucci F, Oliva G (2018) Finding critical nodes in infrastructure networks. Int J Crit Infrastruct Prot 20:3\u201315","journal-title":"Int J Crit Infrastruct Prot"},{"issue":"4","key":"1366_CR20","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551\u2013570","journal-title":"J Soc Ind Appl Math"},{"issue":"1","key":"1366_CR21","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1177\/0160017607308679","volume":"31","author":"TH Grubesic","year":"2008","unstructured":"Grubesic TH, Matisziw TC, Murray AT, Snediker D (2008) Comparative approaches for assessing network vulnerability. Int Reg Sci Rev 31(1):88\u2013112","journal-title":"Int Reg Sci Rev"},{"issue":"4","key":"1366_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z Gu","year":"1998","unstructured":"Gu Z, Nemhauser GL, Savelsbergh MW (1998) Lifted cover inequalities for 0\u20131 integer programs: Computation. INFORMS J Comput 10(4):427\u2013437","journal-title":"INFORMS J Comput"},{"issue":"1","key":"1366_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/ijoc.11.1.117","volume":"11","author":"Z Gu","year":"1999","unstructured":"Gu Z, Nemhauser GL, Savelsbergh MW (1999) Lifted cover inequalities for 0\u20131 integer programs: Complexity. INFORMS J Comput 11(1):117\u2013123","journal-title":"INFORMS J Comput"},{"key":"1366_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu Z, Nemhauser GL, Savelsbergh MW (2000) Sequence independent lifting in mixed integer programming. J Comb Optim 4:109\u2013129","journal-title":"J Comb Optim"},{"key":"1366_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck O, Pochet Y (2001) Mixing mixed-integer inequalities. Math Prgm 90:429\u2013457","journal-title":"Math Prgm"},{"key":"1366_CR26","doi-asserted-by":"crossref","unstructured":"Hagberg A, Schult D, Swart P (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Sci Conf, pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"key":"1366_CR27","doi-asserted-by":"crossref","unstructured":"He J, Liang H, Yuan H (2011) Controlling infection by blocking nodes and links simultaneously. In: International Workshop on Internet and Network Economics, Springer, pp 206\u2013217","DOI":"10.1007\/978-3-642-25510-6_18"},{"key":"1366_CR28","unstructured":"IBM (2021) IBM ILOG CPLEX Optimization Studio 20.1.0. https:\/\/www.ibm.com\/analytics\/cplex-optimizer"},{"key":"1366_CR29","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of Comput Computations, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"1366_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz S (2012) On mixing sets arising in chance-constrained programming. Math Prgm 132(1):31\u201356","journal-title":"Math Prgm"},{"key":"1366_CR31","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou M, Tahraoui MA, Kheddouci H (2018) The critical node detection problem in networks: A survey. Comput Sci Rev 28:92\u2013117","journal-title":"Comput Sci Rev"},{"issue":"1","key":"1366_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0960-0779(03)00429-6","volume":"20","author":"V Latora","year":"2004","unstructured":"Latora V, Marchiori M (2004) How the science of complex networks can help developing strategies against terrorism. Chaos Solitons Fractals 20(1):69\u201375","journal-title":"Chaos Solitons Fractals"},{"key":"1366_CR33","unstructured":"Letchford J, Vorobeychik Y (2013) Optimal interdiction of attack plans. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-Agent Sys, pp 199\u2013206"},{"issue":"1","key":"1366_CR34","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke J (2014) A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math Prgm 146(1):219\u2013244","journal-title":"Math Prgm"},{"issue":"1","key":"1366_CR35","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw TC, Murray AT (2009) Modeling $$s$$-$$t$$ path availability to support disaster vulnerability assessment of network infrastructure. Comput Oper Res 36(1):16\u201326","journal-title":"Comput Oper Res"},{"issue":"17","key":"1366_CR36","doi-asserted-by":"publisher","first-page":"19770","DOI":"10.1007\/s11227-023-05429-3","volume":"79","author":"A Megzari","year":"2023","unstructured":"Megzari A, Pravija Raj P, Osamy W, Khedr AM (2023) Applications, challenges, and solutions to single-and multi-objective critical node detection problems: A survey. J Supercomput 79(17):19770\u201319808","journal-title":"J Supercomput"},{"issue":"4","key":"1366_CR37","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1111\/j.1468-2257.2008.00447.x","volume":"39","author":"AT Murray","year":"2008","unstructured":"Murray AT, Matisziw TC, Grubesic TH (2008) A methodological overview of network vulnerability analysis. Growth Chang 39(4):573\u2013592","journal-title":"Growth Chang"},{"issue":"3","key":"1366_CR38","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0377-2217(03)00135-8","volume":"156","author":"YS Myung","year":"2004","unstructured":"Myung YS, Hj K (2004) A cutting plane algorithm for computing $$k$$-edge survivability of a network. Eur J Oper Res 156(3):579\u2013589","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1366_CR39","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/mnsc.45.2.238","volume":"45","author":"YS Myung","year":"1999","unstructured":"Myung YS, Hj K, Dw T (1999) Design of communication networks with survivability constraints. Manage Sci 45(2):238\u2013252","journal-title":"Manage Sci"},{"issue":"1","key":"1366_CR40","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1287\/ijoc.2015.0671","volume":"28","author":"J Naoum-Sawaya","year":"2016","unstructured":"Naoum-Sawaya J, Buchheim C (2016) Robust critical node selection by Benders decomposition. INFORMS J Comput 28(1):162\u2013174","journal-title":"INFORMS J Comput"},{"issue":"1","key":"1366_CR41","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TSG.2012.2229398","volume":"4","author":"DT Nguyen","year":"2013","unstructured":"Nguyen DT, Shen Y, Thai MT (2013) Detecting critical nodes in interdependent power networks for vulnerability assessment. IEEE Trans Smart Grid 4(1):151\u2013159","journal-title":"IEEE Trans Smart Grid"},{"key":"1366_CR42","doi-asserted-by":"crossref","unstructured":"Nguyen LN, Thai MT (2019) Network resilience assessment via QoS degradation metrics: An algorithmic approach. In: Proceedings of the ACM Meas Anal Comput Syst 3:1\u201332","DOI":"10.1145\/3322205.3311072"},{"issue":"4","key":"1366_CR43","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"MW Padberg","year":"1975","unstructured":"Padberg MW (1975) A note on zero-one programming. Oper Res 23(4):833\u2013837","journal-title":"Oper Res"},{"key":"1366_CR44","doi-asserted-by":"publisher","first-page":"16774","DOI":"10.1109\/ACCESS.2017.2738565","volume":"5","author":"T Pan","year":"2017","unstructured":"Pan T, Mishra S, Nguyen LN, Lee G, Kang J, Seo J, Thai MT (2017) Threat from being social: Vulnerability analysis of social network coupled smart grid. IEEE Access 5:16774\u201316783","journal-title":"IEEE Access"},{"key":"1366_CR45","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2018.04.012","volume":"97","author":"K Pavlikov","year":"2018","unstructured":"Pavlikov K (2018) Improved formulations for minimum connectivity network interdiction problems. Comput Oper Res 97:48\u201357","journal-title":"Comput Oper Res"},{"key":"1366_CR46","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10732-015-9290-5","volume":"21","author":"W Pullan","year":"2015","unstructured":"Pullan W (2015) Heuristic identification of critical nodes in sparse real-world graphs. J Heuristics 21:577\u2013598","journal-title":"J Heuristics"},{"key":"1366_CR47","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conf artificial intelligence, vol 29","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"1366_CR48","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/TPWRS.2008.2004825","volume":"24","author":"J Salmeron","year":"2009","unstructured":"Salmeron J, Wood K, Baldick R (2009) Worst-case interdiction analysis of large-scale electric power grids. IEEE Trans Power Syst 24(1):96\u2013104","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"1366_CR49","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S Shen","year":"2012","unstructured":"Shen S, Smith JC, Goli R (2012a) Exact interdiction models and algorithms for disconnecting networks via node deletions. Discret Optim 9(3):172\u2013188","journal-title":"Discret Optim"},{"issue":"3","key":"1366_CR50","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","volume":"21","author":"Y Shen","year":"2012","unstructured":"Shen Y, Nguyen NP, Xuan Y, Thai MT (2012b) On the discovery of critical links and nodes for assessing network vulnerability. IEEE\/ACM Trans Network 21(3):963\u2013973","journal-title":"IEEE\/ACM Trans Network"},{"issue":"4","key":"1366_CR51","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/nav.21630","volume":"62","author":"Y Song","year":"2015","unstructured":"Song Y, Zhang M (2015) Chance-constrained multi-terminal network design problems. Nav Res Logist 62(4):321\u2013334","journal-title":"Nav Res Logist"},{"issue":"3","key":"1366_CR52","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TMC.2023.3248629","volume":"23","author":"J Tang","year":"2024","unstructured":"Tang J, Fu L, Long F, Wang X, Chen G, Zhou C (2024) Which link matters? Maintaining connectivity of uncertain networks under adversarial attack. IEEE Trans Mob Comput 23(3):2039\u20132053","journal-title":"IEEE Trans Mob Comput"},{"issue":"3","key":"1366_CR53","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.ejor.2017.08.053","volume":"265","author":"M Ventresca","year":"2018","unstructured":"Ventresca M, Harrison KR, Ombuki-Berman BM (2018) The bi-objective critical node detection problem. Eur J Oper Res 265(3):895\u2013908","journal-title":"Eur J Oper Res"},{"key":"1366_CR54","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10878-014-9730-4","volume":"28","author":"A Veremyev","year":"2014","unstructured":"Veremyev A, Prokopyev OA, Pasiliao EL (2014) An integer programming framework for critical elements detection in graphs. J Comb Optim 28:233\u2013273","journal-title":"J Comb Optim"},{"issue":"3","key":"1366_CR55","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.21622","volume":"66","author":"A Veremyev","year":"2015","unstructured":"Veremyev A, Prokopyev OA, Pasiliao EL (2015) Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3):170\u2013195","journal-title":"Networks"},{"issue":"3","key":"1366_CR56","doi-asserted-by":"publisher","first-page":"2052","DOI":"10.1109\/TNSE.2020.2972980","volume":"7","author":"L Zhang","year":"2020","unstructured":"Zhang L, Xia J, Cheng F, Qiu J, Zhang X (2020) Multi-objective optimization of critical node detection based on cascade model in complex networks. IEEE Trans Net Sci Eng 7(3):2052\u20132066","journal-title":"IEEE Trans Net Sci Eng"},{"issue":"3","key":"1366_CR57","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.ejor.2022.07.033","volume":"305","author":"X Zhang","year":"2023","unstructured":"Zhang X, Xu M, Su J, Zhao P (2023) Structural models for fog computing based internet of things architectures with insurance and risk management applications. Eur J Oper Res 305(3):1273\u20131291","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01366-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01366-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01366-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T16:02:18Z","timestamp":1767196938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01366-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1366"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01366-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"25 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 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 that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"38"}}