{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T06:40:45Z","timestamp":1775198445192,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"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":["NSFC-12471356, NSFC-12371380"],"award-info":[{"award-number":["NSFC-12471356, NSFC-12371380"]}],"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":["NSFC-12371303"],"award-info":[{"award-number":["NSFC-12371303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Shuangchuang Project","award":["JSSCTD202209"],"award-info":[{"award-number":["JSSCTD202209"]}]},{"name":"Academic Degree and Postgraduate Education Reform Project of Jiangsu Province"},{"name":"China Association of Higher Education under grant","award":["23SX0403"],"award-info":[{"award-number":["23SX0403"]}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX25_3435"],"award-info":[{"award-number":["KYCX25_3435"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LZ24A010001"],"award-info":[{"award-number":["LZ24A010001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10915-026-03205-y","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T06:02:17Z","timestamp":1770616937000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing Tucker Tensor Completion via Laplace-Like Nonconvex Surrogates and Structural Regularization"],"prefix":"10.1007","volume":"106","author":[{"given":"Wenhui","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5349-8621","authenticated-orcid":false,"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"key":"3205_CR1","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"3205_CR2","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"3205_CR3","first-page":"1","volume":"62","author":"Y Chen","year":"2024","unstructured":"Chen, Y., Zeng, J., He, W., Zhao, X.-L., Jiang, T.-X., Huang, Q.: Fast large-scale hyperspectral image denoising via noniterative low-rank subspace representation. IEEE Trans. Geosci. Remote Sens. 62, 1\u201314 (2024)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"3","key":"3205_CR4","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/060661569","volume":"30","author":"P Comon","year":"2008","unstructured":"Comon, P., Golub, G., Lim, L.-H., Mourrain, B.: Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 30(3), 1254\u20131279 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"3205_CR5","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3205_CR6","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/s10915-019-01044-8","volume":"81","author":"M Ding","year":"2019","unstructured":"Ding, M., Huang, T., Ji, T., et al.: Low-rank tensor completion using matrix factorization based on tensor train rank and total variation. J. Sci. Comput. 81, 941\u2013964 (2019)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"3205_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/S089547980139786X","volume":"26","author":"L De Lathauwer","year":"2004","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: Computation of the canonical decomposition by means of a simultaneous generalized schur decomposition. SIAM J. Matrix Anal. Appl. 26(2), 295\u2013327 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3205_CR8","unstructured":"Ga\u00efffas, S., Lecu\u00e9, G.: Weighted algorithms for compressed sensing and matrix completion. arXiv:1107.1638 (2011)"},{"issue":"1","key":"3205_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/22M1473236","volume":"16","author":"K Gao","year":"2023","unstructured":"Gao, K., Huang, Z.-H.: Tensor robust principal component analysis via tensor fibered rank and $$\\ell _p$$ minimization. SIAM J. Imaging Sci. 16(1), 423\u2013460 (2023)","journal-title":"SIAM J. Imaging Sci."},{"key":"3205_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.neucom.2019.10.086","volume":"379","author":"S Gao","year":"2020","unstructured":"Gao, S., Zhuang, X.: Robust approximations of low-rank minimization for tensor completion. Neurocomputing 379, 319\u2013333 (2020)","journal-title":"Neurocomputing"},{"issue":"1","key":"3205_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"3205_CR12","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore, Maryland (2013)","edition":"4"},{"key":"3205_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., Zhang, L.: Weighted nuclear norm minimization and its applications to low level vision. Int. J. Comput. Vis. 121, 183\u2013208 (2017)","journal-title":"Int. J. Comput. Vis."},{"key":"3205_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10915-022-02006-3","volume":"93","author":"H He","year":"2022","unstructured":"He, H., Ling, C., Xie, W.: Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD. J. Sci. Comput. 93, 35 (2022). (Article No. 47)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"3205_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TGRS.2015.2452812","volume":"54","author":"W He","year":"2016","unstructured":"He, W., Zhang, H., Zhang, L., Shen, H.: Total-variation-regularized low-rank matrix factorization for hyperspectral image restoration. IEEE Trans. Geosci. Remote Sens. 54(1), 178\u2013188 (2016)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"6","key":"3205_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.: Most tensor problems are NP-hard. J. ACM 60(6), 39 (2013). (Article No. 45)","journal-title":"J. ACM"},{"key":"3205_CR17","first-page":"164","volume":"6","author":"F Hitchcock","year":"1927","unstructured":"Hitchcock, F.: The expression of a tensor or a polyadic as a sum of products. Stud. Appl. Math. 6, 164\u2013189 (1927)","journal-title":"Stud. Appl. Math."},{"key":"3205_CR18","doi-asserted-by":"crossref","unstructured":"Hui, B., Yan, D., Chen, H., Ku, W.-S.: Time-sensitive POI recommendation by tensor completion with side information. In: Proceedings of the 2022 IEEE 38th International Conference on Data Engineering, pp. 205\u2013217 (2022)","DOI":"10.1109\/ICDE53745.2022.00020"},{"issue":"1","key":"3205_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1198\/0003130042836","volume":"58","author":"DR Hunter","year":"2004","unstructured":"Hunter, D.R., Lange, K.: A tutorial on MM algorithms. Am. Stat. 58(1), 30\u201337 (2004)","journal-title":"Am. Stat."},{"key":"3205_CR20","doi-asserted-by":"publisher","first-page":"7233","DOI":"10.1109\/TIP.2020.3000349","volume":"29","author":"T-X Jiang","year":"2020","unstructured":"Jiang, T.-X., Ng, M.K., Zhao, X.-L., Huang, T.-Z.: 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":"3205_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2019.112680","volume":"372","author":"T-X Jiang","year":"2020","unstructured":"Jiang, T.-X., Huang, T.-Z., Zhao, X.-L., Deng, L.-J.: Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm. J. Comput. Appl. Math. 372, 112680 (2020)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"3205_CR22","doi-asserted-by":"publisher","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.M.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"key":"3205_CR23","doi-asserted-by":"publisher","first-page":"6918","DOI":"10.1109\/TIP.2020.2995061","volume":"29","author":"C Ko","year":"2020","unstructured":"Ko, C., Batselier, K., Daniel, L., Yu, W., Wong, N.: Fast and accurate tensor completion with total variation regularized tensor trains. IEEE Trans. Image Process. 29, 6918\u20136931 (2020)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"3205_CR24","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"2","key":"3205_CR25","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/TPAMI.2021.3107160","volume":"44","author":"P Koniusz","year":"2022","unstructured":"Koniusz, P., Wang, L., Cherian, A.: Tensor representations for action recognition. IEEE Trans. Pattern Anal. Mach. Intell. 44(2), 648\u2013665 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3205_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409","volume-title":"MM Optimization Algorithms","author":"K Lange","year":"2016","unstructured":"Lange, K.: MM Optimization Algorithms. SIAM, Philadelphia, PA (2016)"},{"issue":"1","key":"3205_CR27","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/0806009","volume":"6","author":"AS Lewis","year":"1996","unstructured":"Lewis, A.S.: Convex analysis on the Hermitian matrices. SIAM J. Optim. 6(1), 164\u2013177 (1996)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3205_CR28","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/S089547980036838X","volume":"23","author":"AS Lewis","year":"2001","unstructured":"Lewis, A.S., Sendov, H.S.: Twice differentiable spectral functions. SIAM J. Matrix Anal. Appl. 23(2), 368\u2013386 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3205_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109632","volume":"141","author":"C Liang","year":"2023","unstructured":"Liang, C., Wang, L., Liu, L., Zhang, H., Guo, F.: Multi-view unsupervised feature selection with tensor robust principal component analysis and consensus graph learning. Pattern Recognit. 141, 109632 (2023)","journal-title":"Pattern Recognit."},{"key":"3205_CR30","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s10589-021-00315-1","volume":"80","author":"C Ling","year":"2021","unstructured":"Ling, C., Yu, G., Qi, L., Xu, Y.: T-product factorization method for internet traffic data completion with spatio-temporal regularization. Comput. Optim. Appl. 80, 883\u2013913 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"3205_CR31","doi-asserted-by":"crossref","unstructured":"Mu, C., Huang, B., Wright, J., Goldfarb, D.: Square deal: Lower bounds and improved relaxations for tensor recovery. In: Proceedings of the 31st International Conference on Machine Learning, vol. 32, pp. 73\u201381 (2014)","DOI":"10.1109\/ICCV.2015.17"},{"key":"3205_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, 2nd edn. Springer, Cham, Switzerland (2018)","edition":"2"},{"issue":"5","key":"3205_CR33","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"I Oseledets","year":"2011","unstructured":"Oseledets, I.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"3205_CR34","volume":"465","author":"C Pan","year":"2024","unstructured":"Pan, C., Ling, C., He, H., Qi, L., Xu, Y.: A low-rank and sparse enhanced Tucker decomposition approach for tensor completion. Appl. Math. Comput. 465, 128432 (2024)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"3205_CR35","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/20M1323266","volume":"42","author":"L Qi","year":"2021","unstructured":"Qi, L., Chen, Y., Bakshi, M., Zhang, X.: Triple decomposition and tensor recovery of third order tensors. SIAM J. Matrix Anal. Appl. 42(1), 299\u2013329 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3205_CR36","doi-asserted-by":"publisher","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":"3205_CR37","unstructured":"Romera-Paredes, B. and Pontil, M.: A new convex relaxation for tensor completion. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, vol. 2, pp. 2967\u20132975 (2013)"},{"key":"3205_CR38","doi-asserted-by":"publisher","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."},{"key":"3205_CR39","unstructured":"Stewart, G.W. and Sun, J.-g.: Matrix Perturbation Theory. Computer Science and Scientific Computing, Academic Press, Boston (1990)"},{"key":"3205_CR40","doi-asserted-by":"publisher","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, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"8","key":"3205_CR41","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1109\/TPAMI.2017.2734888","volume":"40","author":"Q Xie","year":"2018","unstructured":"Xie, Q., Zhao, Q., Meng, D., Xu, Z.: Kronecker-basis-representation based tensor sparsity and its applications to tensor recovery. IEEE Trans. Pattern Anal. Mach. Intell. 40(8), 1888\u20131902 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"3205_CR42","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2580","volume":"31","author":"W Xie","year":"2024","unstructured":"Xie, W., Ling, C., He, H., Zhang, L.: Robust tensor recovery via a nonconvex approach with ket augmentation and autoweighted strategy. Numer. Linear Algebra Appl. 31(6), e2538 (2024)","journal-title":"Numer. Linear Algebra Appl."},{"key":"3205_CR43","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.image.2018.11.007","volume":"73","author":"W Xu","year":"2019","unstructured":"Xu, W., Zhao, X., Ji, T., Miao, J., Ma, T., Wang, S., Huang, T.: Laplace function based nonconvex surrogate for low-rank tensor completion. Signal Process. Image Commun. 73, 62\u201369 (2019)","journal-title":"Signal Process. Image Commun."},{"key":"3205_CR44","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TCI.2019.2940916","volume":"6","author":"B Yaman","year":"2020","unstructured":"Yaman, B., Weing\u00e4rtner, S., Kargas, N., Sidiropoulos, N.D., Ak\u00e7akaya, M.: Low-rank tensor models for improved multidimensional MRI: Application to dynamic cardiac $$T_1$$ mapping. IEEE Trans. Comput. Imaging 6, 194\u2013207 (2020)","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"3205_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108311","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 Recognit. 122, 108311 (2022)","journal-title":"Pattern Recognit."},{"key":"3205_CR46","doi-asserted-by":"publisher","first-page":"4291","DOI":"10.1109\/TSP.2022.3201330","volume":"70","author":"M Yang","year":"2022","unstructured":"Yang, M., Luo, Q., Li, W., Xiao, M.: 3-D array image data completion by tensor decomposition and nonconvex regularization approach. IEEE Trans. Signal Process. 70, 4291\u20134304 (2022)","journal-title":"IEEE Trans. Signal Process."},{"issue":"14","key":"3205_CR47","doi-asserted-by":"publisher","first-page":"3702","DOI":"10.1109\/TSP.2017.2695566","volume":"65","author":"J Ying","year":"2017","unstructured":"Ying, J., Lu, H., Wei, Q., et al.: Hankel matrix nuclear norm regularized tensor completion for $$n$$-dimensional exponential signals. IEEE Trans. Signal Process. 65(14), 3702\u20133717 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"3205_CR48","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1007\/s42967-024-00381-2","volume":"7","author":"H-F Zeng","year":"2025","unstructured":"Zeng, H.-F., Peng, X.-F., Li, W.: Tensor robust principal component analysis via non-convex low-rank approximation based on the Laplace function. Commun. Appl. Math. Comput. 7(3), 1684\u20131703 (2025)","journal-title":"Commun. Appl. Math. Comput."},{"key":"3205_CR49","first-page":"50","volume":"4","author":"H Zhu","year":"2024","unstructured":"Zhu, H., Liu, X., Huang, L., Lu, Z., Lu, J., Ng, M.K.: Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery. Adv. Comput. Math. 4, 50 (2024). (Article No. 75)","journal-title":"Adv. Comput. Math."},{"key":"3205_CR50","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10915-021-01443-w","volume":"87","author":"W Guo","year":"2021","unstructured":"Guo, W., Lou, Y., Qin, J., Yan, M.: A Novel Regularization Based on the Error Function for Sparse Recovery. J. Sci. Comput. 87, 31 (2021)","journal-title":"J. Sci. Comput."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03205-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03205-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03205-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:03:17Z","timestamp":1772611397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03205-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["3205"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03205-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"23 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"78"}}