{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:18:06Z","timestamp":1758273486929,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"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":["61877046"],"award-info":[{"award-number":["61877046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["YJSJ23003"],"award-info":[{"award-number":["YJSJ23003"]}],"id":[{"id":"10.13039\/501100012476","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,9]]},"DOI":"10.1007\/s10915-023-02308-0","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T08:01:56Z","timestamp":1691481716000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generalized Non-convex Method for Robust Tensor Completion"],"prefix":"10.1007","volume":"96","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3209-7797","authenticated-orcid":false,"given":"Zhechen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhiping","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,8]]},"reference":[{"key":"2308_CR1","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1109\/TIP.2022.3155949","volume":"31","author":"W Qin","year":"2022","unstructured":"Qin, W., Wang, H., Zhang, F., Wang, J., Luo, X., Huang, T.: Low-rank high-order tensor completion with applications in visual data. IEEE Trans. Image Process. 31, 2433\u20132448 (2022)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"2308_CR2","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1007\/s10915-019-01009-x","volume":"80","author":"C Shi","year":"2019","unstructured":"Shi, C., Huang, Z., Wan, L., Xiong, T.: Low-rank tensor completion based on log-det rank approximation and matrix factorization. J. Sci. Comput. 80(3), 1888\u20131912 (2019)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2308_CR3","first-page":"1","volume":"93","author":"S Duan","year":"2022","unstructured":"Duan, S., Duan, X., Zhao, X.: A new tensor multi-rank approximation with total variation regularization for tensor completion. J. Sci. Comput. 93(3), 1\u201331 (2022)","journal-title":"J. Sci. Comput."},{"key":"2308_CR4","doi-asserted-by":"crossref","unstructured":"Jiang, B., Ma, S., Zhang, S.: Low-m-rank tensor completion and robust tensor pca. In: IEEE Journal of Selected Topics in Signal Processing (2018)","DOI":"10.1109\/JSTSP.2018.2873144"},{"key":"2308_CR5","volume":"122","author":"M Yang","year":"2022","unstructured":"Yang, M., Luo, Q., Li, W., Xiao, M.: Nonconvex 3d array image data recovery and pattern recognition under tensor framework. Pattern Recogn. 122, 108311 (2022)","journal-title":"Pattern Recogn."},{"key":"2308_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.neucom.2021.09.052","volume":"468","author":"Y Zhao","year":"2022","unstructured":"Zhao, Y., Yun, Y., Zhang, X., Li, Q., Gao, Q.: Multi-view spectral clustering with adaptive graph learning and tensor Schatten p-norm. Neurocomputing 468, 257\u2013264 (2022)","journal-title":"Neurocomputing"},{"key":"2308_CR7","doi-asserted-by":"crossref","unstructured":"Xia, W., Gao, Q., Wang, Q., Gao, X.: Tensor completion-based incomplete multiview clustering. IEEE Trans. Cybern. (2022)","DOI":"10.1109\/TCYB.2021.3140068"},{"issue":"10","key":"2308_CR8","doi-asserted-by":"crossref","first-page":"4589","DOI":"10.1109\/JSTARS.2017.2714338","volume":"10","author":"H Fan","year":"2017","unstructured":"Fan, H., Chen, Y., Guo, Y., Zhang, H., Kuang, G.: Hyperspectral image restoration using low-rank tensor recovery. IEEE J. Sel. Top. Appl. Earth Observ. Remote Sens. 10(10), 4589\u20134604 (2017)","journal-title":"IEEE J. Sel. Top. Appl. Earth Observ. Remote Sens."},{"key":"2308_CR9","doi-asserted-by":"crossref","unstructured":"Bentbib, A.H., Khouia, A., Sadok, H.: Color image and video restoration using tensor cp decomposition. BIT Numer. Math. 1\u201322 (2022)","DOI":"10.1007\/s10543-022-00910-6"},{"key":"2308_CR10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.ins.2017.09.058","volume":"423","author":"B Madathil","year":"2018","unstructured":"Madathil, B., George, S.N.: Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery. Inf. Sci. 423, 376\u2013397 (2018)","journal-title":"Inf. Sci."},{"issue":"5","key":"2308_CR11","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J.A., Phien, H.N., Tuan, H.D., Do, M.N.: Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans. Image Process. 26(5), 2466\u20132479 (2017)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"2308_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis. J. ACM (JACM) 58(3), 1\u201337 (2011)","journal-title":"J. ACM (JACM)"},{"key":"2308_CR13","unstructured":"Cherapanamjeri, Y., Gupta, K., Jain, P.: Nearly optimal robust matrix completion. In: International Conference on Machine Learning. PMLR, pp. 797\u2013805 (2017)"},{"issue":"1","key":"2308_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00440-016-0736-y","volume":"169","author":"O Klopp","year":"2017","unstructured":"Klopp, O., Lounici, K., Tsybakov, A.B.: Robust matrix completion. Probab. Theory Relat. Fields 169(1), 523\u2013564 (2017)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"5","key":"2308_CR15","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/TSP.2017.2784361","volume":"66","author":"W Zeng","year":"2017","unstructured":"Zeng, W., So, H.C.: Outlier-robust matrix completion via $$\\ell _p$$-minimization. IEEE Trans. Signal Process. 66(5), 1125\u20131140 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2308_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TSP.2019.2952057","volume":"68","author":"Y He","year":"2019","unstructured":"He, Y., Wang, F., Li, Y., Qin, J., Chen, B.: Robust matrix completion via maximum correntropy criterion and half-quadratic optimization. IEEE Trans. Signal Process. 68, 181\u2013195 (2019)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2308_CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/130905010","volume":"35","author":"D Goldfarb","year":"2014","unstructured":"Goldfarb, D., Qin, Z.: Robust low-rank tensor recovery: models and algorithms. SIAM J. Matrix Anal. Appl. 35(1), 225\u2013253 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"20","key":"2308_CR18","doi-asserted-by":"crossref","first-page":"5423","DOI":"10.1109\/TSP.2016.2586759","volume":"64","author":"T Yokota","year":"2016","unstructured":"Yokota, T., Zhao, Q., Cichocki, A.: Smooth parafac decomposition for tensor completion. IEEE Trans. Signal Process. 64(20), 5423\u20135436 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2308_CR19","first-page":"105","volume":"14","author":"HA Kiers","year":"2000","unstructured":"Kiers, H.A.: Towards a standardized notation and terminology in multiway analysis. J. Chemom. A J. Chemom. Soc. 14(3), 105\u2013122 (2000)","journal-title":"J. Chemom. A J. Chemom. Soc."},{"issue":"3","key":"2308_CR20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"2308_CR21","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.ins.2019.01.031","volume":"482","author":"K Shang","year":"2019","unstructured":"Shang, K., Li, Y., Huang, Z.: Iterative p-shrinkage thresholding algorithm for low tucker rank tensor recovery. Inf. Sci. 482, 374\u2013391 (2019)","journal-title":"Inf. Sci."},{"issue":"3","key":"2308_CR22","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2308_CR23","doi-asserted-by":"crossref","first-page":"A474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin, C.D., Shafer, R., LaRue, B.: An order-p tensor factorization with applications in imaging. SIAM J. Sci. Comput. 35(1), A474\u2013A490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2308_CR24","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K., Hao, Z., Hoover, R., Kim, S., Kolda, T.G., Ovall, J.S., Stanton, K.: Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 34(1), 148\u2013172 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2308_CR25","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","volume":"485","author":"E Kernfeld","year":"2015","unstructured":"Kernfeld, E., Kilmer, M., Aeron, S.: Tensor-tensor products with invertible linear transforms. Linear Algebra Appl. 485, 545\u2013570 (2015)","journal-title":"Linear Algebra Appl."},{"key":"2308_CR26","doi-asserted-by":"crossref","unstructured":"Lu, C., Peng, X., Wei, Y.: Low-rank tensor completion with a new tensor nuclear norm induced by invertible linear transforms. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 5996\u20136004 (2019)","DOI":"10.1109\/CVPR.2019.00615"},{"issue":"3","key":"2308_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/nla.2299","volume":"27","author":"G Song","year":"2020","unstructured":"Song, G., Ng, M.K., Zhang, X.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 27(3), e2299 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2308_CR28","doi-asserted-by":"crossref","first-page":"7233","DOI":"10.1109\/TIP.2020.3000349","volume":"29","author":"T Jiang","year":"2020","unstructured":"Jiang, T., Ng, M.K., Zhao, X., Huang, T.: Framelet representation of tensor nuclear norm for third-order tensor completion. IEEE Trans. Image Process. 29, 7233\u20137244 (2020)","journal-title":"IEEE Trans. Image Process."},{"key":"2308_CR29","doi-asserted-by":"crossref","unstructured":"Jiang, Q., Ng, M.: Robust low-tubal-rank tensor completion via convex optimization. In: IJCAI, pp. 2649\u20132655 (2019)","DOI":"10.24963\/ijcai.2019\/368"},{"issue":"2","key":"2308_CR30","first-page":"1","volume":"85","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Bai, M., Ng, M.K.: Nonconvex optimization for robust tensor completion from grossly sparse observations. J. Sci. Comput. 85(2), 1\u201332 (2020)","journal-title":"J. Sci. Comput."},{"key":"2308_CR31","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.neucom.2020.12.110","volume":"435","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Bai, M., Ng, M.K., Zhang, X.: Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization. Neurocomputing 435, 197\u2013215 (2021)","journal-title":"Neurocomputing"},{"key":"2308_CR32","doi-asserted-by":"crossref","first-page":"9044","DOI":"10.1109\/TIP.2020.3023798","volume":"29","author":"L Chen","year":"2020","unstructured":"Chen, L., Jiang, X., Liu, X., Zhou, Z.: Robust low-rank tensor recovery via nonconvex singular value minimization. IEEE Trans. Image Process. 29, 9044\u20139059 (2020)","journal-title":"IEEE Trans. Image Process."},{"key":"2308_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-019-01102-1","volume":"82","author":"S Gao","year":"2020","unstructured":"Gao, S., Fan, Q.: Robust Schatten norm based approach for tensor completion. J. Sci. Comput. 82, 1\u201323 (2020)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2308_CR34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10915-021-01679-6","volume":"89","author":"M Li","year":"2021","unstructured":"Li, M., Li, W., Chen, Y., Xiao, M.: The nonconvex tensor robust principal component analysis approximation model via the weighted $$\\ell _p$$-norm regularization. J. Sci. Comput. 89(3), 67 (2021)","journal-title":"J. Sci. Comput."},{"key":"2308_CR35","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1109\/TSP.2021.3086363","volume":"69","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Han, L., Liu, Y., Zhu, J., Yan, H.: A novel regularized model for third-order tensor completion. IEEE Trans. Signal Process. 69, 3473\u20133483 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"2308_CR36","doi-asserted-by":"crossref","unstructured":"Kilmer, M.E., Braman, K., Hao, N., Hoover, R.C.: Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. Siam J. Matrix Anal. Appl. 34(1) (2013)","DOI":"10.1137\/110837711"},{"issue":"3","key":"2308_CR37","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S., et al.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"7","key":"2308_CR38","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/83.392335","volume":"4","author":"D Geman","year":"1995","unstructured":"Geman, D., Yang, C.: Nonlinear image recovery with half-quadratic regularization. IEEE Trans. Image Process. 4(7), 932\u2013946 (1995)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2308_CR39","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TMI.2008.927346","volume":"28","author":"J Trzasko","year":"2008","unstructured":"Trzasko, J., Manduca, A.: Highly undersampled magnetic resonance image reconstruction via homotopic $$\\ell _0$$-minimization. IEEE Trans. Med. Imaging 28(1), 106\u2013121 (2008)","journal-title":"IEEE Trans. Med. Imaging"},{"key":"2308_CR40","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: Proceedings of the 2003 American Control Conference, 2003, vol.\u00a03, pp. 2156\u20132162. IEEE (2003)"},{"issue":"2","key":"2308_CR41","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"456","key":"2308_CR42","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2308_CR43","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1007\/s10915-016-0169-x","volume":"68","author":"Y Lou","year":"2016","unstructured":"Lou, Y., Yin, P., Xin, J.: Point source super-resolution via non-convex $$\\ell _1$$-based methods. J. Sci. Comput. 68(3), 1082\u20131100 (2016)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2308_CR44","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.H.: Convex analysis approach to dc programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"1","key":"2308_CR45","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"2308_CR46","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"6","key":"2308_CR47","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1109\/TPAMI.2020.3017672","volume":"43","author":"Q Gao","year":"2020","unstructured":"Gao, Q., Zhang, P., Xia, W., Xie, D., Gao, X., Tao, D.: Enhanced tensor rpca and its application. IEEE Trans. Pattern Anal. Mach. Intell. 43(6), 2133\u20132140 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"2308_CR48","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE Trans. Image Process. 13(4), 600\u2013612 (2004)","journal-title":"IEEE Trans. Image Process."},{"key":"2308_CR49","doi-asserted-by":"crossref","unstructured":"Shivakumar, B., Rajashekararadhya, S.: Performance evaluation of spectral angle mapper and spectral correlation mapper classifiers over multiple remote sensor data. In: 2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT), pp. 1\u20136. IEEE (2017)","DOI":"10.1109\/ICECCT.2017.8117946"},{"key":"2308_CR50","doi-asserted-by":"crossref","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings of the 8th International Conference on Computer Vision, vol.\u00a02, pp. 416\u2013423 (2001)","DOI":"10.1109\/ICCV.2001.937655"},{"issue":"9","key":"2308_CR51","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1109\/TIP.2010.2046811","volume":"19","author":"F Yasuma","year":"2010","unstructured":"Yasuma, F., Mitsunaga, T., Iso, D., Nayar, S.K.: Generalized assorted pixel camera: postcapture control of resolution, dynamic range, and spectrum. IEEE Trans. Image Process. 19(9), 2241\u20132253 (2010)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02308-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02308-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02308-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T21:17:00Z","timestamp":1729891020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02308-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2308"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02308-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"23 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"91"}}