{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:18:08Z","timestamp":1770524288801,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002805","name":"Carl Tryggers Stiftelse f\u00f6r Vetenskaplig Forskning","doi-asserted-by":"publisher","award":["CTS 22:2196"],"award-info":[{"award-number":["CTS 22:2196"]}],"id":[{"id":"10.13039\/501100002805","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2021-05393"],"award-info":[{"award-number":["2021-05393"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003509","name":"\u00d6rebro University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003509","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motion capture (MoCap) technology is an essential tool for recording and analyzing movements of objects or humans. However, MoCap systems frequently encounter the challenge of missing data, stemming from mismatched markers, occlusion, or equipment limitations. Recovery of these missing data is imperative to maintain the reliability and integrity of MoCap recordings. This paper introduces a novel application of the tensor framework for MoCap data completion. We propose three completion algorithms based on the canonical polyadic (CP) decomposition of tensors. The first algorithm utilizes CP decomposition to capture the low-rank structure of the tensor. However, relying only on low-rank assumptions may be insufficient to deal with complex motion data. Thus, we propose two modified CP decompositions that incorporate additional information, SmoothCP and SparseCP decompositions. SmoothCP integrates piecewise smoothness prior, while SparseCP incorporates sparsity prior, each aiming to improve the accuracy and robustness of MoCap data recovery. To compare and evaluate the merit of the proposed algorithms over other tensor completion methods in terms of several evaluation metrics, we conduct numerical experiments with different MoCap sequences from the CMU motion capture dataset.<\/jats:p>","DOI":"10.1007\/s10044-024-01342-4","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T18:01:26Z","timestamp":1728064886000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["CP decomposition-based algorithms for completion problem of motion capture data"],"prefix":"10.1007","volume":"27","author":[{"given":"Souad","family":"Mohaoui","sequence":"first","affiliation":[]},{"given":"Andrii","family":"Dmytryshyn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,4]]},"reference":[{"issue":"1","key":"1342_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.bspc.2007.09.001","volume":"3","author":"H Zhou","year":"2008","unstructured":"Zhou H, Huosheng H (2008) Human motion tracking for rehabilitation: a survey. Biomed Signal Process Control 3(1):1\u201318","journal-title":"Biomed Signal Process Control"},{"issue":"8","key":"1342_CR2","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1080\/10255842.2020.1856372","volume":"24","author":"I Takeda","year":"2021","unstructured":"Takeda I, Yamada A, Onodera H (2021) Artificial intelligence-assisted motion capture for medical applications: a comparative study between markerless and passive marker motion capture. Comput Methods Biomech Biomed Eng 24(8):864\u2013873","journal-title":"Comput Methods Biomech Biomed Eng"},{"issue":"6","key":"1342_CR3","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1080\/17461391.2018.1463397","volume":"18","author":"E Van der Kruk","year":"2018","unstructured":"Van der Kruk E, Reijne MM (2018) Accuracy of human motion capture systems for sport applications; state-of-the-art review. Eur J Sport Sci 18(6):806\u2013819","journal-title":"Eur J Sport Sci"},{"issue":"1","key":"1342_CR4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1177\/17479541221123960","volume":"18","author":"G Millour","year":"2023","unstructured":"Millour G, Vel\u00e1squez AT, Domingue F (2023) A literature overview of modern biomechanical-based technologies for bike-fitting professionals and coaches. Int J Sports Sci Coach 18(1):292\u2013303","journal-title":"Int J Sports Sci Coach"},{"issue":"2","key":"1342_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1108\/01439911111106372","volume":"38","author":"M Field","year":"2011","unstructured":"Field M et al (2011) Human motion capture sensors and analysis in robotics. Ind Robot Int J 38(2):163\u2013171","journal-title":"Ind Robot Int J"},{"key":"1342_CR6","unstructured":"Schreiter T et al (2022) The magni human motion dataset: accurate, complex, multi-modal, natural, semantically-rich and contextualized. In: arXiv preprint arXiv:2208.14925"},{"key":"1342_CR7","doi-asserted-by":"crossref","unstructured":"Schreiter T et al (2024) TH\u00d6R-MAGNI: a large-scale indoor motion capture recording of human movement and robot interaction. arXiv preprint arXiv:2403.09285","DOI":"10.1177\/02783649241274794"},{"key":"1342_CR8","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109225","volume":"179","author":"G Boschetti","year":"2023","unstructured":"Boschetti G et al (2023) 3D collision avoidance strategy and performance evaluation for human\u2013robot collaborative systems. Comput Ind Eng 179:109225","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1342_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes E, Recht B (2012) Exact matrix completion via convex optimization. Commun ACM 55(6):111\u2013119","journal-title":"Commun ACM"},{"issue":"4","key":"1342_CR10","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"key":"1342_CR11","unstructured":"Lai Ranch YQ, Yuen Pong C, Lee Kelvin KW (2011) Motion capture data completion and denoising by singular value thresholding. In: Eurographics (short papers), pp 45\u201348"},{"issue":"12","key":"1342_CR12","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1049\/el.2013.0442","volume":"49","author":"C-H Tan","year":"2013","unstructured":"Tan C-H, Hou J, Chau L-P (2013) Human motion capture data recovery using trajectory-based matrix completion. Electron Lett 49(12):752\u2013754","journal-title":"Electron Lett"},{"key":"1342_CR13","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1007\/s00371-014-1031-5","volume":"31","author":"C-H Tan","year":"2015","unstructured":"Tan C-H, Hou JH, Chau L-P (2015) Motion capture data recovery using skeleton constrained singular value thresholding. Vis Comput 31:1521\u20131532","journal-title":"Vis Comput"},{"key":"1342_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ins.2018.02.052","volume":"450","author":"B Chen","year":"2018","unstructured":"Chen B et al (2018) Human motion recovery utilizing truncated schatten p-norm and kinematic constraints. Inf Sci 450:89\u2013108","journal-title":"Inf Sci"},{"key":"1342_CR15","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/j.ins.2014.03.013","volume":"277","author":"Y Feng","year":"2014","unstructured":"Feng Y et al (2014) Exploiting temporal stability and low-rank structure for motion capture data refinement. Inf Sci 277:777\u2013793","journal-title":"Inf Sci"},{"issue":"2","key":"1342_CR16","first-page":"258","volume":"25","author":"H Wenyu","year":"2017","unstructured":"Wenyu H et al (2017) Motion capture data completion via truncated nuclear norm regularization. IEEE Signal Process Lett 25(2):258\u2013262","journal-title":"IEEE Signal Process Lett"},{"issue":"6","key":"1342_CR17","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1109\/TCSVT.2019.2907324","volume":"30","author":"J Yang","year":"2019","unstructured":"Yang J et al (2019) Spatio-temporal reconstruction for 3D motion recovery. IEEE Trans Circuits Syst Video Technol 30(6):1583\u20131596","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"1342_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2019.04.031","volume":"493","author":"Q Cui","year":"2019","unstructured":"Cui Q, Chen B, Sun H (2019) Nonlocal low-rank regularization for human motion recovery based on similarity analysis. Inf Sci 493:57\u201374","journal-title":"Inf Sci"},{"key":"1342_CR19","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.cag.2015.04.004","volume":"49","author":"S-J Peng","year":"2015","unstructured":"Peng S-J et al (2015) Hierarchical block-based incomplete human mocap data recovery using adaptive nonnegative matrix factorization. Comput Graph 49:10\u201323","journal-title":"Comput Graph"},{"issue":"6","key":"1342_CR20","doi-asserted-by":"crossref","first-page":"3011","DOI":"10.1109\/TIP.2018.2812100","volume":"27","author":"G Xia","year":"2018","unstructured":"Xia G et al (2018) Nonlinear low-rank matrix completion for human motion recovery. IEEE Trans Image Process 27(6):3011\u20133024","journal-title":"IEEE Trans Image Process"},{"issue":"3","key":"1342_CR21","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"J Douglas Carroll","year":"1970","unstructured":"Douglas Carroll J, Chang J-J (1970) Analysis of individual differences in multidimensional scaling via an N-way generalization of \u201cEckart-Young\" decomposition. Psychometrika 35(3):283\u2013319","journal-title":"Psychometrika"},{"issue":"3","key":"1342_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279\u2013311","journal-title":"Psychometrika"},{"issue":"5","key":"1342_CR23","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets IV (2011) Tensor-train decomposition. SIAM J Sci Comput 33(5):2295\u20132317","journal-title":"SIAM J Sci Comput"},{"key":"1342_CR24","unstructured":"Zhao Q et al (2016) Tensor ring decomposition. arXiv preprint arXiv:1606.05535"},{"issue":"1","key":"1342_CR25","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2012","unstructured":"Liu J et al (2012) Tensor completion for estimating missing values in visual data. IEEE Trans Pattern Anal Mach Intell 35(1):208\u2013220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"1342_CR26","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua JA et al (2017) Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans Image Process 26(5):2466\u20132479","journal-title":"IEEE Trans Image Process"},{"issue":"9","key":"1342_CR27","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TPAMI.2015.2392756","volume":"37","author":"Q Zhao","year":"2015","unstructured":"Zhao Q, Zhang L, Cichocki A (2015) Bayesian CP factorization of incomplete tensors with automatic rank determination. IEEE Trans Pattern Anal Mach Intell 37(9):1751\u20131763","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"20","key":"1342_CR28","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 (2016) Smooth parafac decomposition for tensor completion. IEEE Trans Signal Process 64(20):5423\u20135436","journal-title":"IEEE Trans Signal Process"},{"issue":"6","key":"1342_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/nla.2175","volume":"25","author":"G Heidel","year":"2018","unstructured":"Heidel G, Schulz V (2018) A Riemannian trust-region method for low-rank tensor completion. Numer Linear Algebra Appl 25(6):e2175","journal-title":"Numer Linear Algebra Appl"},{"issue":"3","key":"1342_CR30","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1109\/TIT.2019.2959980","volume":"66","author":"X-Y Liu","year":"2019","unstructured":"Liu X-Y et al (2019) Low-tubal-rank tensor completion using alternating minimization. IEEE Trans Inf Theory 66(3):1714\u20131737","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"1342_CR31","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2017","unstructured":"Zhou P et al (2017) Tensor factorization for low-rank tensor completion. IEEE Trans Image Process 27(3):1152\u20131163","journal-title":"IEEE Trans Image Process"},{"key":"1342_CR32","doi-asserted-by":"crossref","unstructured":"Wang W, Aggarwal V, Aeron S (2017) Efficient low-rank tensor ring completion. In: Proceedings of the IEEE international conference on computer vision, pp 5697\u20135705","DOI":"10.1109\/ICCV.2017.607"},{"issue":"3","key":"1342_CR33","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TPAMI.2013.164","volume":"36","author":"Y-L Chen","year":"2013","unstructured":"Chen Y-L, Hsu C-T, Liao H-YM (2013) Simultaneous tensor decomposition and completion using factor priors. IEEE Trans Pattern Anal Mach Intell 36(3):577\u2013591","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"1342_CR34","first-page":"751","volume":"30","author":"W Yuankai","year":"2018","unstructured":"Yuankai W et al (2018) A fused CP factorization method for incomplete tensors. IEEE Trans Neural Netw Learn Syst 30(3):751\u2013764","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1342_CR35","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 SN (2018) Twist tensor total variation regularized-reweighted nuclear norm-based tensor completion for video missing area recovery. Inf Sci 423:376\u2013397","journal-title":"Inf Sci"},{"issue":"4","key":"1342_CR36","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1007\/s10044-022-01082-3","volume":"25","author":"S Mohaoui","year":"2022","unstructured":"Mohaoui S, Hakim A, Raghay S (2022) Parallel matrix factorization-based collaborative sparsity and smooth prior for estimating missing values in multidimensional data. Pattern Anal Appl 25(4):963\u2013980","journal-title":"Pattern Anal Appl"},{"key":"1342_CR37","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/TIP.2021.3138325","volume":"31","author":"X-L Zhao","year":"2021","unstructured":"Zhao X-L et al (2021) Tensor completion via complementary global, local, and nonlocal priors. IEEE Trans Image Process 31:984\u2013999","journal-title":"IEEE Trans Image Process"},{"issue":"22","key":"1342_CR38","doi-asserted-by":"crossref","first-page":"5689","DOI":"10.1109\/TSP.2013.2278516","volume":"61","author":"JA Bazerque","year":"2013","unstructured":"Bazerque JA, Mateos G, Giannakis GB (2013) Rank regularization and Bayesian inference for tensor completion and extrapolation. IEEE Trans Signal Process 61(22):5689\u20135703","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"1342_CR39","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"issue":"7\u20138","key":"1342_CR40","first-page":"393","volume":"23","author":"P Comon","year":"2009","unstructured":"Comon P, Luciani X, De Almeida ALF (2009) Tensor decompositions, alternating least squares and other tales. J Chemomet J Chemomet Soc 23(7\u20138):393\u2013405","journal-title":"J Chemomet J Chemomet Soc"},{"issue":"2","key":"1342_CR41","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/110843587","volume":"33","author":"A Uschmajew","year":"2012","unstructured":"Uschmajew A (2012) Local convergence of the alternating least squares algorithm for canonical tensor approximation. SIAM J Matrix Anal Appl 33(2):639\u2013652","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1342_CR42","doi-asserted-by":"crossref","unstructured":"Cichocki A, Zdunek R, Amari S (2007) Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization. In: International conference on independent component analysis and signal separation, vol 1(1). Springer, pp 169\u2013176","DOI":"10.1007\/978-3-540-74494-8_22"},{"key":"1342_CR43","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim J, He Y, Park H (2014) Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J Glob Optim 58:285\u2013319","journal-title":"J Glob Optim"},{"issue":"3","key":"1342_CR44","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1587\/transfun.E92.A.708","volume":"92","author":"A Cichocki","year":"2009","unstructured":"Cichocki A, Phan A-H (2009) Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans Fundam Electron Commun Comput Sci 92(3):708\u2013721","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"1342_CR45","doi-asserted-by":"crossref","first-page":"4776","DOI":"10.1109\/TIP.2022.3169694","volume":"31","author":"X Tian","year":"2022","unstructured":"Tian X, Xie K, Zhang H (2022) A low-rank tensor decomposition model with factors prior and total variation for impulsive noise removal. IEEE Trans Image Process 31:4776\u20134789","journal-title":"IEEE Trans Image Process"},{"issue":"3","key":"1342_CR46","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/JSTSP.2021.3051503","volume":"15","author":"F Sedighin","year":"2021","unstructured":"Sedighin F, Cichocki A, Phan A-H (2021) Adaptive rank selection for tensor ring decomposition. IEEE J Sel Top Signal Process 15(3):454\u2013463","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"2","key":"1342_CR47","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"X Yangyang","year":"2015","unstructured":"Yangyang X et al (2015) Parallel matrix factorization for low-rank tensor completion. Inverse Probl Imaging 9(2):601\u2013624","journal-title":"Inverse Probl Imaging"},{"key":"1342_CR48","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng P (2001) Convergence of a block coordinate descent method for nondifferentiable minimization. J Optim Theory Appl 109:475\u2013494","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"1342_CR49","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas DP (1997) Nonlinear programming. J Oper Res Soc 48(3):334\u2013334","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1342_CR50","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn M, Hong M, Luo Z-Q (2013) A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J Optim 23(2):1126\u20131153","journal-title":"SIAM J Optim"},{"key":"1342_CR51","volume":"372","author":"T-X Jiang","year":"2020","unstructured":"Jiang T-X et al (2020) Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm. J Comput Appl Math 372:112680","journal-title":"J Comput Appl Math"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-024-01342-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-024-01342-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-024-01342-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T09:31:35Z","timestamp":1734341495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-024-01342-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,4]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1342"],"URL":"https:\/\/doi.org\/10.1007\/s10044-024-01342-4","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,4]]},"assertion":[{"value":"3 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2024","order":3,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"133"}}