{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:25:39Z","timestamp":1769732739119,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["ECCS-2154650"],"award-info":[{"award-number":["ECCS-2154650"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["CMMI-2320697"],"award-info":[{"award-number":["CMMI-2320697"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["CAREER 2340713"],"award-info":[{"award-number":["CAREER 2340713"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10589-025-00735-3","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:10:25Z","timestamp":1759299025000},"page":"523-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An overview and comparison of spectral bundle methods for primal and dual semidefinite programs"],"prefix":"10.1007","volume":"93","author":[{"given":"Feng-Yi","family":"Liao","sequence":"first","affiliation":[]},{"given":"Lijun","family":"Ding","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1545-231X","authenticated-orcid":false,"given":"Yang","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"issue":"1","key":"735_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"735_CR2","doi-asserted-by":"crossref","unstructured":"Blekherman, G., Parrilo, P. A., Thomas, R. R.: SIAM, Semidefinite optimization and convex algebraic geometry (2012)","DOI":"10.1137\/1.9781611972290"},{"key":"735_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.arcontrol.2021.09.001","volume":"52","author":"Y Zheng","year":"2021","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A.: Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization. Annu. Rev. Control. 52, 243\u2013279 (2021)","journal-title":"Annu. Rev. Control."},{"issue":"4","key":"735_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.S., et al.: Chordal graphs and semidefinite optimization. Found. Trends Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends Optim."},{"key":"735_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1146\/annurev-control-091819-074326","volume":"3","author":"Anirudha Majumdar","year":"2020","unstructured":"Majumdar, Anirudha, Hall, Georgina, Ahmadi, Amir Ali: Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics. Ann. Rev. Control, Robot., Autonom. Syst. 3, 331\u2013360 (2020)","journal-title":"Ann. Rev. Control, Robot., Autonom. Syst."},{"key":"735_CR6","doi-asserted-by":"crossref","unstructured":"Boyd, S., El\u00a0Ghaoui, L., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. SIAM, (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"735_CR7","doi-asserted-by":"crossref","unstructured":"Sotirov, R.: SDP relaxations for some combinatorial optimization problems. In: Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 795\u2013819. Springer, (2012)","DOI":"10.1007\/978-1-4614-0769-0_27"},{"key":"735_CR8","unstructured":"Lanckriet, G.R.G., Cristianini, N., Bartlett, P., Ghaoui, L.E.l., Jordan, M.I.,: Learning the kernel matrix with semidefinite programming. J. Mach. Learn. Res. 5, 27\u201372 (2004)"},{"issue":"3","key":"735_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0168-9274(98)00098-1","volume":"29","author":"L Vandenberghe","year":"1999","unstructured":"Vandenberghe, L., Boyd, S.: Applications of semidefinite programming. Appl. Numer. Math. 29(3), 283\u2013299 (1999)","journal-title":"Appl. Numer. Math."},{"key":"735_CR10","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming: theory, algorithms, and applications, volume\u00a027. Springer (2012)"},{"key":"735_CR11","doi-asserted-by":"crossref","unstructured":"Ahmadi, A.A., Hall, G., Papachristodoulou, A., Saunderson, J., Zheng, Y.: Improving efficiency and scalability of sum of squares optimization: Recent advances and limitations. In 2017 IEEE 56th annual conference on decision and control (CDC), pp. 453\u2013462. IEEE, (2017)","DOI":"10.1109\/CDC.2017.8263706"},{"issue":"3","key":"735_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"735_CR13","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"735_CR14","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10957-021-01896-x","volume":"190","author":"M Garstka","year":"2021","unstructured":"Garstka, M., Cannon, M., Goulart, P.: Cosmo: a conic operator splitting method for convex conic problems. J. Optim. Theory Appl. 190(3), 779\u2013810 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"735_CR15","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D., Toh, K.-C.: A newton-cg augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"735_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.-C.: Sdpnal+: a majorized semismooth newton-cg augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"735_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1137\/19M1305045","volume":"3","author":"Alp Yurtsever","year":"2021","unstructured":"Yurtsever, Alp, Tropp, Joel A., Fercoq, Olivier, Udell, Madeleine, Cevher, Volkan: Scalable semidefinite programming. SIAM J. Math. Data Sci. 3(1), 171\u2013200 (2021)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"4","key":"735_CR18","doi-asserted-by":"publisher","first-page":"2695","DOI":"10.1137\/19M1244603","volume":"31","author":"Lijun Ding","year":"2021","unstructured":"Ding, Lijun, Yurtsever, Alp, Cevher, Volkan, Tropp, Joel A., Udell, Madeleine: An optimal-storage approach to semidefinite programming using approximate complementarity. SIAM J. Optim. 31(4), 2695\u20132725 (2021)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"735_CR19","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"735_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s101070100270","volume":"93","author":"Christoph Helmberg","year":"2002","unstructured":"Helmberg, Christoph, Kiwiel, Krzysztof C.: A spectral bundle method with bounds. Math. Program. 93(2), 173\u2013194 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"735_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"key":"735_CR22","unstructured":"Boumal, N., Voroninski, V., Bandeira, A.: The non-convex Burer-Monteiro approach works on smooth semidefinite programs. Adv. Neural Inf. Process. Syst. 29, (2016)"},{"key":"735_CR23","unstructured":"Ge, R., Jin, C., Zheng, Y.: No spurious local minima in nonconvex low rank problems: A unified geometric analysis. In International Conference on Machine Learning, pp. 1233\u20131242. PMLR, (2017)"},{"issue":"3","key":"735_CR24","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1137\/19M1255318","volume":"30","author":"I Waldspurger","year":"2020","unstructured":"Waldspurger, I., Waters, A.: Rank optimality for the Burer-Monteiro factorization. SIAM J. Optim. 30(3), 2577\u20132602 (2020)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"735_CR25","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/21M1402340","volume":"33","author":"L Ding","year":"2023","unstructured":"Ding, L., Grimmer, B.: Revisiting spectral bundle methods: primal-dual (sub) linear convergence rates. SIAM J. Optim. 33(2), 1305\u20131332 (2023)","journal-title":"SIAM J. Optim."},{"key":"735_CR26","unstructured":"Ding, L., Fei, Y., Xu, Q., Yang, C.: Spectral frank-wolfe algorithm: Strict complementarity and linear convergence. In International conference on machine learning, pp. 2535\u20132544. PMLR, (2020)"},{"key":"735_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1090\/conm\/685\/13712","volume":"685","author":"AA Ahmadi","year":"2017","unstructured":"Ahmadi, A.A.: Georgina Hall: sum of squares basis pursuit with linear and second order cone programming. Algebraic Geometric Methods Discrete Math. 685, 27\u201353 (2017)","journal-title":"Algebraic Geometric Methods Discrete Math."},{"key":"735_CR28","doi-asserted-by":"crossref","unstructured":"Liao, F.-Y., Zheng, Y.: Iterative inner\/outer approximations for scalable semidefinite programs using block factor-width-two matrices. In 2022 IEEE 61st Conference on Decision and Control (CDC), pp. 7591\u20137597. IEEE, (2022)","DOI":"10.1109\/CDC51059.2022.9992734"},{"issue":"4","key":"735_CR29","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1080\/10556788.2013.858155","volume":"29","author":"C Helmberg","year":"2014","unstructured":"Helmberg, C., Overton, M.L., Rendl, F.: The spectral bundle method with second-order information. Optim. Methods Softw. 29(4), 855\u2013876 (2014)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"735_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/060665191","volume":"19","author":"P Apkarian","year":"2008","unstructured":"Apkarian, P., Noll, D., Prot, O.: A trust region spectral bundle method for nonconvex eigenvalue optimization. SIAM J. Optim. 19(1), 281\u2013306 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"735_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"Pablo A Parrilo","year":"2003","unstructured":"Parrilo, Pablo A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"735_CR32","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Moments, positive polynomials and their applications, volume\u00a01. World Scientific, (2009)","DOI":"10.1142\/p665"},{"issue":"3","key":"735_CR33","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s10957-017-1108-1","volume":"173","author":"D Yu","year":"2017","unstructured":"Yu, D., Ruszczy\u0144ski, A.: Rate of convergence of the bundle method. J. Optim. Theory Appl. 173(3), 908\u2013922 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"735_CR34","unstructured":"Ruszczynski, A.: Nonlinear Optimization. Princeton University Press (2011)"},{"issue":"2","key":"735_CR35","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/21M1428601","volume":"33","author":"M D\u00edaz","year":"2023","unstructured":"D\u00edaz, M., Grimmer, B.: Optimal convergence rates for the proximal bundle method. SIAM J. Optim. 33(2), 424\u2013454 (2023)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"735_CR36","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"Kim-Chuan Toh","year":"1999","unstructured":"Toh, Kim-Chuan., Todd, Michael J., T\u00fct\u00fcnc\u00fc, Reha H.: SDPT3-a matlab software package for semidefinite programming , version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"735_CR37","unstructured":"MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. Version 9.0., (2019)"},{"key":"735_CR38","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: CDCS: Cone decomposition conic solver, version 1.1. https:\/\/github.com\/giofantuzzi\/CDCS, (September 2016)"},{"key":"735_CR39","unstructured":"Liao, F.-Y., Ding, L., Zheng, Y.: An overview and comparison of spectral bundle methods for primal and dual semidefinite programs. Technical report, available at arXiv preprint arXiv:2307.07651, (2023)"},{"key":"735_CR40","doi-asserted-by":"crossref","unstructured":"Boyd, S., Boyd, S. P, Vandenberghe, L.: Cambridge University Press, Convex optimization (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"1","key":"735_CR41","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02614432","volume":"77","author":"Farid Alizadeh","year":"1997","unstructured":"Alizadeh, Farid, Haeberly, Jean-Pierre A., Overton, Michael L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77(1), 111\u2013128 (1997)","journal-title":"Math. Program."},{"issue":"4","key":"735_CR42","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.1137\/20M1346262","volume":"31","author":"L Ding","year":"2021","unstructured":"Ding, L., Udell, M.: On the simplicity and conditioning of low rank semidefinite programs. SIAM J. Optim. 31(4), 2614\u20132637 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"735_CR43","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s12532-023-00243-7","volume":"15","author":"NHA Mai","year":"2023","unstructured":"Mai, N.H.A., Lasserre, J.-B., Magron, V.: A hierarchy of spectral relaxations for polynomial optimization. Math. Program. Comput. 15(4), 651\u2013701 (2023)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"735_CR44","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1004689609425","volume":"104","author":"Krzysztof C Kiwiel","year":"2000","unstructured":"Kiwiel, Krzysztof C.: Efficiency of proximal bundle methods. J. Optim. Theory Appl. 104(3), 589\u2013603 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"735_CR45","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"Michael L Overton","year":"1992","unstructured":"Overton, Michael L.: Large-scale optimization of eigenvalues. SIAM J. Optim. 2(1), 88\u2013120 (1992)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"735_CR46","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"Michel X Goemans","year":"1995","unstructured":"Goemans, Michel X., Williamson, David P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"735_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20134","key":"735_CR48","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"Jos F Sturm","year":"1999","unstructured":"Sturm, Jos F.: Using sedumi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"735_CR49","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/151005099","volume":"57","author":"E Candes","year":"2015","unstructured":"Candes, E., Eldar, Y., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM Rev. 57(2), 225\u2013251 (2015)","journal-title":"SIAM Rev."},{"issue":"6","key":"735_CR50","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"issue":"1","key":"735_CR51","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"Krzysztof C Kiwiel","year":"1990","unstructured":"Kiwiel, Krzysztof C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1), 105\u2013122 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"735_CR52","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/TAC.2022.3151187","volume":"68","author":"Y Zheng","year":"2023","unstructured":"Zheng, Y., Sootla, A., Papachristodoulou, A.: Block factor-width-two matrices and their applications to semidefinite and sum-of-squares optimization. IEEE Trans. Autom. Control 68(2), 943\u2013958 (2023)","journal-title":"IEEE Trans. Autom. Control"},{"key":"735_CR53","unstructured":"Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., Parrilo, P.\u00a0A.: SOSTOOLS: Sum of squares optimization toolbox for MATLAB. arXiv:1310.4716, (2013)"},{"issue":"9","key":"735_CR54","doi-asserted-by":"publisher","first-page":"3869","DOI":"10.1109\/TAC.2018.2886170","volume":"64","author":"Y Zheng","year":"2018","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A.: Fast admm for sum-of-squares programs using partial orthogonality. IEEE Trans. Autom. Control 64(9), 3869\u20133876 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"735_CR55","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1561\/2400000011","volume":"3","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Wolkowicz, H.: The many faces of degeneracy in conic optimization. Found. Trends Optim. 3(2), 77\u2013170 (2017)","journal-title":"Found. Trends Optim."},{"issue":"4","key":"735_CR56","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1137\/S1052623498338606","volume":"10","author":"Jos F Sturm","year":"2000","unstructured":"Sturm, Jos F.: Error bounds for linear matrix inequalities. SIAM J. Optim. 10(4), 1228\u20131248 (2000)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00735-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00735-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00735-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:01:43Z","timestamp":1769688103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00735-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["735"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00735-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"16 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 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 have no Conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research does not involve any study of humans or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}