{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:43:26Z","timestamp":1780677806158,"version":"3.54.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N0001421WX00142"],"award-info":[{"award-number":["N0001421WX00142"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["18RT0599"],"award-info":[{"award-number":["18RT0599"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["21RT0484"],"award-info":[{"award-number":["21RT0484"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01909-1","type":"journal-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:03:00Z","timestamp":1672239780000},"page":"339-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Consistent approximations in composite optimization"],"prefix":"10.1007","volume":"201","author":[{"given":"Johannes O.","family":"Royset","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"1909_CR1","doi-asserted-by":"crossref","unstructured":"Attouch, H., Wets, R.J-B: Quantitative stability of variational systems: I. The epigraphical distance. Trans. Am. Math. Soc. 328(2), 695\u2013729 (1991)","DOI":"10.1090\/S0002-9947-1991-1018570-0"},{"key":"1909_CR2","doi-asserted-by":"crossref","unstructured":"Attouch, H., Wets, R.J-B: Quantitative stability of variational systems: II. A framework for nonlinear conditioning. SIAM J. Optimization 3, 359\u2013381 (1993)","DOI":"10.1137\/0803016"},{"key":"1909_CR3","doi-asserted-by":"crossref","unstructured":"Attouch, H., Wets, R.J-B: Quantitative stability of variational systems: III. $$\\epsilon $$-approximate solutions. Math. Program. 61, 197\u2013214 (1993)","DOI":"10.1007\/BF01582147"},{"key":"1909_CR4","unstructured":"Basu, S., Pope, P., Feizi, S.: Influence functions in deep learning are fragile. arXiv:2006.14651 (2020)"},{"issue":"2","key":"1909_CR5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim. 22(2), 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1909_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"key":"1909_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, Berlin (2000)"},{"issue":"3","key":"1909_CR8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"JV Burke","year":"1985","unstructured":"Burke, J.V.: Descent methods for composite nondifferentiable optimization problems. Math. Program. 33(3), 260\u2013279 (1985)","journal-title":"Math. Program."},{"key":"1909_CR9","first-page":"179","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A Gauss\u2013Newton method for convex composite optimization. Math. Program. 71, 179\u2013194 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"1909_CR10","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1137\/120889812","volume":"23","author":"JV Burke","year":"2013","unstructured":"Burke, J.V., Hoheisel, T.: Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23(3), 1457\u20131479 (2013)","journal-title":"SIAM J. Optim."},{"key":"1909_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11228-016-0362-y","volume":"25","author":"JV Burke","year":"2017","unstructured":"Burke, J.V., Hoheisel, T.: Epi-convergence properties of smoothing by infimal convolution. Set Valued Var. Anal. 25, 1\u201323 (2017)","journal-title":"Set Valued Var. Anal."},{"issue":"2","key":"1909_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11228-013-0235-6","volume":"21","author":"JV Burke","year":"2013","unstructured":"Burke, J.V., Hoheisel, T., Kanzow, C.: Gradient consistency for integral-convolution smoothing functions. Set Valued Var. Anal. 21(2), 359\u2013376 (2013)","journal-title":"Set Valued Var. Anal."},{"issue":"4","key":"1909_CR13","doi-asserted-by":"crossref","first-page":"1324","DOI":"10.1287\/moor.2020.1099","volume":"46","author":"JV Burke","year":"2021","unstructured":"Burke, J.V., Hoheisel, T., Nguyen, Q.V.: A study of convex convex-composite functions via infimal convolution with applications. Math. Oper. Res. 46(4), 1324\u20131348 (2021)","journal-title":"Math. Oper. Res."},{"key":"1909_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134, 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"1909_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01592244","volume":"71","author":"X Chen","year":"1995","unstructured":"Chen, X., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementarity problems. Math. Program. 71, 51\u201370 (1995)","journal-title":"Math. Program."},{"key":"1909_CR16","doi-asserted-by":"crossref","unstructured":"Cui, Y., Pang, J.-S.: Modern Nonconvex Nondifferentiable Optimization. SIAM (2021)","DOI":"10.1137\/1.9781611976748"},{"issue":"4","key":"1909_CR17","doi-asserted-by":"crossref","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cui","year":"2018","unstructured":"Cui, Y., Pang, J.-S., Sen, B.: Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4), 3344\u20133374 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1909_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1909_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2021.1126","volume":"47","author":"D Davis","year":"2022","unstructured":"Davis, D., Drusvyatskiy, D.: Graphical convergence of subgradients in nonconvex optimization and learning. Math. Oper. Res. 47(1), 209\u2013231 (2022)","journal-title":"Math. Oper. Res."},{"key":"1909_CR20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/120876551","volume":"23","author":"D Drusvyatskiy","year":"2013","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential. SIAM J. Optim. 23, 256\u2013267 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1909_CR21","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"key":"1909_CR22","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"1909_CR23","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1137\/17M1135086","volume":"28","author":"JC Duchi","year":"2018","unstructured":"Duchi, J.C., Ruan, F.: Stochastic methods for composite and weakly convex optimization problems. SIAM J. Optim. 28(4), 3229\u20133259 (2018)","journal-title":"SIAM J. Optim."},{"key":"1909_CR24","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1016\/j.na.2011.08.014","volume":"75","author":"AC Eberhard","year":"2012","unstructured":"Eberhard, A.C., Wenczel, R.: A study of tilt-stable optimality and sufficient conditions. Nonlinear Anal. 75, 1260\u20131281 (2012)","journal-title":"Nonlinear Anal."},{"key":"1909_CR25","doi-asserted-by":"crossref","unstructured":"Ermoliev, Y.M., Norkin, V.I., Wets, R.J-B: The minimization of discontinuous functions: mollifier subgradients. SIAM J. Control Optim. 33(1), 149\u2013167 (1995)","DOI":"10.1137\/S0363012992238369"},{"key":"1909_CR26","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: Nondifferential and variational techniques in optimization. In: Sorensen, D.C., Wets, R.J-B (eds.) Nondifferential and Variational Techniques in Optimization. Mathematical Programming Study, vol. 17, pp. 67\u201376. Academic Press, Cambridge (1982)","DOI":"10.1007\/BFb0120959"},{"issue":"2","key":"1909_CR27","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s10957-015-0768-y","volume":"169","author":"JC Foraker","year":"2016","unstructured":"Foraker, J.C., Royset, J.O., Kaminer, I.: Search-trajectory optimization: part 1, formulation and theory. J. Optim. Theory Appl. 169(2), 530\u2013549 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1909_CR28","unstructured":"Hand, P., Voroninski, V.: Global guarantees for enforcing deep generative priors by empirical risk. In: 31st Annual Conference on Learning Theory (2018)"},{"issue":"2","key":"1909_CR29","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02192118","volume":"84","author":"JL Higle","year":"1995","unstructured":"Higle, J.L., Sen, S.: Epigraphical nesting: a unifying theory for the convergence of algorithms. J. Optim. Theory Appl. 84(2), 339\u2013360 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1909_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00041-021-09830-5","volume":"27","author":"W Huang","year":"2021","unstructured":"Huang, W., Hand, P., Heckel, R., Voroninski, V.: A provably convergent scheme for compressive sensing under random generative priors. J. Fourier Anal. Appl. 27(2), 1\u201334 (2021)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2\u20133","key":"1909_CR31","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s11228-008-0076-x","volume":"16","author":"AD Ioffe","year":"2008","unstructured":"Ioffe, A.D., Outrata, J.V.: On metric and calmness qualification conditions in subdifferential calculus. Set Valued Var. Anal. 16(2\u20133), 199\u2013227 (2008)","journal-title":"Set Valued Var. Anal."},{"issue":"4","key":"1909_CR32","first-page":"1043","volume":"19","author":"D Klatte","year":"2012","unstructured":"Klatte, D., Kruger, A., Kummer, B.: From convergence principles to stability and optimality conditions. J. Convex Anal. 19(4), 1043\u20131072 (2012)","journal-title":"J. Convex Anal."},{"key":"1909_CR33","unstructured":"Koh, P.W., Liang, P.: Understanding black-box predictions via influence functions. arXiv:1703.04730 (2017)"},{"issue":"2","key":"1909_CR34","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/moor.2019.1013","volume":"45","author":"DP Kouri","year":"2020","unstructured":"Kouri, D.P., Surowiec, T.M.: Epi-regularization of risk measures. Math. Oper. Res. 45(2), 774\u2013795 (2020)","journal-title":"Math. Oper. Res."},{"key":"1909_CR35","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158, 501\u2013546 (2016)","journal-title":"Math. Program."},{"key":"1909_CR36","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/110852103","volume":"23","author":"AS Lewis","year":"2013","unstructured":"Lewis, A.S., Zhang, S.: Partial smoothness, tilt stability, and generalized Hessians. SIAM J. Optim. 23, 74\u201394 (2013)","journal-title":"SIAM J. Optim."},{"key":"1909_CR37","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory. Grundlehren der mathematischen Wissenschaften","author":"BS Mordukhovich","year":"2013","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer, Berlin (2013)","edition":"2"},{"key":"1909_CR38","doi-asserted-by":"crossref","first-page":"1810","DOI":"10.1137\/120887722","volume":"23","author":"BS Mordukhovich","year":"2013","unstructured":"Mordukhovich, B.S., Rockafellar, R.T., Sarabi, M.E.: Characterizations of full stability in constrained optimization. SIAM J. Optim. 23, 1810\u20131849 (2013)","journal-title":"SIAM J. Optim."},{"key":"1909_CR39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"1909_CR40","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1090\/conm\/514\/10110","volume":"514","author":"JP Penot","year":"2010","unstructured":"Penot, J.P.: Error bounds, calmness and their applications in nonsmooth analysis. Contemp. Math. 514, 225\u2013247 (2010)","journal-title":"Contemp. Math."},{"issue":"1","key":"1909_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/140983161","volume":"54","author":"C Phelps","year":"2016","unstructured":"Phelps, C., Royset, J.O., Gong, Q.: Optimal control of uncertain systems using sample average approximations. SIAM J. Control Optim. 54(1), 1\u201329 (2016)","journal-title":"SIAM J. Control Optim."},{"key":"1909_CR42","series-title":"Applied Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization. Algorithms and Consistent Approximations","author":"E Polak","year":"1997","unstructured":"Polak, E.: Optimization. Algorithms and Consistent Approximations. Applied Mathematical Sciences, vol. 124. Springer, Berlin (1997)"},{"issue":"3","key":"1909_CR43","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1023\/B:JOTA.0000006685.60019.3e","volume":"119","author":"E Polak","year":"2003","unstructured":"Polak, E., Royset, J.O., Womersley, R.S.: Algorithms with adaptive smoothing for finite minimax problems. J. Optim. Theory Appl. 119(3), 459\u2013484 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1909_CR44","first-page":"861","volume":"332","author":"RA Poliquin","year":"1992","unstructured":"Poliquin, R.A.: An extension of Attouch\u2019s theorem and its application to second-order epi-differentiation of convexly composite functions. Trans. Am. Math. Soc. 332(2), 861\u2013874 (1992)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"1909_CR45","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01588967","volume":"14","author":"MJD Powell","year":"1978","unstructured":"Powell, M.J.D.: Algorithms for nonlinear constraints that use Lagrangian functions. Math. Program. 14(2), 224\u2013248 (1978)","journal-title":"Math. Program."},{"key":"1909_CR46","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical Analysis","author":"MJD Powell","year":"1978","unstructured":"Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (ed.) Numerical Analysis. Lecture Notes in Mathematics, vol. 630, pp. 144\u2013157. Springer, Berlin (1978)"},{"key":"1909_CR47","first-page":"187","volume-title":"Approximation Theory, IV","author":"MJD Powell","year":"1983","unstructured":"Powell, M.J.D.: General algorithms for discrete nonlinear approximation calculations. In: Approximation Theory, IV, pp. 187\u2013218. Academic Press, Cambridge (1983)"},{"issue":"3","key":"1909_CR48","first-page":"299","volume":"29","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29(3), 299\u2013303 (1984)","journal-title":"Math. Program."},{"key":"1909_CR49","first-page":"381","volume-title":"Nonlinear Optimization and Related Topics","author":"RT Rockafellar","year":"1999","unstructured":"Rockafellar, R.T.: Extended nonlinear programming. In: Di Pillo, G., Giannessi, R. (eds.) Nonlinear Optimization and Related Topics, pp. 381\u2013399. Kluwer, Dordrecht (1999)"},{"key":"1909_CR50","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J-B: Variational Analysis, 3rd printing-2009 edn. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"issue":"1","key":"1909_CR51","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-011-0453-3","volume":"135","author":"JO Royset","year":"2012","unstructured":"Royset, J.O.: Optimality functions in stochastic programming. Math. Program. 135(1), 293\u2013321 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"1909_CR52","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-017-1165-0","volume":"170","author":"JO Royset","year":"2018","unstructured":"Royset, J.O.: Approximations and solution estimates in optimization. Math. Program. 170(2), 479\u2013506 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"1909_CR53","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1137\/19M1251424","volume":"30","author":"JO Royset","year":"2020","unstructured":"Royset, J.O.: Stability and error analysis for optimization and generalized equations. SIAM J. Optim. 30(1), 752\u2013780 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1909_CR54","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s10957-012-0109-3","volume":"155","author":"JO Royset","year":"2012","unstructured":"Royset, J.O., Pee, E.Y.: Rate of convergence analysis of discretization and smoothing algorithms for semi-infinite minimax problems. J. Optim. Theory Appl. 155(3), 855\u2013882 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"1909_CR55","doi-asserted-by":"crossref","unstructured":"Royset, J.O., Wets, R.J-B: Optimality functions and lopsided convergence. J. Optim. Theory Appl. 169(3), 965\u2013983 (2016)","DOI":"10.1007\/s10957-015-0839-0"},{"key":"1909_CR56","doi-asserted-by":"crossref","unstructured":"Royset, J.O., Wets, R.J.-B: An Optimization Primer. Springer, Berlin (2021)","DOI":"10.1007\/978-3-030-76275-9"},{"issue":"3","key":"1909_CR57","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02591949","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Program. 31(3), 269\u2013285 (1985)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01909-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01909-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01909-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T19:11:39Z","timestamp":1690312299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01909-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":57,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1909"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01909-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"assertion":[{"value":"10 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}