{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:12:54Z","timestamp":1771027974221,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:00:00Z","timestamp":1620000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:00:00Z","timestamp":1620000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10208-021-09516-w","type":"journal-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T21:54:49Z","timestamp":1620078889000},"page":"561-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Proximal Methods Avoid Active Strict Saddles of Weakly Convex Functions"],"prefix":"10.1007","volume":"22","author":[{"given":"Damek","family":"Davis","sequence":"first","affiliation":[]},{"given":"Dmitriy","family":"Drusvyatskiy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,3]]},"reference":[{"issue":"2","key":"9516_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00940629","volume":"70","author":"F Al-Khayyal","year":"1991","unstructured":"F.\u00a0Al-Khayyal and J.\u00a0Kyparisis. Finite convergence of algorithms for nonlinear programs and variational inequalities. J. Optim. Theory Appl., 70(2):319\u2013332, 1991.","journal-title":"J. Optim. Theory Appl."},{"key":"9516_CR2","doi-asserted-by":"crossref","unstructured":"P.\u00a0Albano and P.\u00a0Cannarsa. Singularities of semiconcave functions in Banach spaces. In Stochastic analysis, control, optimization and applications, Systems Control Found. Appl., pages 171\u2013190. Birkh\u00e4user Boston, Boston, MA, 1999.","DOI":"10.1007\/978-1-4612-1784-8_10"},{"issue":"1\u20132","key":"9516_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"H.\u00a0Attouch, J.\u00a0Bolte, and B.F. Svaiter. Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized gauss\u2013seidel methods. Mathematical Programming, 137(1-2):91\u2013129, 2013.","journal-title":"Mathematical Programming"},{"key":"9516_CR4","unstructured":"D.\u00a0Avdiukhin, c.\u00a0Jin, and G.\u00a0Yaroslavtsev. Escaping saddle points with inequality constraints via noisy sticky projected gradient descent. Optimization for Machine Learning Workshop, 2019."},{"issue":"1","key":"9516_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"A.\u00a0Beck and M.\u00a0Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci., 2(1):183\u2013202, 2009.","journal-title":"SIAM J. Imaging Sci."},{"key":"9516_CR6","unstructured":"S.\u00a0Bhojanapalli, B.\u00a0Neyshabur, and N.\u00a0Srebro. Global optimality of local search for low rank matrix recovery. In Advances in Neural Information Processing Systems, pages 3873\u20133881, 2016."},{"issue":"2","key":"9516_CR7","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"J.\u00a0Bolte, A.\u00a0Daniilidis, A.\u00a0Lewis, and M.\u00a0Shiota. Clarke subgradients of stratifiable functions. SIAM Journal on Optimization, 18(2):556\u2013572, 2007.","journal-title":"SIAM Journal on Optimization"},{"key":"9516_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"J.F. Bonnans and A.\u00a0Shapiro. Perturbation Analysis of Optimization Problems. Springer, New York, 2000."},{"issue":"3","key":"9516_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"JV Burke","year":"1985","unstructured":"J.V. Burke. Descent methods for composite nondifferentiable optimization problems. Math. Programming, 33(3):260\u2013279, 1985.","journal-title":"Math. Programming"},{"issue":"4","key":"9516_CR10","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/0727064","volume":"27","author":"JV Burke","year":"1990","unstructured":"J.V. Burke. On the identification of active constraints. II. The nonconvex case. SIAM J. Numer. Anal., 27(4):1081\u20131103, 1990.","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"9516_CR11","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"JV Burke","year":"1988","unstructured":"J.V. Burke and J.J. Mor\u00e9. On the identification of active constraints. SIAM J. Numer. Anal., 25(5):1197\u20131211, 1988.","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"9516_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"P.H. Calamai and J.J. Mor\u00e9. Projected gradient methods for linearly constrained problems. Math. Prog., 39(1):93\u2013116, 1987.","journal-title":"Math. Prog."},{"key":"9516_CR13","doi-asserted-by":"crossref","unstructured":"V.\u00a0Charisopoulos, Y.\u00a0Chen, D.\u00a0Davis, M.\u00a0D\u00edaz, L.\u00a0Ding, and D.\u00a0Drusvyatskiy. Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence. Foundations of Computational Mathematics, pages 1\u201389, 2021.","DOI":"10.1007\/s10208-020-09490-9"},{"key":"9516_CR14","unstructured":"F.H. Clarke, Yu. Ledyaev, R.I. Stern, and P.R. Wolenski. Nonsmooth Analysis and Control Theory. Texts in Math. 178, Springer, New York, 1998."},{"key":"9516_CR15","unstructured":"C.\u00a0Criscitiello and N.\u00a0Boumal. Efficiently escaping saddle points on manifolds. In Advances in Neural Information Processing Systems, volume\u00a032. Curran Associates, Inc., 2019."},{"issue":"1","key":"9516_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"D.\u00a0Davis and D.\u00a0Drusvyatskiy. Stochastic model-based minimization of weakly convex functions. SIAM Journal on Optimization, 29(1):207\u2013239, 2019.","journal-title":"SIAM Journal on Optimization"},{"key":"9516_CR17","unstructured":"D.\u00a0Drusvyatskiy. The proximal point method revisited. SIAG\/OPT Views and News, 26(2), 2018."},{"issue":"1","key":"9516_CR18","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/15M1020770","volume":"26","author":"D Drusvyatskiy","year":"2016","unstructured":"D.\u00a0Drusvyatskiy, A.D. Ioffe, and A.S. Lewis. Generic minimizing behavior in semialgebraic optimization. SIAM Journal on Optimization, 26(1):513\u2013534, 2016.","journal-title":"SIAM Journal on Optimization"},{"key":"9516_CR19","doi-asserted-by":"crossref","unstructured":"D.\u00a0Drusvyatskiy and A.S. Lewis. Optimality, identifiablity, and sensitivity. Math. Program., 147(1-2, Ser. A):467\u2013498, 2014.","DOI":"10.1007\/s10107-013-0730-4"},{"issue":"3","key":"9516_CR20","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"D.\u00a0Drusvyatskiy and A.S. Lewis. Error bounds, quadratic growth, and linear convergence of proximal methods. Mathematics of Operations Research, 43(3):919\u2013948, 2018.","journal-title":"Mathematics of Operations Research"},{"issue":"1\u20132","key":"9516_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"D.\u00a0Drusvyatskiy and C.\u00a0Paquette. Efficiency of minimizing compositions of convex functions and smooth maps. Mathematical Programming, 178(1-2):503\u2013558, 2019.","journal-title":"Mathematical Programming"},{"key":"9516_CR22","unstructured":"S.S. Du, C.\u00a0Jin, J.D. Lee, M.I. Jordan, A.\u00a0Singh, and B.\u00a0Poczos. Gradient descent can take exponential time to escape saddle points. In Advances in neural information processing systems, pages 1067\u20131077, 2017."},{"issue":"4","key":"9516_CR23","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1137\/17M1135086","volume":"28","author":"JC Duchi","year":"2018","unstructured":"J.C. Duchi and F.\u00a0Ruan. Stochastic methods for composite and weakly convex optimization problems. SIAM Journal on Optimization, 28(4):3229\u20133259, 2018.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"9516_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF00939081","volume":"55","author":"JC Dunn","year":"1987","unstructured":"J.C. Dunn. On the convergence of projected gradient processes to singular critical points. J. Optim. Theory Appl., 55(2):203\u2013216, 1987.","journal-title":"J. Optim. Theory Appl."},{"key":"9516_CR25","doi-asserted-by":"crossref","unstructured":"M.C. Ferris. Finite termination of the proximal point algorithm. Math. Program., 50(3, (Ser. A)):359\u2013366, 1991.","DOI":"10.1007\/BF01594944"},{"key":"9516_CR26","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01581092","volume":"57","author":"SD Fl\u00e5m","year":"1992","unstructured":"S.D. Fl\u00e5m. On finite convergence and constraint identification of subgradient projection methods. Math. Program., 57:427\u2013437, 1992.","journal-title":"Math. Program."},{"key":"9516_CR27","unstructured":"R.\u00a0Ge, F.\u00a0Huang, C.\u00a0Jin, and Y.\u00a0Yuan. Escaping from saddle points\u2014online stochastic gradient for tensor decomposition. In Conference on Learning Theory, pages 797\u2013842, 2015."},{"key":"9516_CR28","unstructured":"R.\u00a0Ge, C.\u00a0Jin, and Y.\u00a0Zheng. No spurious local minima in nonconvex low rank problems: A unified geometric analysis. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pages 1233\u20131242. JMLR. org, 2017."},{"key":"9516_CR29","unstructured":"R.\u00a0Ge, J.D. Lee, and T.\u00a0Ma. Matrix completion has no spurious local minimum. In Advances in Neural Information Processing Systems, pages 2973\u20132981, 2016."},{"issue":"2","key":"9516_CR30","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s10957-020-01713-x","volume":"186","author":"N Hallak","year":"2020","unstructured":"N.\u00a0Hallak and M.\u00a0Teboulle. Finding second-order stationary points in constrained minimization: A feasible direction approach. Journal of Optimization Theory and Applications, 186(2):480\u2013503, 2020.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"9516_CR31","first-page":"75","volume":"2","author":"WL Hare","year":"2007","unstructured":"W.L. Hare and A.S. Lewis. Identifying active manifolds. Algorithmic Oper. Res., 2(2):75\u201382, 2007.","journal-title":"Algorithmic Oper. Res."},{"key":"9516_CR32","unstructured":"C.\u00a0Jin, P.\u00a0Netrapalli, and M.\u00a0Jordan. What is local optimality in nonconvex-nonconcave minimax optimization? In International Conference on Machine Learning, pages 4880\u20134889. PMLR, 2020."},{"key":"9516_CR33","unstructured":"R.\u00a0Jin, C.and\u00a0Ge, P.\u00a0Netrapalli, S.M. Kakade, and M.I. Jordan. How to escape saddle points efficiently. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pages 1724\u20131732. JMLR. org, 2017."},{"issue":"1\u20132","key":"9516_CR34","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","volume":"176","author":"JD Lee","year":"2019","unstructured":"J.D. Lee, I.\u00a0Panageas, G.\u00a0Piliouras, M.\u00a0Simchowitz, M.I. Jordan, and B.\u00a0Recht. First-order methods almost always avoid strict saddle points. Math. Program., 176(1-2):311\u2013337, 2019.","journal-title":"Math. Program."},{"key":"9516_CR35","unstructured":"J.D. Lee, M.\u00a0Simchowitz, M.I. Jordan, and B.\u00a0Recht. Gradient descent only converges to minimizers. In Conference on learning theory, pages 1246\u20131257, 2016a."},{"key":"9516_CR36","doi-asserted-by":"crossref","unstructured":"J.M. Lee. Smooth manifolds. In Introduction to Smooth Manifolds, pages 1\u201331. Springer, 2013.","DOI":"10.1007\/978-1-4419-9982-5_1"},{"key":"9516_CR37","unstructured":"Sangkyun Lee and Stephen\u00a0J Wright. Manifold identification in dual averaging for regularized stochastic online learning. Journal of Machine Learning Research, 13(Jun):1705\u20131744, 2012."},{"key":"9516_CR38","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1090\/S0002-9947-99-02243-6","volume":"352","author":"C Lemar\u00e9chal","year":"1996","unstructured":"C.\u00a0Lemar\u00e9chal, F.\u00a0Oustry, and C.\u00a0Sagastiz\u00e1bal. The U-lagrangian of a convex function. Trans. Amer. Math. Soc., 352:711\u2013729, 1996.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9516_CR39","doi-asserted-by":"crossref","unstructured":"A.S. Lewis. Active sets, nonsmoothness, and sensitivity. SIAM J. Optim., 13(3):702\u2013725 (electronic) (2003), 2002.","DOI":"10.1137\/S1052623401387623"},{"key":"9516_CR40","doi-asserted-by":"crossref","unstructured":"A.S. Lewis and S.J. Wright. A proximal method for composite minimization. Math. Program., pages 1\u201346, 2015.","DOI":"10.1007\/s10107-015-0943-9"},{"issue":"1","key":"9516_CR41","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/110852103","volume":"23","author":"AS Lewis","year":"2013","unstructured":"A.S. Lewis and S.\u00a0Zhang. Partial smoothness, tilt stability, and generalized Hessians. SIAM Journal on Optimization, 23(1):74\u201394, 2013.","journal-title":"SIAM Journal on Optimization"},{"key":"9516_CR42","doi-asserted-by":"crossref","unstructured":"B.\u00a0Martinet. R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Rech. Op\u00e9rationnelle, 4(S\u00e9r. R-3):154\u2013158, 1970.","DOI":"10.1051\/m2an\/197004R301541"},{"key":"9516_CR43","unstructured":"B.\u00a0Martinet. D\u00e9termination approch\u00e9e d\u2019un point fixe d\u2019une application pseudo-contractante. Cas de l\u2019application prox. C. R. Acad. Sci. Paris S\u00e9r. A-B, 274:A163\u2013A165, 1972."},{"key":"9516_CR44","unstructured":"A.\u00a0Mokhtari, A.\u00a0Ozdaglar, and A.\u00a0Jadbabaie. Escaping saddle points in constrained optimization. In Advances in Neural Information Processing Systems, pages 3629\u20133639, 2018."},{"key":"9516_CR45","doi-asserted-by":"crossref","unstructured":"B.S. Mordukhovich. Variational analysis and generalized differentiation. I, volume 330 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 2006. Basic theory.","DOI":"10.1007\/3-540-31246-3"},{"key":"9516_CR46","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"J.-J. Moreau. Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France, 93:273\u2013299, 1965.","journal-title":"Bull. Soc. Math. France"},{"issue":"3","key":"9516_CR47","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Yu Nesterov","year":"2007","unstructured":"Yu. Nesterov. Modified Gauss\u2013Newton scheme with worst case guarantees for global performance. Optimisation Methods and Software, 22(3):469\u2013483, 2007.","journal-title":"Optimisation Methods and Software"},{"issue":"1","key":"9516_CR48","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Yu Nesterov","year":"2013","unstructured":"Yu. Nesterov. Gradient methods for minimizing composite functions. Mathematical Programming, 140(1):125\u2013161, 2013.","journal-title":"Mathematical Programming"},{"key":"9516_CR49","unstructured":"M.\u00a0Nouiehed, J.D. Lee, and M.\u00a0Razaviyayn. Convergence to second-order stationarity for constrained non-convex optimization. arXiv preprint arXiv:1810.02024, 2018."},{"issue":"1","key":"9516_CR50","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01068677","volume":"9","author":"EA Nurminskii","year":"1973","unstructured":"E.A. Nurminskii. The quasigradient method for the solving of the nonlinear programming problems. Cybernetics, 9(1):145\u2013150, 1973.","journal-title":"Cybernetics"},{"key":"9516_CR51","unstructured":"I.\u00a0Panageas and G.\u00a0Piliouras. Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions. arXiv preprint arXiv:1605.00405, 2016."},{"issue":"6","key":"9516_CR52","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.orl.2016.10.003","volume":"44","author":"E Pauwels","year":"2016","unstructured":"E.\u00a0Pauwels. The value function approach to convergence analysis in composite optimization. Operations Research Letters, 44(6):790\u2013795, 2016.","journal-title":"Operations Research Letters"},{"key":"9516_CR53","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"RA Poliquin","year":"1996","unstructured":"R.A. Poliquin and R.T. Rockafellar. Prox-regular functions in variational analysis. Trans. Amer. Math. Soc., 348:1805\u20131838, 1996.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9516_CR54","unstructured":"R.T. Rockafellar. Convex analysis. Princeton Mathematical Series, No. 28. Princeton University Press, Princeton, N.J., 1970."},{"issue":"5","key":"9516_CR55","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"R.T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM J. Control Optimization, 14(5):877\u2013898, 1976.","journal-title":"SIAM J. Control Optimization"},{"key":"9516_CR56","unstructured":"R.T. Rockafellar. Favorable classes of Lipschitz-continuous functions in subgradient optimization. In Progress in nondifferentiable optimization, volume\u00a08 of IIASA Collaborative Proc. Ser. CP-82, pages 125\u2013143. Int. Inst. Appl. Sys. Anal., Laxenburg, 1982."},{"key":"9516_CR57","doi-asserted-by":"crossref","unstructured":"R.T. Rockafellar and R.J-B. Wets. Variational Analysis. Grundlehren der mathematischen Wissenschaften, Vol 317, Springer, Berlin, 1998.","DOI":"10.1007\/978-3-642-02431-3"},{"key":"9516_CR58","unstructured":"S.\u00a0Rolewicz. On paraconvex multifunctions. In Third Symposium on Operations Research (Univ. Mannheim, Mannheim, 1978), Section I, volume\u00a031 of Operations Res. Verfahren, pages 539\u2013546. Hain, K\u00f6nigstein\/Ts., 1979."},{"issue":"3","key":"9516_CR59","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01584378","volume":"33","author":"A Shapiro","year":"1985","unstructured":"A.\u00a0Shapiro. Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs. Mathematical Programming, 33(3):280\u2013299, 1985.","journal-title":"Mathematical Programming"},{"key":"9516_CR60","unstructured":"M.\u00a0Shub. Global stability of dynamical systems. Springer Science & Business Media, 2013."},{"key":"9516_CR61","unstructured":"J.\u00a0Sun, Q.\u00a0Qu, and J.\u00a0Wright. When are nonconvex problems not scary? arXiv preprint arXiv:1510.06096, 2015."},{"issue":"5","key":"9516_CR62","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s10208-017-9365-9","volume":"18","author":"J Sun","year":"2018","unstructured":"J.\u00a0Sun, Q.\u00a0Qu, and J.\u00a0Wright. A geometric analysis of phase retrieval. Foundations of Computational Mathematics, 18(5):1131\u20131198, 2018.","journal-title":"Foundations of Computational Mathematics"},{"key":"9516_CR63","unstructured":"Y.\u00a0Sun, N.\u00a0Flammarion, and M.\u00a0Fazel. Escaping from saddle points on riemannian manifolds. In Advances in Neural Information Processing Systems, volume\u00a032. Curran Associates, Inc., 2019."},{"key":"9516_CR64","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"SJ Wright","year":"1993","unstructured":"S.J. Wright. Identifiable surfaces in constrained optimization. SIAM J. Control Optim., 31:1063\u20131079, 1993.","journal-title":"SIAM J. Control Optim."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-021-09516-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-021-09516-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-021-09516-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T03:30:10Z","timestamp":1724988610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-021-09516-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,3]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9516"],"URL":"https:\/\/doi.org\/10.1007\/s10208-021-09516-w","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,3]]},"assertion":[{"value":"22 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}