{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:17Z","timestamp":1740123557063,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T00:00:00Z","timestamp":1691971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T00:00:00Z","timestamp":1691971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071332","11971118"],"award-info":[{"award-number":["12071332","11971118"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,10]]},"DOI":"10.1007\/s10915-023-02302-6","type":"journal-article","created":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T02:01:21Z","timestamp":1691978481000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proximal Gradient\/Semismooth Newton Methods for Projection onto a Polyhedron via the Duality-Gap-Active-Set Strategy"],"prefix":"10.1007","volume":"97","author":[{"given":"Yunlong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0391-5033","authenticated-orcid":false,"given":"Chungen","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei Hong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adler, I., Hu, Z.T. and Lin, T.: New proximal Newton-type methods for convex optimization. In 59th IEEE conference on decision and control, pp. 4828\u20134835. IEEE, (2020)","key":"2302_CR1","DOI":"10.1109\/CDC42340.2020.9304423"},{"doi-asserted-by":"crossref","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to nonsmooth optimization: theory, practice and software, vol.\u00a012. Springer, (2014)","key":"2302_CR2","DOI":"10.1007\/978-3-319-08114-4"},{"issue":"1","key":"2302_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. SIAM, (2017)","key":"2302_CR4","DOI":"10.1137\/1.9781611974997"},{"unstructured":"Becker, S., Fadili, J.: A quasi-Newton proximal splitting method. In: Advances in neural information processing systems 25, 2618\u20132626 (2012)","key":"2302_CR5"},{"issue":"4","key":"2302_CR6","doi-asserted-by":"crossref","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-Newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29(4), 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"key":"2302_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw. 60, 1\u201321 (2014)","journal-title":"J. Stat. Softw."},{"issue":"4","key":"2302_CR8","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","volume":"46","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Diaconis, P., Xiao, L.: Fastest mixing Markov chain on a graph. SIAM Rev. 46(4), 667\u2013689 (2004)","journal-title":"SIAM Rev."},{"issue":"1","key":"2302_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.laa.2005.10.006","volume":"416","author":"Y Censor","year":"2006","unstructured":"Censor, Y.: Computational acceleration of projection algorithms for the linear best approximation problem. Linear Algebra Appl. 416(1), 111\u2013123 (2006)","journal-title":"Linear Algebra Appl."},{"doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, (1990)","key":"2302_CR10","DOI":"10.1137\/1.9781611971309"},{"issue":"4\u20135","key":"2302_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H.: Alternate step gradient method. Optimization 52(4\u20135), 395\u2013415 (2003)","journal-title":"Optimization"},{"issue":"2","key":"2302_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"2302_CR13","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."},{"doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.-S.: Finite-dimensional Variational Inequalities and Complementarity Problems. Springer, (2003)","key":"2302_CR14","DOI":"10.1007\/b97544"},{"unstructured":"Fercoq, O., Gramfort, A., Salmon, J.: Mind the duality gap: safer rules for the lasso. In: International conference on machine learning, pp. 333\u2013342. PMLR, (2015)","key":"2302_CR15"},{"doi-asserted-by":"crossref","unstructured":"Fletcher, R.: On the Barzilai-Borwein method. In: Optimization and control with applications, pp. 235\u2013256. Springer, (2005)","key":"2302_CR16","DOI":"10.1007\/0-387-24255-4_10"},{"issue":"1","key":"2302_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10957-012-0155-x","volume":"158","author":"Z Gabidullina","year":"2013","unstructured":"Gabidullina, Z.: A linear separability criterion for sets of Euclidean space. J. Optim. Theory Appl. 158(1), 145\u2013171 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2302_CR18","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1137\/20M1348522","volume":"31","author":"B Gao","year":"2021","unstructured":"Gao, B., Son, N.T., Absil, P.-A., Stykel, T.: Riemannian optimization on the symplectic Stiefel manifold. SIAM J. Optim. 31(2), 1546\u20131575 (2021)","journal-title":"SIAM J. Optim."},{"unstructured":"Ghaoui, L.E., Viallon, V., Rabbani, T.: Safe feature elimination for the lasso and sparse supervised learning problems. arXiv preprint arXiv:1009.4219, (2010)","key":"2302_CR19"},{"issue":"1","key":"2302_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"2302_CR21","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"2302_CR22","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1007\/s11425-016-0300-6","volume":"59","author":"WW Hager","year":"2016","unstructured":"Hager, W.W., Zhang, H.: An active set algorithm for nonlinear optimization with polyhedral constraints. Sci. China Math. 59(8), 1525\u20131542 (2016)","journal-title":"Sci. China Math."},{"issue":"3","key":"2302_CR23","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."},{"unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer Science and Business Media, (2004)","key":"2302_CR24"},{"issue":"2","key":"2302_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s40305-020-00295-9","volume":"8","author":"J Hu","year":"2020","unstructured":"Hu, J., Liu, X., Wen, Z.W., Yuan, Y.X.: A brief introduction to manifold optimization. J. Oper. Res. Soc. China 8(2), 199\u2013248 (2020)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"2302_CR26","doi-asserted-by":"crossref","first-page":"3068","DOI":"10.1137\/21M1390785","volume":"31","author":"Y-K Huang","year":"2021","unstructured":"Huang, Y.-K., Dai, Y.-H., Liu, X.-W.: Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property. SIAM J. Optim. 31(4), 3068\u20133096 (2021)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2302_CR27","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10589-022-00349-z","volume":"81","author":"Y-K Huang","year":"2022","unstructured":"Huang, Y.-K., Dai, Y.-H., Liu, X.-W., Zhang, H.: On the acceleration of the Barzilai-Borwein method. Comput. Optim. Appl. 81(3), 717\u2013740 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"2302_CR28","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"C Laurent","year":"2016","unstructured":"Laurent, C.: Fast projection onto the simplex and the l1 ball. Math. Program. 158, 575\u2013585 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"2302_CR29","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2302_CR30","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2302_CR31","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control. Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"2302_CR32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10589-021-00264-9","volume":"79","author":"S Nakayama","year":"2021","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions. Comput. Optim. Appl. 79(1), 127\u2013154 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"2302_CR33","first-page":"811","volume":"28","author":"E Ndiaye","year":"2015","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparse multi-task and multi-class models. Adv. Neural Inf. Process. Syst. 28, 811\u2013819 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2302_CR34","first-page":"388","volume":"29","author":"E Ndiaye","year":"2016","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for Sparse-Group Lasso. Adv. Neural Inf. Process. Syst. 29, 388\u2013396 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"2302_CR35","first-page":"4671","volume":"18","author":"E Ndiaye","year":"2017","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparsity enforcing penalties. J. Mach. Learn. Res. 18(1), 4671\u20134703 (2017)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Nesterov, Y.E.: A method for solving a convex programming problem with convergence rate O($$1\/k^2$$). In Doklady A.N. (Eds.) Russian Academy of Sciences, vol. 269, pp. 543\u2013547. (1983)","key":"2302_CR36"},{"unstructured":"Ogawa, K., Suzuki, Y., Takeuchi, I.: Safe screening of non-support vectors in pathwise SVM computation. In: International conference on machine learning, pp. 1382\u20131390. PMLR, (2013)","key":"2302_CR37"},{"unstructured":"Olbrich, J.: Screening rules for convex problems. Master\u2019s thesis, ETH-Z\u00fcrich, (2015)","key":"2302_CR38"},{"issue":"2","key":"2302_CR39","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/S105262349427577X","volume":"8","author":"M Patriksson","year":"1998","unstructured":"Patriksson, M.: Cost approximation: a unified framework of descent algorithms for nonlinear programs. SIAM J. Optim. 8(2), 561\u2013582 (1998)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Panagiotis, P. and Alberto B.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE conference on decision and control, pp 2358\u20132363. IEEE, (2013)","key":"2302_CR40","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"1","key":"2302_CR41","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58(1), 353\u2013367 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"2302_CR42","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7(1), 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Rockafellar, T.: Convex analysis. Princeton University Press, (1970)","key":"2302_CR43","DOI":"10.1515\/9781400873173"},{"issue":"4","key":"2302_CR44","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1007\/s10898-021-01028-9","volume":"81","author":"C Shen","year":"2021","unstructured":"Shen, C., Liu, X.: Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations. J. Global Optim. 81(4), 1019\u20131055 (2021)","journal-title":"J. Global Optim."},{"issue":"1","key":"2302_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-020-00228-5","volume":"78","author":"C Shen","year":"2021","unstructured":"Shen, C., Wang, Y., Xue, W., Zhang, L.-H.: An accelerated active-set algorithm for a quadratic semidefinite program with general constraints. Comput. Optim. Appl. 78(1), 1\u201342 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2302_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-020-01364-0","volume":"85","author":"C Shen","year":"2020","unstructured":"Shen, C., Xue, W., Zhang, L.-H., Wang, B.: An active-set proximal-Newton algorithm for $$ \\ell _1 $$ regularized optimization problems with box constraints. J. Sci. Comput. 85(3), 1\u201334 (2020)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2302_CR47","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10559-010-9182-5","volume":"46","author":"PI Stetsyuk","year":"2010","unstructured":"Stetsyuk, P.I., Nurminski, E.A.: Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope. Cybern. Syst. Anal. 46(1), 51 (2010)","journal-title":"Cybern. Syst. Anal."},{"issue":"1","key":"2302_CR48","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"D Sun","year":"2002","unstructured":"Sun, D., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27(1), 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2302_CR49","doi-asserted-by":"crossref","first-page":"1968","DOI":"10.1137\/16M1098103","volume":"56","author":"G Torrisi","year":"2018","unstructured":"Torrisi, G., Grammatico, S., Smith, R.S., Morari, M.: A projected gradient and constraint linearization method for nonlinear model predictive control. SIAM J. Control Optim. 56(3), 1968\u20131999 (2018)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"2302_CR50","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1080\/02331934.2021.1958810","volume":"71","author":"B Wang","year":"2022","unstructured":"Wang, B., Lin, L., Liu, Y.-J.: Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian. Optimization 71(4), 1073\u20131096 (2022)","journal-title":"Optimization"},{"unstructured":"Wang, J. and Ye, J.: Safe screening for multi-task feature learning with multiple data matrices. In: International conference on machine learning, pp. 1747\u20131756. PMLR, (2015)","key":"2302_CR51"},{"key":"2302_CR52","first-page":"1053","volume":"2","author":"J Wang","year":"2014","unstructured":"Wang, J., Zhou, J., Liu, J., Wonka, P., Ye, J.: A safe screening rule for sparse logistic regression. Adv. Neural Inf. Process. Syst. 2, 1053\u20131061 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"4","key":"2302_CR53","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"2302_CR54","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"2302_CR55","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2302_CR56","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s10898-021-01084-1","volume":"82","author":"X Zhao","year":"2022","unstructured":"Zhao, X., Yao, J.-C.: Linear convergence of a nonmonotone projected gradient method for multiobjective optimization. J. Global Optim. 82(3), 577\u2013594 (2022)","journal-title":"J. Global Optim."},{"issue":"4","key":"2302_CR57","doi-asserted-by":"crossref","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":"1","key":"2302_CR58","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.-H.: Gradient methods with adaptive step-sizes. Comput. Optim. Appl. 35(1), 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02302-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02302-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02302-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T03:21:29Z","timestamp":1729912889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02302-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,14]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2302"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02302-6","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,8,14]]},"assertion":[{"value":"9 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2023","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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}