{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:34:41Z","timestamp":1763706881848,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100023581","name":"National Science Foundation Graduate Research Fellowship Program","doi-asserted-by":"publisher","award":["2237827"],"award-info":[{"award-number":["2237827"]}],"id":[{"id":"10.13039\/100023581","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2152766"],"award-info":[{"award-number":["DMS-2152766"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10915-024-02636-9","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:04:41Z","timestamp":1722967481000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Spectrally Constrained Optimization"],"prefix":"10.1007","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1581-570X","authenticated-orcid":false,"given":"Casey","family":"Garner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilad","family":"Lerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"2636_CR1","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2636_CR2","first-page":"127","volume":"22","author":"MW Benson","year":"1982","unstructured":"Benson, M.W.: Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems. Util. Math. 22, 127\u2013140 (1982)","journal-title":"Util. Math."},{"key":"2636_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"2636_CR4","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2636_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/151005099","volume":"57","author":"EJ Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, E.J., Eldar, Y.C., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM Rev. 57(2), 225\u2013251 (2015)","journal-title":"SIAM Rev."},{"key":"2636_CR6","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s10208-013-9162-z","volume":"14","author":"EJ Cand\u00e8s","year":"2014","unstructured":"Cand\u00e8s, E.J., Li, X.: Solving quadratic equations via PhaseLift when there are about as many equations as unknowns. Found. Comput. Math. 14, 1017\u20131026 (2014)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"2636_CR7","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925\u2013936 (2010)","journal-title":"Proc. IEEE"},{"key":"2636_CR8","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"2636_CR9","unstructured":"Chen, K.: Matrix Preconditioning Techniques and Applications. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press (2005)"},{"issue":"1","key":"2636_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-021-01629-6","volume":"64","author":"Z Chen","year":"2022","unstructured":"Chen, Z., Wang, S.: A review on matrix completion for recommender systems. Knowl. Inf. Syst. 64(1), 1\u201334 (2022)","journal-title":"Knowl. Inf. Syst."},{"key":"2636_CR11","doi-asserted-by":"crossref","unstructured":"Cullum, J., Donath, W.E., Wolfe, P.: The Minimization of Certain Nondifferentiable Sums of Eigenvalues of Symmetric Matrices. Nondifferentiable Optimization, pp. 35\u201355 (1975)","DOI":"10.1007\/BFb0120698"},{"issue":"7314","key":"2636_CR12","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature09419","volume":"467","author":"M Dierolf","year":"2010","unstructured":"Dierolf, M., Menzel, A., Thibault, P., Schneider, P., Kewish, C.M., Wepf, R., Bunk, O., Pfeiffer, F.: Ptychographic x-ray computed tomography at the nanoscale. Nature 467(7314), 436\u2013439 (2010)","journal-title":"Nature"},{"key":"2636_CR13","unstructured":"Dikin, I.I.: Iterative solution of problems of linear and quadratic programming. In: Doklady Akademii Nauk, Vol. 174, pp. 747\u2013748. Russian Academy of Sciences (1967)"},{"issue":"7","key":"2636_CR14","first-page":"1","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7), 1 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2636_CR15","doi-asserted-by":"crossref","first-page":"C1","DOI":"10.1111\/ectj.12061","volume":"19","author":"J Fan","year":"2016","unstructured":"Fan, J., Liao, Y., Liu, H.: An overview of the estimation of large covariance and precision matrices. Economet. J. 19(1), C1\u2013C32 (2016)","journal-title":"Economet. J."},{"key":"2636_CR16","unstructured":"Maryam, F.: Matrix Rank Minimization with Applications, Ph.D. thesis,. Stanford University (2002)"},{"key":"2636_CR17","unstructured":"Fienup, C., Dainty, J.: Phase retrieval and image reconstruction for astronomy. Image recovery: theory and application 231, 275 (1987)"},{"key":"2636_CR18","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"key":"2636_CR19","unstructured":"Gowda, M.S.: Optimizing certain combinations of spectral and linear\/distance functions over spectral sets. arXiv:1902.06640 (2019)"},{"issue":"3","key":"2636_CR20","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1137\/15M102825X","volume":"26","author":"WW Hager","year":"2016","unstructured":"Hager, W.W., Zhang, H.: Projection onto a polyhedron that exploits sparsity. SIAM J. Optim. 26(3), 1773\u20131798 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"2636_CR21","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1364\/JOSAA.10.001046","volume":"10","author":"RW Harrison","year":"1993","unstructured":"Harrison, R.W.: Phase problem in crystallography. JOSA a 10(5), 1046\u20131055 (1993)","journal-title":"JOSA a"},{"issue":"6","key":"2636_CR22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2636_CR23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008644520093","volume":"13","author":"JB Hiriart-Urruty","year":"1999","unstructured":"Hiriart-Urruty, J.B., Lewis, A.S.: The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix. Comput. Optim. Appl. 13, 13\u201323 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"2636_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press (1985)"},{"key":"2636_CR25","doi-asserted-by":"crossref","unstructured":"Kasten, Y., Geifman, A., Galun, M., Basri, R.: Algebraic characterization of essential matrices and their averaging in multiview settings. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 5895\u20135903 (2019)","DOI":"10.1109\/ICCV.2019.00599"},{"key":"2636_CR26","doi-asserted-by":"crossref","unstructured":"Ito, M., Louren\u00e7o, B.F.: Eigenvalue programming beyond matrices. arXiv:2311.04637 (2023)","DOI":"10.1007\/s10589-024-00591-7"},{"key":"2636_CR27","unstructured":"Jaganathan, K., Eldar, Y.C., Hassibi, B.: Phase retrieval: an overview of recent developments. Optical Compressive Imaging, pp. 279\u2013312 (2016)"},{"key":"2636_CR28","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-005-0627-y","volume":"104","author":"A Jourani","year":"2005","unstructured":"Jourani, A., Ye, J.J.: Error bounds for eigenvalue and semidefinite matrix inequality systems. Math. Program. 104, 525\u2013540 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"2636_CR29","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/16M1070025","volume":"39","author":"F Kangal","year":"2018","unstructured":"Kangal, F., Meerbergen, K., Mengi, E., Michiels, W.: A subspace method for large-scale eigenvalue optimization. SIAM J. Matrix Anal. Appl. 39(1), 48\u201382 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2636_CR30","unstructured":"Lacoste-Julien, S.: Convergence Rate of Frank-Wolfe for Non-Convex Objectives. arXiv:1607.00345 (2016)"},{"key":"2636_CR31","doi-asserted-by":"crossref","unstructured":"Lancaster, P., Rodman, L.: Algebraic Riccati equations. Clarendon Press (1995)","DOI":"10.1093\/oso\/9780198537953.001.0001"},{"key":"2636_CR32","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Proceedings of the 13th International Conference on Neural Information Processing Systems, NIPS\u201900, pp. 535\u2013541. MIT Press, Cambridge, MA (2000)"},{"issue":"8","key":"2636_CR33","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/JPROC.2018.2853141","volume":"106","author":"G Lerman","year":"2018","unstructured":"Lerman, G., Maunu, T.: An overview of robust subspace recovery. Proc. IEEE 106(8), 1380\u20131410 (2018)","journal-title":"Proc. IEEE"},{"issue":"3","key":"2636_CR34","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.21.3.576","volume":"21","author":"AS Lewis","year":"1996","unstructured":"Lewis, A.S.: Derivatives of spectral functions. Math. Oper. Res. 21(3), 576\u2013588 (1996)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2636_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107980004a","volume":"84","author":"AS Lewis","year":"1999","unstructured":"Lewis, A.S.: Nonsmooth analysis of eigenvalues. Math. Program. 84(1), 1\u201324 (1999)","journal-title":"Math. Program."},{"key":"2636_CR36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-003-0441-3","volume":"97","author":"AS Lewis","year":"2003","unstructured":"Lewis, A.S.: The mathematics of eigenvalue optimization. Math. Program. 97, 155\u2013176 (2003)","journal-title":"Math. Program."},{"key":"2636_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1017\/S0962492900002646","volume":"5","author":"AS Lewis","year":"1996","unstructured":"Lewis, A.S., Overton, M.L.: Eigenvalue optimization. Acta numerica 5, 149\u2013190 (1996)","journal-title":"Acta numerica"},{"issue":"2","key":"2636_CR38","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/S089547980036838X","volume":"23","author":"AS Lewis","year":"2001","unstructured":"Lewis, A.S., Sendov, H.S.: Twice differentiable spectral functions. SIAM J. Matrix Anal. Appl. 23(2), 368\u2013386 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2636_CR39","doi-asserted-by":"crossref","unstructured":"Li, Y., Xie, W.: On the Partial Convexification for Low-Rank Spectral Optimization: Rank Bounds and Algorithms. arXiv:2305.07638 (2023)","DOI":"10.1007\/978-3-031-59835-7_20"},{"key":"2636_CR40","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.laa.2022.10.012","volume":"656","author":"X Liang","year":"2023","unstructured":"Liang, X., Wang, L., Zhang, L.H., Li, R.C.: On generalizing trace minimization principles. Linear Algebra Appl. 656, 483\u2013509 (2023)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2636_CR41","first-page":"367","volume":"109","author":"AMC So","year":"2007","unstructured":"So, A.M.C., Yinyu, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109(2), 367\u2013384 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"2636_CR42","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1137\/130933472","volume":"35","author":"E Mengi","year":"2014","unstructured":"Mengi, E., Yildirim, E.A., Kilic, M.: Numerical optimization of eigenvalues of Hermitian matrix functions. SIAM J. Matrix Anal. Appl. 35(2), 699\u2013724 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2636_CR43","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1364\/JOSAA.7.000394","volume":"7","author":"RP Millane","year":"1990","unstructured":"Millane, R.P.: Phase retrieval in crystallography and optics. JOSA A 7(3), 394\u2013411 (1990)","journal-title":"JOSA A"},{"key":"2636_CR44","unstructured":"Ortegar, J.M.: Numerical Analysis. Society for Industrial and Applied Mathematics (1990)"},{"issue":"1","key":"2636_CR45","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"ML Overton","year":"1992","unstructured":"Overton, M.L.: Large-scale optimization of eigenvalues. SIAM J. Optim. 2(1), 88\u2013120 (1992)","journal-title":"SIAM J. Optim."},{"key":"2636_CR46","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0609040","volume":"9","author":"ML Overton","year":"1988","unstructured":"Overton, M.L., Womersley, R.S.: On minimizing the spectral radius of a nonsymmetric matrix function: Optimality conditions and duality theory. SIAM Matrix Anal. Appt. 9, 473 (1988)","journal-title":"SIAM Matrix Anal. Appt."},{"issue":"1\u20133","key":"2636_CR47","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585173","volume":"62","author":"ML Overton","year":"1993","unstructured":"Overton, M.L., Womersley, R.S.: Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Program. 62(1\u20133), 321\u2013357 (1993)","journal-title":"Math. Program."},{"key":"2636_CR48","doi-asserted-by":"crossref","unstructured":"Penot, J.-P.: Calculus without derivatives, vol. 266. Springer (2013)","DOI":"10.1007\/978-1-4614-4538-8"},{"key":"2636_CR49","unstructured":"Qu, Z., Gao, W., Hinder, O., Ye, Y., Zhou, Z. Optimal Diagonal Preconditioning: Theory and Practice. arXiv:2209.00809 (2022)"},{"key":"2636_CR50","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"issue":"3","key":"2636_CR51","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1137\/0805028","volume":"5","author":"A Shapiro","year":"1995","unstructured":"Shapiro, A., Fan, M.K.: On eigenvalue optimization. SIAM J. Optim. 5(3), 552\u2013569 (1995)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2636_CR52","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1007\/s11590-013-0632-7","volume":"8","author":"M Tanaka","year":"2014","unstructured":"Tanaka, M., Nakata, K.: Positive definite matrix approximation with condition number constraint. Optim. Lett. 8(3), 939\u2013947 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"2636_CR53","doi-asserted-by":"crossref","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."},{"issue":"4","key":"2636_CR54","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MSP.2018.2826566","volume":"35","author":"N Vaswani","year":"2018","unstructured":"Vaswani, N., Bouwmans, T., Javed, S., Narayanamurthy, P.: Robust subspace learning: Robust pca, robust subspace tracking, and robust subspace recovery. IEEE Signal Process. Mag. 35(4), 32\u201355 (2018)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"2636_CR55","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592148","volume":"74","author":"SA Vavasis","year":"1996","unstructured":"Vavasis, S.A., Ye, Y.: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74(1), 79\u2013120 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"2636_CR56","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/TIT.2017.2756858","volume":"64","author":"G Wang","year":"2017","unstructured":"Wang, G., Giannakis, G.B., Eldar, Y.C.: Solving systems of random quadratic equations via truncated amplitude flow. IEEE Trans. Inf. Theory 64(2), 773\u2013794 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2636_CR57","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1017\/S0962492915000021","volume":"24","author":"AJ Wathen","year":"2015","unstructured":"Wathen, A.J.: Preconditioning. Acta Numer 24, 329\u2013376 (2015)","journal-title":"Acta Numer"},{"issue":"3","key":"2636_CR58","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1111\/j.1467-9868.2012.01049.x","volume":"75","author":"J-H Won","year":"2013","unstructured":"Won, J.-H., Lim, J., Kim, S.-J., Rajaratnam, B.: Condition-number-regularized covariance estimation. J. R. Stat. Soc.: Ser. B (Stat. Methodol.) 75(3), 427\u2013450 (2013)","journal-title":"J. R. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"key":"2636_CR59","first-page":"1","volume":"13","author":"Y Ying","year":"2012","unstructured":"Ying, Y., Li, P.: Distance Metric Learning with Eigenvalue Optimization. J. Mach. Learn. Res. 13, 1\u201326 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"2636_CR60","doi-asserted-by":"crossref","unstructured":"Zhang, D., Hu, Y., Ye, J., Li, X., He, X.: Matrix completion by truncated nuclear norm regularization. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2192\u20132199 (2012)","DOI":"10.1109\/CVPR.2012.6247927"},{"issue":"3","key":"2636_CR61","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/S105262349834429X","volume":"10","author":"S Zhang","year":"2000","unstructured":"Zhang, S.: Global error bounds for convex conic problems. SIAM J. Optim. 10(3), 836\u2013851 (2000)","journal-title":"SIAM J. Optim."},{"issue":"13","key":"2636_CR62","doi-asserted-by":"crossref","first-page":"3614","DOI":"10.1109\/TSP.2018.2835403","volume":"66","author":"Z Zhu","year":"2018","unstructured":"Zhu, Z., Li, Q., Tang, G., Wakin, M.B.: Global optimality in low-rank matrix optimization. IEEE Trans. Signal Process. 66(13), 3614\u20133628 (2018)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02636-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02636-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02636-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T06:50:03Z","timestamp":1732603803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02636-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,6]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2636"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02636-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2024,8,6]]},"assertion":[{"value":"20 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":4,"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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"89"}}