{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:55:00Z","timestamp":1783184100339,"version":"3.54.6"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"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":["62131005"],"award-info":[{"award-number":["62131005"]}],"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":["12171072"],"award-info":[{"award-number":["12171072"]}],"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,10]]},"DOI":"10.1007\/s10915-024-02653-8","type":"journal-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T19:02:09Z","timestamp":1724871729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Fast Algorithm for Rank-(L,\u00a0M,\u00a0N) Block Term Decomposition of Multi-Dimensional Data"],"prefix":"10.1007","volume":"101","author":[{"given":"Hao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ting-Zhu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6540-946X","authenticated-orcid":false,"given":"Xi-Le","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maolin","family":"Che","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"2653_CR1","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1007\/s10915-016-0282-x","volume":"70","author":"L Ma","year":"2017","unstructured":"Ma, L., Xu, L., Zeng, T.: Low rank prior and total variation regularization for image deblurring. J. Sci. Comput. 70, 1336\u20131357 (2017)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2653_CR2","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.-Z., Ji, T.-Y., Zhao, X.-L., Yang, J.-H.: Low-rank tensor completion using matrix factorization based on tensor train rank and total variation. J. Sci. Comput. 81(2), 941\u2013964 (2019)","journal-title":"J. Sci. Comput."},{"key":"2653_CR3","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33, 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"2653_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10915-021-01437-8","volume":"87","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Bai, M., Ng, M.K., Zhang, X.: Robust low transformed multi-rank tensor methods for image alignment. J. Sci. Comput. 87, 24 (2021)","journal-title":"J. Sci. Comput."},{"key":"2653_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s10915-022-02054-9","volume":"94","author":"C Zeng","year":"2022","unstructured":"Zeng, C.: Rank properties and computational methods for orthogonal tensor decompositions. J. Sci. Comput. 94, 6 (2022)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2653_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/LGRS.2008.915736","volume":"5","author":"N Renard","year":"2008","unstructured":"Renard, N., Bourennane, S., Blanc-Talon, J.: Denoising and dimensionality reduction using multilinear tools for hyperspectral images. IEEE Geosci. Remote Sens. Lett. 5(2), 138\u2013142 (2008)","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"issue":"7","key":"2653_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/JSTSP.2011.2132692","volume":"46","author":"A Karami","year":"2011","unstructured":"Karami, A., Yazdi, M., Asli, A.Z.: Noise reduction of hyperspectral images using kernel non-negative tucker decomposition. IEEE J. Sel. Topics Signal Process. 46(7), 487\u2013493 (2011)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"2653_CR8","doi-asserted-by":"publisher","first-page":"2682","DOI":"10.1109\/TSP.2020.2985591","volume":"68","author":"JHM Goulart","year":"2020","unstructured":"Goulart, J.H.M., de Oliveira, P.M.R., Farias, R.C., Zarzoso, V., Comon, P.: Alternating group lasso for block-term tensor decomposition and application to ECG source separation. IEEE Trans Signal Process. 68, 2682\u20132696 (2020)","journal-title":"IEEE Trans Signal Process."},{"key":"2653_CR9","doi-asserted-by":"publisher","first-page":"3660","DOI":"10.1109\/TSP.2020.2993530","volume":"68","author":"G Zhang","year":"2020","unstructured":"Zhang, G., Fu, X., Wang, J., Zhao, X.-L., Hong, M.: Spectrum cartography via coupled block-term tensor decomposition. IEEE Trans. Signal Process. 68, 3660\u20133675 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"2653_CR10","doi-asserted-by":"publisher","first-page":"3351","DOI":"10.1109\/TPAMI.2023.3341688","volume":"46","author":"Y-S Luo","year":"2024","unstructured":"Luo, Y.-S., Zhao, X.-L., Li, Z., Ng, M.K., Meng, D.: Low-rank tensor function representation for multi-dimensional data recovery. IEEE Trans. Pattern Anal. Mach. Intell. 46(5), 3351\u20133369 (2024)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2653_CR11","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, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"3","key":"2653_CR12","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1137\/070690729","volume":"30","author":"LD Lathauwer","year":"2008","unstructured":"Lathauwer, L.D.: Decompositions of a higher-order tensor in block terms$$-$$Part II: definitions and uniqueness. SIAM J. Matrix Anal. Appl. 30(3), 1033\u20131066 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2653_CR13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2015851118","volume":"118","author":"ME Kilmer","year":"2021","unstructured":"Kilmer, M.E., Horesh, L., Avron, H., Newman, E.: Tensor-tensor algebra for optimal representation and compression of multiway data. Proc. Natl. Acad. Sci. U.S.A. 118, e2015851118 (2021)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"10","key":"2653_CR14","doi-asserted-by":"publisher","first-page":"3717","DOI":"10.1109\/TGRS.2012.2187063","volume":"50","author":"X Liu","year":"2012","unstructured":"Liu, X., Bourennane, S., Fossati, C.: Denoising of hyperspectral images using the parafac model and statistical performance analysis. IEEE Trans. Geosci. Remote Sens. 50(10), 3717\u20133724 (2012)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"2653_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10915-014-9893-2","volume":"63","author":"Y Quan","year":"2015","unstructured":"Quan, Y., Ji, H., Shen, Z.: Data-driven multi-scale non-local wavelet frame construction and image recovery. J. Sci. Comput. 63, 307\u2013329 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2653_CR16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu, J., Przemyslaw, M., Peter, W., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 208\u2013220 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2653_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2200000059","volume":"9","author":"A Cichocki","year":"2016","unstructured":"Cichocki, A., Lee, N., Oseledets, I., Phan, A.Z.Q.: Mandic DP Tensor networks for dimensionality reduction and large-scale optimization: part 1 low-rank tensor decompositions. Found. Trends Mach. Learn. 9, 249\u2013429 (2016)","journal-title":"Found. Trends Mach. Learn."},{"key":"2653_CR18","first-page":"431","volume":"9","author":"A Cichocki","year":"2019","unstructured":"Cichocki, A., Phan, A.H., Zhao, Q., Lee, N., Oseledets, I., Sugiyama, M., Sugiyama, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: part 2 applications and future perspectives. Found. Trends Mach. Learn. 9, 431\u2013673 (2019)","journal-title":"Found. Trends Mach. Learn."},{"issue":"5","key":"2653_CR19","doi-asserted-by":"publisher","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":"2653_CR20","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.: Factorization strategies for third-order tensors. Linear Algeb. Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algeb. Appl."},{"key":"2653_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s10915-021-01480-5","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, 68 (2021)","journal-title":"J. Sci. Comput."},{"key":"2653_CR22","doi-asserted-by":"publisher","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 Algebr. Appl. 485, 545\u2013570 (2015)","journal-title":"Linear Algebr. Appl."},{"key":"2653_CR23","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: Proc. IEEE Conf. Comput. Vis. Pattern Recognit. pp. 5989\u20135997 (2019)","DOI":"10.1109\/CVPR.2019.00615"},{"key":"2653_CR24","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":"2653_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299","volume":"27","author":"G-J Song","year":"2020","unstructured":"Song, G.-J., Ng, M.K., Zhang, X.-J.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebr. Appl. 27, e2299 (2020)","journal-title":"Numer. Linear Algebr. Appl."},{"key":"2653_CR26","doi-asserted-by":"crossref","unstructured":"Kong, H., Lu, C., Lin, Z.: Tensor Q-rank: New data dependent tensor rank. Mach. Learn. pp. 1\u201334, (2021)","DOI":"10.1007\/s10994-021-05987-8"},{"key":"2653_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3356228","author":"J Lin","year":"2024","unstructured":"Lin, J., Huang, T.Z., Zhao, X.L., Ji, T.Y., Zhao, Q.: Tensor robust kernel pca for multidimensional data. IEEE Trans. Neural Netw. Learn. Syst. (2024). https:\/\/doi.org\/10.1109\/TNNLS.2024.3356228","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"8","key":"2653_CR28","first-page":"6868","volume":"35","author":"Y Cai","year":"2021","unstructured":"Cai, Y., Li, P.: A blind block term decomposition of high order tensors. Proc. AAAI Conf. Artif. Intell. 35(8), 6868\u20136876 (2021)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"3","key":"2653_CR29","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/070690730","volume":"30","author":"LD Lathauwer","year":"2008","unstructured":"Lathauwer, L.D., Nion, D.: Decompositions of a higher-order tensor in block terms-part iii: alternating least squares algorithms. SIAM J. Matrix Anal. Appl. 30(3), 1067\u20131083 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2653_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.113380","volume":"390","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. J. Comput. Appl. Math. 390, 113380 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"2653_CR31","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TSP.2020.2982321","volume":"68","author":"X Fu","year":"2020","unstructured":"Fu, X., Ibrahim, S., Wai, H.-T., Gao, C., Huang, K.: Block-randomized stochastic proximal gradient for low-rank tensor factorization. IEEE Trans. Signal Process. 68, 2170\u20132185 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"2653_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2385","volume":"28","author":"X-F Duan","year":"2021","unstructured":"Duan, X.-F., Duan, S.-Q., Li, J., Li, J., Wang, Q.-W.: Block-randomized stochastic proximal gradient for low-rank tensor factorization. Numer. Linear Algebr. Appl. 28, e2385 (2021)","journal-title":"Numer. Linear Algebr. Appl."},{"key":"2653_CR33","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s10915-021-01545-5","volume":"88","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: An efficient randomized algorithm for computing the approximate tucker decomposition. J. Sci. Comput. 88, 32 (2021)","journal-title":"J. Sci. Comput."},{"key":"2653_CR34","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10915-023-02172-y","volume":"95","author":"W Dong","year":"2023","unstructured":"Dong, W., Yu, G., Qi, L., Cai, X.: Practical sketching algorithms for low-rank tucker approximation of large tensors. J. Sci. Comput. 95, 52 (2023)","journal-title":"J. Sci. Comput."},{"key":"2653_CR35","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/17M1112303","volume":"39","author":"C Battaglino","year":"2018","unstructured":"Battaglino, C., Ballard, G., Kolda, T.G.: A practical randomized CP tensor decomposition. SIAM J. Matrix Anal. Appl. 39, 876\u2013901 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2653_CR36","unstructured":"Aggour, K.S., Gittens, A., Yener, B.: Adaptive sketching for fast and convergent canonical polyadic decomposition. In: Proc. Int. Conf. Mach. Learn. p. 119 (2020)"},{"key":"2653_CR37","first-page":"117","volume":"10","author":"S Becker","year":"2018","unstructured":"Becker, S., Malik, O.A.: Low-rank tucker decomposition of large tensors using TensorSketch. Proc. Int. Conf. Neural Inf. Process. Syst. 10, 117\u2013127 (2018)","journal-title":"Proc. Int. Conf. Neural Inf. Process. Syst."},{"key":"2653_CR38","first-page":"7400","volume":"139","author":"OA Malik","year":"2021","unstructured":"Malik, O.A., Becker, S.: A sampling-based method for tensor ring decomposition. Proc. Int. Conf. Mach. Learn. 139, 7400\u20137411 (2021)","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"2653_CR39","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"C Battaglino","year":"2007","unstructured":"Battaglino, C., Ballard, G., Kolda, T.G.: A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebr. Appl. 420, 553\u2013571 (2007)","journal-title":"Linear Algebr. Appl."},{"issue":"1","key":"2653_CR40","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10444-018-9622-8","volume":"45","author":"M Che","year":"2019","unstructured":"Che, M., Wei, Y.: Randomized algorithms for the approximations of tucker and the tensor train decompositions. Adv. Comput. Math. 45(1), 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"key":"2653_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2179","volume":"25","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Saibaba, A.K., Kilmer, M.E., Aeron, S.: A randomized tensor singular value decomposition based on the t-product. Numer. Linear Algebr. Appl. 25, e2179 (2018)","journal-title":"Numer. Linear Algebr. Appl."},{"issue":"4","key":"2653_CR42","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"LD Lathauwer","year":"2000","unstructured":"Lathauwer, L.D., Moor, B.D., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2653_CR43","doi-asserted-by":"publisher","first-page":"A1027","DOI":"10.1137\/110836067","volume":"32","author":"N Vannieuwenhoven","year":"2012","unstructured":"Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition. SIAM J. Sci. Comput. 32(2), A1027\u2013A1052 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"2653_CR44","doi-asserted-by":"crossref","unstructured":"Fazel, M., Candes, E., Recht, B., Parrilo, P.: Compressed sensing and robust recovery of low rank matrices. IN: Proc. Asilomar Conf. Signals Syst. Comput. pp. 1043\u20131047 (2009)","DOI":"10.1109\/ACSSC.2008.5074571"},{"issue":"2","key":"2653_CR45","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"2653_CR46","doi-asserted-by":"crossref","unstructured":"Zhou, T., Tao, D.: Bilateral random projections. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 1286\u20131290 (2012)","DOI":"10.1109\/ISIT.2012.6283064"},{"key":"2653_CR47","doi-asserted-by":"crossref","unstructured":"Hackbusch, W.: Tensor spaces and numerical tensor calculus. Springer Sci. Bus. Media, vol.\u00a042, (2012)","DOI":"10.1007\/978-3-642-28027-6"},{"key":"2653_CR48","doi-asserted-by":"crossref","unstructured":"Hor\u00e9, A., Ziou, D.: Image quality metrics: PSNR vs. SSIM. In: Proc. Int. Conf. Pattern Recognit. (ICPR), pp. 23\u201326 (2010)","DOI":"10.1109\/ICPR.2010.579"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02653-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02653-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02653-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T10:13:47Z","timestamp":1726827227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02653-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2653"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02653-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,28]]},"assertion":[{"value":"18 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 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 no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"16"}}