{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T04:00:39Z","timestamp":1744689639381,"version":"3.40.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:00:00Z","timestamp":1742601600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:00:00Z","timestamp":1742601600000},"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":["12001363"],"award-info":[{"award-number":["12001363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72171170"],"award-info":[{"award-number":["72171170"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023YFC3306103"],"award-info":[{"award-number":["2023YFC3306103"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s40314-025-03177-z","type":"journal-article","created":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T03:00:11Z","timestamp":1742698811000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-rank approximation algorithm using sparse projection and its applications"],"prefix":"10.1007","volume":"44","author":[{"given":"Han","family":"Xiao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6094-9694","authenticated-orcid":false,"given":"Feng","family":"Yue-Hua","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Yong-xin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,22]]},"reference":[{"issue":"9","key":"3177_CR1","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.camwa.2016.09.014","volume":"72","author":"Y Aizenbud","year":"2016","unstructured":"Aizenbud Y, Shabat G, Averbuch A (2016) Randomized LU decomposition using sparse projections. Comput Math Appl 72(9):2525\u20132534","journal-title":"Comput Math Appl"},{"key":"3177_CR2","unstructured":"Braverman V, Ostrovsky R, Rabani Y (2010) Rademacher chaos, random eulerian graphs and the sparse Johnson-Lindenstrauss transform. arXiv preprint arXiv:1011.2590"},{"issue":"1","key":"3177_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar M, Chen K, Farach-Colton M (2004) Finding frequent items in data streams. Theoret Comput Sci 312(1):3\u201315. https:\/\/doi.org\/10.1016\/S0304-3975(03)00400-6. (Automata. Languages and Programming)","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"3177_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10915-022-01956-y","volume":"92","author":"M Che","year":"2022","unstructured":"Che M, Wei Y (2022) An efficient algorithm for computing the approximate t-URV and its applications. J Sci Comput 92(3):93","journal-title":"J Sci Comput"},{"issue":"6","key":"3177_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10444-024-10214-8","volume":"50","author":"H Chen","year":"2024","unstructured":"Chen H, Wang T, Zhang C-H, Wang X (2024) Solving the quadratic eigenvalue problem expressed in non-monomial bases by the tropical scaling. Adv Comput Math 50(6):1\u201328","journal-title":"Adv Comput Math"},{"issue":"1","key":"3177_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/MSP.2008.4408452","volume":"25","author":"A Cichocki","year":"2007","unstructured":"Cichocki A, Zdunek R, Amari S-I (2007) Nonnegative matrix and tensor factorization [lecture notes]. IEEE Signal Process Mag 25(1):142\u2013145","journal-title":"IEEE Signal Process Mag"},{"issue":"6","key":"3177_CR7","first-page":"54","volume":"63","author":"KL Clarkson","year":"2016","unstructured":"Clarkson KL, Woodruff DP (2016) Low-rank approximation and regression in input sparsity time. J Assoc Comput Mach 63(6):54\u201315445","journal-title":"J Assoc Comput Mach"},{"key":"3177_CR8","doi-asserted-by":"crossref","unstructured":"Dasgupta A, Kumar R, Sarl\u00f3s T (2010) A sparse Johnson\u2013Lindenstrauss transform. In: Proceedings of the annual acm symposium on theory of computing","DOI":"10.1145\/1806689.1806737"},{"key":"3177_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"P Drineas","year":"2007","unstructured":"Drineas P, Mahoney MW (2007) A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebra Appl 420:553\u2013571","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"3177_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/15M1044680","volume":"39","author":"JA Duersch","year":"2017","unstructured":"Duersch JA, Gu M (2017) Randomized QR with column pivoting. SIAM J Sci Comput 39(4):263\u2013291","journal-title":"SIAM J Sci Comput"},{"issue":"1137\/9781611971","key":"3177_CR11","first-page":"1","volume":"10","author":"R Escalante","year":"2011","unstructured":"Escalante R, Raydan M (2011) Alternating projection methods. Soc Ind Appl Math 10(1137\/9781611971941):1\u20133","journal-title":"Soc Ind Appl Math"},{"key":"3177_CR12","doi-asserted-by":"crossref","unstructured":"Esposito F, Atif SM, Gillis N (2024) Accelerated SVD-based initialization for nonnegative matrix factorization. Comp Appl Math 43:392","DOI":"10.1007\/s40314-024-02905-1"},{"key":"3177_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1553\/etna_vol51s469","volume":"51","author":"Y Feng","year":"2019","unstructured":"Feng Y, Xiao J, Gu M (2019) Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition. ETNA Electron Trans Numer Anal 51:469\u2013494. https:\/\/doi.org\/10.1553\/etna_vol51s469","journal-title":"ETNA Electron Trans Numer Anal"},{"key":"3177_CR14","doi-asserted-by":"crossref","unstructured":"Feng X, Yu W, Xie Y (2022) Pass-efficient randomized svd with boosted accuracy. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 3\u201320","DOI":"10.1007\/978-3-031-26387-3_1"},{"key":"3177_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781421407944","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub GH, Van Loan CF (2013) Matrix computations, 4th edn. Johns Hopkins University Press, Philadelphia. https:\/\/doi.org\/10.1137\/1.9781421407944","edition":"4"},{"key":"3177_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/S0169-7161(05)80137-3","volume":"9","author":"CR Goodall","year":"1993","unstructured":"Goodall CR (1993) 13 computation using the QR decomposition. Handb Stat 9:467\u2013508","journal-title":"Handb Stat"},{"key":"3177_CR17","doi-asserted-by":"crossref","unstructured":"Grussler C, Rantzer A (2015) On optimal low-rank approximation of non-negative matrices. In: 2015 54th IEEE conference on decision and control (CDC). IEEE, pp 5278\u20135283","DOI":"10.1109\/CDC.2015.7403045"},{"issue":"3","key":"3177_CR18","first-page":"714","volume":"37","author":"M Gu","year":"2014","unstructured":"Gu M (2014) Subspace iteration randomization and singular value problems. SIAM J Sci Comput 37(3):714\u2013785","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"3177_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson PG, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288. https:\/\/doi.org\/10.1137\/090771806","journal-title":"SIAM Rev"},{"key":"3177_CR20","unstructured":"Harshman RA (1970) Foundations of the Parafac procedure: models and conditions for an \u201cexplanatory\u201d multi-model factor analysis, vol 16, pp 1\u201384"},{"key":"3177_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in matrix analysis","author":"RA Horn","year":"1991","unstructured":"Horn RA, Johnson CR (1991) Topics in matrix analysis, vol 37. Cambridge University Presss, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511840371"},{"key":"3177_CR22","unstructured":"Indyk P, Matou\u0161ek J, Sidiropoulos A (2017) 8: low-distortion embeddings of finite metric spaces. In: Handbook of discrete and computational geometry. Chapman and Hall\/CRC, Boca Raton, pp 211\u2013231"},{"key":"3177_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s40314-023-02584-4","volume":"43","author":"Y Ji","year":"2024","unstructured":"Ji Y, Feng Y, Dong Y (2024) Pass-efficient truncated UTV for low-rank approximations. Comp Appl Math 43:65","journal-title":"Comp Appl Math"},{"key":"3177_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00211-022-01328-6","volume":"153","author":"T-X Jiang","year":"2022","unstructured":"Jiang T-X, Ng MK, Pan J, Song G-J (2022) Nonnegative low rank tensor approximations with multidimensional image applications. Numer Math 153:141\u2013170","journal-title":"Numer Math"},{"issue":"1","key":"3177_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559902","volume":"61","author":"DM Kane","year":"2014","unstructured":"Kane DM, Nelson J (2014) Sparser Johnson\u2013Lindenstrauss transforms. J ACM JACM 61(1):1\u201323","journal-title":"J ACM JACM"},{"key":"3177_CR26","doi-asserted-by":"crossref","unstructured":"Kim YD, Choi S (2008) Nonnegative tucker decomposition. In: IEEE conference on computer vision & pattern recognition","DOI":"10.1109\/ICASSP.2008.4517988"},{"key":"3177_CR27","unstructured":"Kressner D, Vandereycken B, Voorhaar R (2022) Streaming tensor train approximation, pp 1\u201321. arXiv:2208.02600"},{"key":"3177_CR28","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401:788\u2013791","journal-title":"Nature"},{"issue":"6","key":"3177_CR29","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1037\/h0022603","volume":"64","author":"J Levin","year":"1965","unstructured":"Levin J (1965) Three-mode factor analysis. Psychol Bull 64(6):442\u2013452","journal-title":"Psychol Bull"},{"issue":"1","key":"3177_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1751-0473-8-10","volume":"8","author":"Y Li","year":"2013","unstructured":"Li Y, Ngom A (2013) The non-negative matrix factorization toolbox for biological data mining. Source Code Biol Med 8(1):1\u201315","journal-title":"Source Code Biol Med"},{"key":"3177_CR31","doi-asserted-by":"publisher","unstructured":"Li Y, Ngom A (2010) Non-negative matrix and tensor factorization based classification of clinical microarray gene expression data. In: 2010 IEEE international conference on bioinformatics and biomedicine (BIBM), pp 438\u2013443. https:\/\/doi.org\/10.1109\/BIBM.2010.5706606","DOI":"10.1109\/BIBM.2010.5706606"},{"key":"3177_CR32","unstructured":"Malik OA, Becker S (2018) Low-rank tucker decomposition of large tensors using TENSORSKETCH. In: Advances in neural information processing systems 31: annual conference on neural information processing systems 2018, NeurIPS 2018, 3\u20138 December 2018, Montr\u00e9al, Canada, pp 10117\u201310127 (2018)"},{"key":"3177_CR33","doi-asserted-by":"crossref","unstructured":"Matveev SA, Budzinskiy S (2022) Sketching for low-rank nonnegative matrix approximation: a numerical study","DOI":"10.1515\/rnam-2023-0009"},{"key":"3177_CR34","doi-asserted-by":"crossref","unstructured":"Matveev S, Tretyak I (2025) Nonnegative tensor train for the multicomponent Smoluchowski equation. Comp Appl Math 44:35","DOI":"10.1007\/s40314-024-02993-z"},{"key":"3177_CR35","doi-asserted-by":"publisher","unstructured":"Nelson J, Nguy\u00ean HL (2013) OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings. In: 2013 IEEE 54th annual symposium on foundations of computer science, pp 117\u2013126. https:\/\/doi.org\/10.1109\/FOCS.2013.21","DOI":"10.1109\/FOCS.2013.21"},{"key":"3177_CR36","doi-asserted-by":"crossref","unstructured":"Nelson J, Nguy\u00ean HL (2014) Lower bounds for oblivious subspace embeddings. In: International colloquium on automata, languages, and programming. Springer, pp 883\u2013894","DOI":"10.1007\/978-3-662-43948-7_73"},{"issue":"2","key":"3177_CR37","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10208-015-9253-0","volume":"16","author":"D Noll","year":"2016","unstructured":"Noll D, Rondepierre A (2016) On local convergence of the method of alternating projections. Found Comput Math 16(2):425\u2013455","journal-title":"Found Comput Math"},{"issue":"5","key":"3177_CR38","doi-asserted-by":"publisher","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"},{"issue":"3","key":"3177_CR39","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/080736417","volume":"31","author":"V Rokhlin","year":"2010","unstructured":"Rokhlin V, Szlam A, Tygert M (2010) A randomized algorithm for principal component analysis. SIAM J Matrix Anal Appl 31(3):1100\u20131124","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3177_CR40","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1198\/jasa.2004.s339","volume":"99","author":"D Rupper","year":"2004","unstructured":"Rupper D et al (2004) The elements of statistical learning: data mining, inference, and prediction. J Am Stat Assoc 99:567","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"3177_CR41","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.acha.2016.04.006","volume":"44","author":"G Shabat","year":"2018","unstructured":"Shabat G, Shmueli Y, Aizenbud Y, Averbuch A (2018) Randomized LU decomposition. Appl Comput Harmon Anal 44(2):246\u2013272","journal-title":"Appl Comput Harmon Anal"},{"key":"3177_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2020.106300","volume":"105","author":"G-J Song","year":"2020","unstructured":"Song G-J, Ng MK (2020) Nonnegative low rank matrix approximation for nonnegative matrices. Appl Math Lett 105:106300. https:\/\/doi.org\/10.1016\/j.aml.2020.106300","journal-title":"Appl Math Lett"},{"issue":"2","key":"3177_CR43","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s40314-023-02211-2","volume":"42","author":"A Sultonov","year":"2023","unstructured":"Sultonov A, Matveev S, Budzinskiy S (2023) Low-rank nonnegative tensor approximation via alternating projections and sketching. Comput Appl Math 42(2):68","journal-title":"Comput Appl Math"},{"key":"3177_CR44","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/19M1257718","volume":"2","author":"Y Sun","year":"2019","unstructured":"Sun Y, Guo Y, Luo C, Tropp JA, Udell M (2019) Low-rank tucker approximation of a tensor from streaming data. SIAM J Math Data Sci 2:1123\u20131150","journal-title":"SIAM J Math Data Sci"},{"key":"3177_CR45","unstructured":"Thorup M, Zhang Y (2004) Tabulation based 4-universal hashing with applications to second moment estimation. Society for Industrial and Applied Mathematics"},{"issue":"4","key":"3177_CR46","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1137\/17M1111590","volume":"38","author":"JA Tropp","year":"2018","unstructured":"Tropp JA, Yurtsever A, Udell M, Cevher V (2018) Practical sketching algorithms for low-rank matrix approximation. SIAM J Matrix Anal Appl 38(4):1454\u20131485","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3177_CR47","first-page":"122","volume-title":"Problems in measuring change","author":"LR Tucker","year":"1963","unstructured":"Tucker LR (1963) Implications of factor analysis of three-way matrices for measurement of change. In: Harris CW (ed) Problems in measuring change. University of Wisconsin Press, Madison, pp 122\u2013137"},{"issue":"1","key":"3177_CR48","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/18M1183480","volume":"1","author":"M Udell","year":"2019","unstructured":"Udell M, Townsend A (2019) Why are big data matrices approximately low rank? SIAM J Math Data Sci 1(1):144\u2013160","journal-title":"SIAM J Math Data Sci"},{"key":"3177_CR49","unstructured":"Wall ME, Rechtsteiner A, Rocha, LM (2002) Singular value decomposition and principal component analysis"},{"key":"3177_CR50","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s40314-024-02751-1","volume":"43","author":"M Wang","year":"2024","unstructured":"Wang M, Cui H, Li H (2024) A random sampling algorithm for fully-connected tensor network decomposition with applications. Comp Appl Math 43:226","journal-title":"Comp Appl Math"},{"issue":"4","key":"3177_CR51","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1080\/03081087.2022.2160946","volume":"72","author":"T Wang","year":"2024","unstructured":"Wang T, Feng M, Wang X, Chen H (2024) New backward error bounds of Rayleigh\u2013Ritz projection methods for quadratic eigenvalue problem. Linear Multilinear Algebra 72(4):678\u2013686","journal-title":"Linear Multilinear Algebra"},{"key":"3177_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2024.109332","volume":"160","author":"Z Wang","year":"2025","unstructured":"Wang Z, Chen H, Teng Z, Wang X (2025) On perturbations for spectrum and singular value decompositions followed by deflation techniques. Appl Math Lett 160:109332","journal-title":"Appl Math Lett"},{"key":"3177_CR53","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.laa.2020.03.041","volume":"599","author":"N Wu","year":"2020","unstructured":"Wu N, Xiang H (2020) Randomized QLP decomposition. Linear Algebra Appl 599:18\u201335","journal-title":"Linear Algebra Appl"},{"key":"3177_CR54","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s40314-023-02368-w","volume":"42","author":"T Xu","year":"2023","unstructured":"Xu T, Huang T-Z, Deng L-J, Dou H-X, Yokoya N (2023) TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization. Comp Appl Math 42:234","journal-title":"Comp Appl Math"},{"issue":"1","key":"3177_CR55","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/409357","volume":"2012","author":"J Zhang","year":"2012","unstructured":"Zhang J, Erway J, Hu X, Zhang Q, Plemmons R (2012) Randomized SVD methods in hyperspectral imaging. J Electr Comput Eng 2012(1):409357","journal-title":"J Electr Comput Eng"},{"key":"3177_CR56","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s40314-022-01871-w","volume":"41","author":"J Zhao","year":"2022","unstructured":"Zhao J (2022) A novel low-rank matrix approximation algorithm for face denoising and background\/foreground separation. Comp Appl Math 41:165","journal-title":"Comp Appl Math"},{"issue":"2","key":"3177_CR57","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1080\/03081087.2021.2025198","volume":"71","author":"J Zhao","year":"2023","unstructured":"Zhao J, Wang X, Zhang J (2023) A randomised iterative method for solving factorised linear systems. Linear Multilinear Algebra 71(2):242\u2013255","journal-title":"Linear Multilinear Algebra"},{"issue":"4","key":"3177_CR58","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TITB.2009.2018115","volume":"13","author":"CH Zheng","year":"2009","unstructured":"Zheng CH, Huang DS, Member S, Zhang L (2009) Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed 13(4):599\u2013607","journal-title":"IEEE Trans Inf Technol Biomed"},{"key":"3177_CR59","first-page":"459","volume-title":"Fast nonnegative tensor factorization by using accelerated proximal gradient","author":"G Zhou","year":"2014","unstructured":"Zhou G, Zhao Q, Zhang Y, Cichocki A (2014) Fast nonnegative tensor factorization by using accelerated proximal gradient. Springer, Berlin, pp 459\u2013468"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03177-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03177-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03177-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:27:11Z","timestamp":1744604831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03177-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,22]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["3177"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03177-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,3,22]]},"assertion":[{"value":"26 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"198"}}