{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:02:13Z","timestamp":1773385333211,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T00:00:00Z","timestamp":1710892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T00:00:00Z","timestamp":1710892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2020YFA0711900"],"award-info":[{"award-number":["2020YFA0711900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2020YFA0711904"],"award-info":[{"award-number":["2020YFA0711904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12125108"],"award-info":[{"award-number":["12125108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971466"],"award-info":[{"award-number":["11971466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12021001"],"award-info":[{"award-number":["12021001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Frontier Sciences, Chinese Academy of Sciences","award":["ZDBS-LY-7022"],"award-info":[{"award-number":["ZDBS-LY-7022"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12288201"],"award-info":[{"award-number":["12288201"]}],"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":[[2024,5]]},"DOI":"10.1007\/s10915-024-02495-4","type":"journal-article","created":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T08:02:03Z","timestamp":1710921723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Penalty-Free Infeasible Approach for a Class of Nonsmooth Optimization Problems Over the Stiefel Manifold"],"prefix":"10.1007","volume":"99","author":[{"given":"Xin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2725-2633","authenticated-orcid":false,"given":"Nachuan","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"issue":"9","key":"2495_CR1","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1016\/j.sigpro.2009.03.015","volume":"89","author":"T Abrudan","year":"2009","unstructured":"Abrudan, T., Eriksson, J., Koivunen, V.: Conjugate gradient algorithm for optimization under unitary matrix constraint. Signal Process. 89(9), 1704\u20131714 (2009)","journal-title":"Signal Process."},{"issue":"3","key":"2495_CR2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","volume":"56","author":"TE Abrudan","year":"2008","unstructured":"Abrudan, T.E., Eriksson, J., Koivunen, V.: Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans. Signal Process. 56(3), 1134\u20131147 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2495_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"2495_CR4","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"2495_CR5","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."},{"issue":"3","key":"2495_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2307\/2342801","volume":"122","author":"EML Beale","year":"1959","unstructured":"Beale, E.M.L., Arrow, K.J., Hurwicz, L., Uzawa, H., Chenery, H.B., Johnson, S.M., Karlin, S., Marschak, T., Solow, R.M.: Studies in linear and non-linear programming. J. R. Stat. Soc. Ser. A (Gen.) 122(3), 381 (1959)","journal-title":"J. R. Stat. Soc. Ser. A (Gen.)"},{"issue":"1","key":"2495_CR7","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.A., Sepulchre, R.: Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15(1), 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"2495_CR8","first-page":"3074","volume":"41","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Ma, Z., Wu, Y., et al.: Sparse PCA: optimal rates and adaptive estimation. Ann. Stat. 41(6), 3074\u20133110 (2013)","journal-title":"Ann. Stat."},{"issue":"1","key":"2495_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"2495_CR10","doi-asserted-by":"crossref","unstructured":"Chen, S., Deng, Z., Ma, S., So, A.M.C.: Manifold proximal point algorithms for dual principal component pursuit and orthogonal dictionary learning. In: Asilomar Conference on Signals, Systems, and Computers (2019)","DOI":"10.1109\/IEEECONF44664.2019.9048840"},{"issue":"1","key":"2495_CR11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., Man-Cho So, A., Zhang, T.: Proximal gradient method for nonsmooth optimization over the Stiefel manifold. SIAM J. Optim. 30(1), 210\u2013239 (2020)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2495_CR12","doi-asserted-by":"crossref","first-page":"B570","DOI":"10.1137\/140988875","volume":"38","author":"W Chen","year":"2016","unstructured":"Chen, W., Ji, H., You, Y.: An augmented Lagrangian method for 1-regularized optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 38(4), B570\u2013B592 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"2495_CR13","first-page":"3696","volume":"38","author":"X Chen","year":"2010","unstructured":"Chen, X., Zou, C., Cook, R.D., et al.: Coordinate-independent sparse sufficient dimension reduction and variable selection. Ann. Stat. 38(6), 3696\u20133723 (2010)","journal-title":"Ann. Stat."},{"key":"2495_CR14","first-page":"1","volume":"76","author":"Z Chen","year":"2019","unstructured":"Chen, Z., Dai, Y.H., Liu, J.: A penalty-free method with superlinear convergence for equality constrained optimization. Comput. Optim. Appl. 76, 1\u201333 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2495_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis, vol. 5. SIAM, Philadelphia (1990)"},{"key":"2495_CR16","unstructured":"Dai, X., Zhang, L., Zhou, A.: Adaptive step size strategy for orthogonality constrained line search methods. arXiv:1906.02883 (2019)"},{"issue":"2","key":"2495_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2495_CR18","unstructured":"Gao, B., Hu, G., Kuang, Y., Liu, X.: An orthogonalization-free parallelizable framework for all-electron calculations in density functional theory. arXiv:2007.14228 (2020)"},{"issue":"1","key":"2495_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/16M1098759","volume":"28","author":"B Gao","year":"2018","unstructured":"Gao, B., Liu, X., Chen, X., Yuan, Y.X.: A new first-order algorithmic framework for optimization problems with orthogonality constraints. SIAM J. Optim. 28(1), 302\u2013332 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2495_CR20","doi-asserted-by":"crossref","first-page":"A1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), A1949\u2013A1983 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"2495_CR21","first-page":"2074","volume":"45","author":"C Gao","year":"2017","unstructured":"Gao, C., Ma, Z., Zhou, H.H., et al.: Sparse CCA: adaptive estimation and computational barriers. Ann. Stat. 45(5), 2074\u20132101 (2017)","journal-title":"Ann. Stat."},{"issue":"1","key":"2495_CR22","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-008-0244-7","volume":"122","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Toint, P.L.: Nonlinear programming without a penalty function or a filter. Math. Program. 122(1), 155\u2013196 (2010)","journal-title":"Math. Program."},{"issue":"4","key":"2495_CR23","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"B He","year":"2014","unstructured":"He, B., You, Y., Yuan, X.: On the convergence of primal-dual hybrid gradient algorithm. SIAM J. Imaging Sci. 7(4), 2526\u20132537 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"2495_CR24","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1016\/0167-8191(94)90073-6","volume":"20","author":"NJ Higham","year":"1994","unstructured":"Higham, N.J., Papadimitriou, P.: A parallel algorithm for computing the polar decomposition. Parallel Comput. 20, 1161\u20131173 (1994)","journal-title":"Parallel Comput."},{"key":"2495_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., Yuan, Y.X.: A brief introduction to manifold optimization. J. Oper. Res. Soc. China 8, 199\u2013248 (2020)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"2495_CR26","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2018","unstructured":"Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive quadratically regularized newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2495_CR27","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.3390\/s20113041","volume":"20","author":"X Hu","year":"2020","unstructured":"Hu, X., Liu, X.: An efficient orthonormalization-free approach for sparse dictionary learning and dual principal component pursuit. Sensors 20, 3041 (2020)","journal-title":"Sensors"},{"key":"2495_CR28","unstructured":"Huang, W., Wei, K.: Extending Fista to Riemannian optimization for sparse PCA. arXiv:1909.05485 (2019)"},{"key":"2495_CR29","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. arXiv:1909.06065 (2019)"},{"issue":"2","key":"2495_CR30","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang, B., Dai, Y.H.: A framework of constraint preserving update schemes for optimization on Stiefel manifold. Math. Program. 153(2), 535\u2013575 (2015)","journal-title":"Math. Program."},{"issue":"4A","key":"2495_CR31","doi-asserted-by":"crossref","first-page":"A1133","DOI":"10.1103\/PhysRev.140.A1133","volume":"140","author":"W Kohn","year":"1965","unstructured":"Kohn, W., Sham, L.J.: Self-consistent equations including exchange and correlation effects. Phys. Rev. 140(4A), A1133 (1965)","journal-title":"Phys. Rev."},{"issue":"2","key":"2495_CR32","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2495_CR33","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/080739884","volume":"21","author":"X Liu","year":"2011","unstructured":"Liu, X., Yuan, Y.: A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization. SIAM J. Optim. 21(2), 545\u2013571 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2495_CR34","first-page":"772","volume":"41","author":"Z Ma","year":"2013","unstructured":"Ma, Z., et al.: Sparse principal component analysis and iterative thresholding. Ann. Stat. 41(2), 772\u2013801 (2013)","journal-title":"Ann. Stat."},{"issue":"3","key":"2495_CR35","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton, J.H.: Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50(3), 635\u2013650 (2002)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2495_CR36","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1017567113614","volume":"111","author":"JM Martinez","year":"2001","unstructured":"Martinez, J.M.: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111(1), 39\u201358 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"2495_CR37","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.neucom.2004.11.035","volume":"67","author":"Y Nishimori","year":"2005","unstructured":"Nishimori, Y., Akaho, S.: Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold. Neurocomputing 67, 106\u2013135 (2005)","journal-title":"Neurocomputing"},{"issue":"1\u20133","key":"2495_CR38","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\u20133), 353\u2013367 (1993)","journal-title":"Math. program."},{"key":"2495_CR39","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"1","key":"2495_CR40","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4310\/MAA.2014.v21.n1.a5","volume":"21","author":"G Rosman","year":"2014","unstructured":"Rosman, G., Tai, X., Kimmel, R., Bruckstein, A.M.: Augmented-Lagrangian regularization of matrix-valued maps. Methods Appl. Anal. 21(1), 105\u2013122 (2014)","journal-title":"Methods Appl. Anal."},{"issue":"3","key":"2495_CR41","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10589-011-9430-2","volume":"52","author":"C Shen","year":"2012","unstructured":"Shen, C., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. 52(3), 583\u2013607 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"2495_CR42","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, 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2495_CR43","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10107-002-0343-9","volume":"95","author":"M Ulbrich","year":"2003","unstructured":"Ulbrich, M., Ulbrich, S.: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95(1), 103\u2013135 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"2495_CR44","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10107-003-0491-6","volume":"100","author":"S Ulbrich","year":"2004","unstructured":"Ulbrich, S.: On the superlinear local convergence of a filter-SQP method. Math. Program. 100(1), 217\u2013245 (2004)","journal-title":"Math. Program."},{"issue":"12","key":"2495_CR45","doi-asserted-by":"crossref","first-page":"5823","DOI":"10.1109\/TSP.2008.2006587","volume":"56","author":"MO Ulfarsson","year":"2008","unstructured":"Ulfarsson, M.O., Solo, V.: Sparse variable PCA using geodesic steepest descent. IEEE Trans. Signal Process. 56(12), 5823\u20135832 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1\u20132","key":"2495_CR46","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142(1\u20132), 397\u2013434 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"2495_CR47","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."},{"key":"2495_CR48","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF00229304","volume":"8","author":"G Wood","year":"1996","unstructured":"Wood, G., Zhang, B.: Estimation of the Lipschitz constant of a function. J. Glob. Optim. 8, 91\u2013103 (1996)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2495_CR49","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1080\/10556788.2020.1852236","volume":"37","author":"N Xiao","year":"2020","unstructured":"Xiao, N., Liu, X., Yuan, Y.X.: A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. Optim. Methods Softw. 37(4), 1205\u20131241 (2020)","journal-title":"Optim. Methods Softw."},{"key":"2495_CR50","unstructured":"Xiao, N., Liu, X., Yuan, Y.X.: Exact penalty function for $$\\ell _{2,1}$$ norm minimization with orthogonality constraints. Optimization Online preprint:2020\/07\/7908 (2020)"},{"issue":"2","key":"2495_CR51","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1499096.1499099","volume":"36","author":"C Yang","year":"2009","unstructured":"Yang, C., Meza, J.C., Lee, B., Wang, L.W.: KSSOLV\u2014a MATLAB toolbox for solving the Kohn\u2013Sham equations. ACM Trans. Math. Softw. (TOMS) 36(2), 10 (2009)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"2495_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-022-01898-1","volume":"201","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Bao, C., Ding, C., Zhu, J.: A semismooth newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds. Math. Program. 201, 1\u201361 (2022)","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02495-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02495-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02495-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T19:03:53Z","timestamp":1714503833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02495-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,20]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["2495"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02495-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,20]]},"assertion":[{"value":"13 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}