{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:10Z","timestamp":1740123730323,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003945","name":"Link\u00f6ping University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003945","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The paper is concerned with methods for computing the best low multilinear rank approximation of large and sparse tensors. Krylov-type methods have been used for this problem; here block versions are introduced. For the computation of partial eigenvalue and singular value decompositions of matrices the Krylov-Schur (restarted Arnoldi) method is used. A generalization of this method to tensors is described, for computing the best low multilinear rank approximation of large and sparse tensors. In analogy to the matrix case, the large tensor is only accessed in multiplications between the tensor and blocks of vectors, thus avoiding excessive memory usage. It is proved that if the starting approximation is good enough, then the tensor Krylov-Schur method is convergent. Numerical examples are given for synthetic tensors and sparse tensors from applications, which demonstrate that for most large problems the Krylov-Schur method converges faster and more robustly than higher order orthogonal iteration.<\/jats:p>","DOI":"10.1007\/s11075-022-01303-0","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T07:02:21Z","timestamp":1651042941000},"page":"1315-1347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Krylov-Schur-like method for computing the best rank-(r1,r2,r3) approximation of large and sparse tensors"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2281-856X","authenticated-orcid":false,"given":"Lars","family":"Eld\u00e9n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Dehghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"key":"1303_CR1","volume-title":"Optimization algorithms on matrix manifolds","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, Princeton (2007)"},{"key":"1303_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0169-7439(98)00010-0","volume":"42","author":"CA Andersson","year":"1998","unstructured":"Andersson, C.A., Bro, R.: Improving the speed of multi-way algorithms: part i. Tucker3. Chemometrics and Intelligent Laboratory Systems 42, 93\u2013103 (1998)","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"1303_CR3","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1186785.1186794","volume":"32","author":"BW Bader","year":"2006","unstructured":"Bader, B.W., Kolda, T.G.: Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software (TOMS) 32, 635\u2013653 (2006)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"1303_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/060676489","volume":"30","author":"BW Bader","year":"2007","unstructured":"Bader, B.W., Kolda, T.G.: Efficient MATLAB computations with sparse and factored tensors. SIAM Journal on Scientific Computing 30, 205\u2013231 (2007). https:\/\/doi.org\/10.1137\/060676489. http:\/\/link.aip.org\/link\/?SCE\/30\/205\/1","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1303_CR5","volume-title":"Density based approaches to network analysis. Analysis of Reuters Terror News Network","author":"V Batagelj","year":"2003","unstructured":"Batagelj, V., Mrvar, A.: Density based approaches to network analysis. Analysis of Reuters Terror News Network. University of Ljubljana, Slovenia (2003). https:\/\/repozitorij.uni-lj.si\/IzpisGradiva.php?id=33150&lang=eng"},{"key":"1303_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0165-1684(96)00079-5","volume":"53","author":"P Comon","year":"1996","unstructured":"Comon, P., Mourrain, B.: Decomposition of quantics in sums of powers of linear forms. Signal Process. 53, 93\u2013107 (1996)","journal-title":"Signal Process."},{"key":"1303_CR7","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, 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR8","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-(r1,r2,...,rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR9","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V De Silva","year":"2008","unstructured":"De Silva, V., Lim, L.-H.: Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 30, 1084\u20131127 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-Clustering documents and words using bipartite spectral graph partitioning. In: Proc 7th ACM-SIGKDD Conference, pp 269\u2013274 (2001)","key":"1303_CR10","DOI":"10.1145\/502512.502550"},{"key":"1303_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20, 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20, 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"doi-asserted-by":"crossref","unstructured":"Eld\u00e9n, L.: Matrix methods in data mining and pattern recognition. SIAM (2007)","key":"1303_CR13","DOI":"10.1137\/1.9780898718867"},{"unstructured":"Eld\u00e9n, L., Dehghan, M.: Analyzing large and sparse tensor data using spectral low-rank approximation, Tech. Report 2012.07754 arxiv,math.NA (2020)","key":"1303_CR14"},{"doi-asserted-by":"publisher","unstructured":"Eld\u00e9n, L., Dehghan, M.: Spectral partitioning of large and sparse tensors using low-rank tensor approximation. Numerical Linear Algebra Appl., https:\/\/doi.org\/10.1002\/nla.2435 (2022)","key":"1303_CR15","DOI":"10.1002\/nla.2435"},{"key":"1303_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/070688316","volume":"31","author":"L Eld\u00e9n","year":"2009","unstructured":"Eld\u00e9n, L., Savas, B.: A Newton\u2013Grassmann method for computing the best multilinear rank-(r1,r2,r3) approximation of a tensor. SIAM Journal on Matrix Analysis and applications 31, 248\u2013271 (2009)","journal-title":"SIAM Journal on Matrix Analysis and applications"},{"key":"1303_CR17","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1137\/110823298","volume":"32","author":"L Eld\u00e9n","year":"2011","unstructured":"Eld\u00e9n, L., Savas, B.: Perturbation theory and optimality conditions for the best multilinear rank approximation of a tensor. SIAM J. Matrix Anal. Appl. 32, 1422\u20131450 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR18","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Hoboken (1987)","edition":"2nd edn."},{"key":"1303_CR19","first-page":"2265","volume":"8","author":"A Globerson","year":"2007","unstructured":"Globerson, A., Chechik, G., Pereira, F., Tishby, N.: Euclidean embedding of co-occurrence data. The Journal of Machine Learning Research 8, 2265\u20132295 (2007)","journal-title":"The Journal of Machine Learning Research"},{"key":"1303_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/0702016","volume":"2","author":"G Golub","year":"1965","unstructured":"Golub, G., Kahan, W.: Calculating the singular values and pseudo-inverse of a matrix. Journal of the Society for Industrial and Applied Mathematics Series B: Numerical Analysis 2, 205\u2013224 (1965)","journal-title":"Journal of the Society for Industrial and Applied Mathematics Series B: Numerical Analysis"},{"key":"1303_CR21","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","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 (2013)","edition":"4th edn."},{"key":"1303_CR22","doi-asserted-by":"publisher","first-page":"A1","DOI":"10.1137\/100792056","volume":"34","author":"S Goreinov","year":"2012","unstructured":"Goreinov, S., Oseledets, I.V., Savostyanov, D.V.: Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1 Tucker case. SIAM Journal on Scientific Computing 34, A1\u2013A27 (2012)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1303_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L. -H.: Most tensor problems are NP-hard. J. ACM 60, 1\u201339 (2013)","journal-title":"J. ACM"},{"key":"1303_CR24","first-page":"39","volume":"7","author":"FL Hitchcock","year":"1928","unstructured":"Hitchcock, F.L.: Multiple invariants and generalized rank of a p-way matrix or tensor. Stud. Appl. Math. 7, 39\u201379 (1928)","journal-title":"Stud. Appl. Math."},{"key":"1303_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","volume":"32","author":"M Ishteva","year":"2011","unstructured":"Ishteva, M., Absil, P. -A., Van Huffel, S., De Lathauwer, L.: Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM J. Matrix Anal. Appl. 32, 115\u2013135 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11075-008-9251-2","volume":"51","author":"M Ishteva","year":"2009","unstructured":"Ishteva, M., De Lathauwer, L., Absil, P.-A., Van Huffel, S.: Differential-geometric Newton method for the best rank-(r1,r2,r3) approximation of tensors. Numer. Algo. 51, 179\u2013194 (2009)","journal-title":"Numer. Algo."},{"key":"1303_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00778-016-0427-4","volume":"25","author":"I Jeon","year":"2016","unstructured":"Jeon, I., Papalexakis, E., Faloutsos, C., Sael, L., Kang, U.: Mining billion-scale tensors: algorithms and discoveries. The VLDB Journal 25, 519\u2013544 (2016). https:\/\/doi.org\/10.1007\/s00778-016-0427-4","journal-title":"The VLDB Journal"},{"doi-asserted-by":"publisher","unstructured":"Kaya, O., U\u00e7ar, B.: High performance parallel algorithms for the Tucker decomposition of sparse tensors. In: 2016 45th International Conference on Parallel Processing (ICPP), pp 103\u2013112 (2016), https:\/\/doi.org\/10.1109\/ICPP.2016.19","key":"1303_CR28","DOI":"10.1109\/ICPP.2016.19"},{"key":"1303_CR29","first-page":"523","volume":"5","author":"B Khoromskij","year":"2007","unstructured":"Khoromskij, B., Khoromskaia, V.: Low rank Tucker-type tensor approximation to classical potentials. Open Mathematics 5, 523\u2013550 (2007)","journal-title":"Open Mathematics"},{"key":"1303_CR30","doi-asserted-by":"publisher","first-page":"3002","DOI":"10.1137\/080730408","volume":"31","author":"BN Khoromskij","year":"2009","unstructured":"Khoromskij, B.N., Khoromskaia, V.: Multigrid accelerated tensor approximation of function related multidimensional arrays. SIAM J. Sci. Comput. 31, 3002\u20133026 (2009)","journal-title":"SIAM J. Sci. Comput."},{"key":"1303_CR31","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/ICDM.2008.89","volume":"2008","author":"T Kolda","year":"2008","unstructured":"Kolda, T., Sun, J.: Scalable tensor decompositions for multi-aspect data mining, in. Eighth IEEE International Conference on Data Mining 2008, 363\u2013372 (2008)","journal-title":"Eighth IEEE International Conference on Data Mining"},{"unstructured":"Kolda, T.G., Bader, B.W., Kenny, J.P.: Higher-order web link analysis using multilinear algebra. In: Fifth IEEE International Conference on Data Mining, pp 27\u201330. IEEE (2005)","key":"1303_CR32"},{"doi-asserted-by":"crossref","unstructured":"Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK Users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. SIAM (1998)","key":"1303_CR33","DOI":"10.1137\/1.9780898719628"},{"key":"1303_CR34","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1017\/S0962492921000076","volume":"30","author":"L-H Lim","year":"2021","unstructured":"Lim, L.-H.: Tensors in computations. Acta Numerica 30, 555\u2013764 (2021). https:\/\/doi.org\/10.1017\/S0962492921000076","journal-title":"Acta Numerica"},{"unstructured":"Lim, L. -H., Morton, J.: Cumulant component analysis: a simultaneous generalization of PCA and ICA. CASTA2008, 18 (2008)","key":"1303_CR35"},{"key":"1303_CR36","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TKDE.2012.95","volume":"25","author":"X Liu","year":"2013","unstructured":"Liu, X., Ji, S., Gl\u00e4nzel, W., De Moor, B.: Multiview partitioning via tensor methods. IEEE Trans. Knowl. Data Eng. 25, 1056\u20131069 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1303_CR37","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1137\/060655894","volume":"30","author":"IV Oseledets","year":"2008","unstructured":"Oseledets, I.V., Savostianov, D., Tyrtyshnikov, E.E.: Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl. 30, 939\u2013956 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"unstructured":"Persson, C., Bohlin, L., Edler, D., Rosvall, M.: Maps of sparse Markov chains efficiently reveal community structure in network flows with memory. arXiv:1606.08328 (2016)","key":"1303_CR38"},{"key":"1303_CR39","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"MJ Powell","year":"1973","unstructured":"Powell, M.J.: On search directions for minimization algorithms. Math. Program. 4, 193\u2013201 (1973)","journal-title":"Math. Program."},{"key":"1303_CR40","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/1022057","volume":"22","author":"A Ruhe","year":"1980","unstructured":"Ruhe, A., \u00c5wedin, P.: Algorithms for separable nonlinear least squares problems. SIAM Rev. 22, 318\u2013337 (1980)","journal-title":"SIAM Rev."},{"key":"1303_CR41","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.patcog.2006.08.004","volume":"40","author":"B Savas","year":"2007","unstructured":"Savas, B., Eld\u00e9n, L.: Handwritten digit classification using higher order singular value decomposition. Pattern Recognit. 40, 993\u20131003 (2007)","journal-title":"Pattern Recognit."},{"key":"1303_CR42","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.laa.2011.12.007","volume":"438","author":"B Savas","year":"2013","unstructured":"Savas, B., Eld\u00e9n, L.: Krylov-type methods for tensor computations I. Linear Algebra Appl. 438, 891\u2013918 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1303_CR43","doi-asserted-by":"publisher","first-page":"3352","DOI":"10.1137\/090763172","volume":"32","author":"B Savas","year":"2010","unstructured":"Savas, B., Lim, L. -H.: Quasi-newton methods on Grassmannians and multilinear approximations of tensors. SIAM J. Sci. Comput. 32, 3352\u20133393 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1303_CR44","volume-title":"Multi-way analysis: applications in the chemical sciences","author":"A Smilde","year":"2005","unstructured":"Smilde, A., Bro, R., Geladi, P.: Multi-way analysis: applications in the chemical sciences. Wiley, Hoboken (2005)"},{"unstructured":"Smith, S., Choi, J.W., Li, J., Vuduc, R., Park, J., Liu, X., Karypis, G.: FROSTT: The formidable repository of open sparse tensors and tools. http:\/\/frostt.io\/ (2017)","key":"1303_CR45"},{"key":"1303_CR46","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"DC Sorensen","year":"1992","unstructured":"Sorensen, D.C.: Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357\u2013385 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR47","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0895479800371529","volume":"23","author":"GW Stewart","year":"2001","unstructured":"Stewart, G.W.: A Krylov\u2013Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl. 23, 601\u2013614 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"doi-asserted-by":"crossref","unstructured":"Stewart, G.W.: Matrix Algorithms: Volume II: Eigensystems. SIAM (2001)","key":"1303_CR48","DOI":"10.1137\/1.9780898718058"},{"key":"1303_CR49","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/080734315","volume":"53","author":"AL Traud","year":"2011","unstructured":"Traud, A.L., Kelsic, E.D., Mucha, P.J., Porter, M.A.: Comparing community structure to characteristics in online collegiate social networks. SIAM Rieview 53, 526\u2013543 (2011)","journal-title":"SIAM Rieview"},{"unstructured":"Tucker, L.R.: The extension of factor analysis to three-dimensional matrices. In: Gulliksen, H., Frederiksen, N. (eds.) Contributions to mathematical psychology, pp 109\u2013127. Holt, Rinehart and Winston, New York (1964)","key":"1303_CR50"},{"key":"1303_CR51","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"},{"unstructured":"Xu, Y.: On the Convergence of higher-order orthogonality Iteration, Tech. Report 1504.00538v2 arXiv [math.NA] (2015)","key":"1303_CR52"},{"key":"1303_CR53","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/S0895479899352045","volume":"23","author":"T Zhang","year":"2001","unstructured":"Zhang, T., Golub, G.H.: Rank-one approximation to higher order tensors. SIAM J. Matrix Anal. Appl. 23, 534\u2013550 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1303_CR54","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11075-008-9192-9","volume":"47","author":"Y Zhou","year":"2008","unstructured":"Zhou, Y., Saad, Y.: Block Krylov-Schur method for large symmetric eigenvalue problems. Numer. Alg. 47, 341\u2013359 (2008)","journal-title":"Numer. Alg."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01303-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01303-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01303-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T01:19:35Z","timestamp":1727054375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01303-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1303"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01303-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,4,27]]},"assertion":[{"value":"21 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}