{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:28:48Z","timestamp":1760956128508,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11075-021-01227-1","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T15:03:33Z","timestamp":1643900613000},"page":"1197-1223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The finite steps of convergence of the fast thresholding algorithms with f-feedbacks in compressed sensing"],"prefix":"10.1007","volume":"90","author":[{"given":"Ningning","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6429-4114","authenticated-orcid":false,"given":"Shidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"issue":"4","key":"1227_CR1","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D. L.: Compressed sensing. IEEE Trans. Inf. Theory. 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"1227_CR2","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e9s","year":"2005","unstructured":"Cand\u00e9s, E. J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory. 51(12)), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"8","key":"1227_CR3","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e9s","year":"2006","unstructured":"Cand\u00e9s, E. J., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 (8), 1207\u20131223 (2006)","journal-title":"Comm. Pure Appl. Math."},{"issue":"2","key":"1227_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-AIEE.1928.5055024","volume":"47","author":"H Nyquist","year":"1928","unstructured":"Nyquist, H.: Certain topics in telegraph transmission theory. Trans. A.I.E.E. 47(2), 617\u2013644 (1928)","journal-title":"Trans. A.I.E.E."},{"issue":"2","key":"1227_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2007.914730","volume":"25","author":"MF Duarte","year":"2008","unstructured":"Duarte, M. F., Davenport, M. A., Takhar, D., Laska, J. N., Sun, T., Kelly, K. F., Baraniuk, R. G.: Single-Pixel Imaging via compressive sampling. IEEE Signal Process. Mag. 25(2), 83\u201391 (2008)","journal-title":"IEEE Signal Process. Mag."},{"issue":"11","key":"1227_CR6","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1109\/TIP.2010.2050625","volume":"19","author":"J Yang","year":"2010","unstructured":"Yang, J., Wright, J., Huang, T. S., Ma, Y.: Image super-resolution via sparse representation. IEEE Trans. Image Process. 19(11), 2861\u20132873 (2010)","journal-title":"IEEE Trans. Image Process."},{"issue":"8","key":"1227_CR7","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1109\/TSP.2005.850882","volume":"53","author":"D Malioutov","year":"2005","unstructured":"Malioutov, D., Cetin, M., Willsky, A. S.: A sparse signal reconstruction perspective for source localization with sensor arrays. IEEE Trans. Signal Process. 53(8), 3010\u20133022 (2005)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1227_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11075-015-0047-x","volume":"72","author":"M Donatelli","year":"2016","unstructured":"Donatelli, M., Huckle, T., Mazza, M., Sesana, D.: Image deblurring by sparsity constraint on the Fourier coefficients. Numer. Algorithm. 72 (2), 341\u2013361 (2016)","journal-title":"Numer. Algorithm."},{"issue":"1","key":"1227_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.acha.2012.08.003","volume":"35","author":"MF Duarte","year":"2013","unstructured":"Duarte, M. F., Baraniuk, R. G.: Spectral compressive sensing. Appl. Comput. Harmon. Anal. 35(1), 111\u2013129 (2013)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"1227_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e9s","year":"2011","unstructured":"Cand\u00e9s, E. J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM. 58(3), 1\u201337 (2011)","journal-title":"J. ACM."},{"issue":"3","key":"1227_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52 (3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"2","key":"1227_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S Gandy","year":"2011","unstructured":"Gandy, S., Recht, B., Yamada, I.: Tensor completion and low-n-rank tensor recovery via convex optimization. Inv. Probl. 27(2), 19 (2011)","journal-title":"Inv. Probl."},{"issue":"2","key":"1227_CR13","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11075-018-0621-0","volume":"82","author":"ZG Jia","year":"2019","unstructured":"Jia, Z. G., Ng, M. K., Song, G. J.: Lanczos method for large-scale quaternion singular value decomposition. Numer. Algorithm. 82(2), 699\u2013717 (2019)","journal-title":"Numer. Algorithm."},{"issue":"2","key":"1227_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B. K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1227_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S. S., Donoho, D. L., Saunders, M. A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"1227_CR16","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"EJ Cand\u00e9s","year":"2008","unstructured":"Cand\u00e9s, E. J.: The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris, Ser. I 346, 589\u2013592 (2008)","journal-title":"C. R. Math. Acad. Sci. Paris, Ser. I"},{"key":"1227_CR17","unstructured":"Foucart, S.: A note on guaranteed sparse recovery via \u21131 minimization. Appl. Comput. Harmon. Anal. 29(1), 97\u2013103 (2010)"},{"key":"1227_CR18","doi-asserted-by":"crossref","unstructured":"Davies, M., Gribonval, R.: Restricted isometry constants where \u2113p sparse recovery can fail for 0 < p \u2264\u20091. IEEE Trans. Inf. Theory. 55(5), 2203\u20132214","DOI":"10.1109\/TIT.2009.2016030"},{"issue":"1","key":"1227_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.acha.2009.10.004","volume":"29","author":"S Foucart","year":"2010","unstructured":"Foucart, S.: A note on guaranteed sparse recovery via \u21131 minimization. Appl. Comput. Harmon. Anal. 29(1), 97\u2013103 (2010)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"1227_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.acha.2012.07.010","volume":"35","author":"TT Cai","year":"2010","unstructured":"Cai, T. T., Zhang, A.: Sharp RIP bound for sparse signal and low-rank matrix recovery. Appl. Comput. Harmon. Anal. 35(1), 74\u201393 (2010)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"1227_CR21","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1109\/TIT.2017.2705741","volume":"64","author":"R Zhang","year":"2017","unstructured":"Zhang, R., Li, S.: A Proof of Conjecture on Restricted Isometry Property Constants \u03b4tk $(0< t<\\frac {4}{3})$. IEEE Trans. Inf. Theory. 64(3), 1699\u20131705 (2017)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"1227_CR22","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"1227_CR23","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.acha.2011.07.001","volume":"32","author":"QY Sun","year":"2012","unstructured":"Sun, Q. Y.: Recovery of sparsest signals via \u2113q-minimization. Appl. Comput. Harmon. Anal. 32(3), 329\u2013341 (2012)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"9","key":"1227_CR24","doi-asserted-by":"publisher","first-page":"6142","DOI":"10.1109\/TIT.2013.2262495","volume":"59","author":"R Wu","year":"2013","unstructured":"Wu, R., Chen, D. R.: The Improved Bounds of Restricted Isometry Constant for Recovery via \u2113p-Minimization. IEEE Trans. Inf. Theory. 59(9), 6142\u20136147 (2013)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"1227_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.sigpro.2017.02.012","volume":"137","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Peng, J. G., Yue, S. G.: Stability and robustness of the \u21132\/\u2113q-minimization for block sparse recovery. Signal Process. 137, 287\u2013297 (2017)","journal-title":"Signal Process."},{"issue":"3","key":"1227_CR26","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.acha.2017.10.004","volume":"47","author":"R Zhang","year":"2019","unstructured":"Zhang, R., Li, S.: Optimal RIP bounds for sparse signals recovery via \u2113p minimization. Appl. Comput. Harmon. Anal. 47(3), 566\u2013584 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"11","key":"1227_CR27","doi-asserted-by":"publisher","first-page":"6896","DOI":"10.1109\/TIT.2017.2717585","volume":"63","author":"L Zheng","year":"2017","unstructured":"Zheng, L., Maleki, A., Weng, H. L., Wang, X. D., Long, T.: Does \u2113p,-Minimization Outperform \u21131-Minimization?. IEEE Trans. Inf. Theory. 63(11), 6896\u20136935 (2017)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"1227_CR28","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3869\u20133872 (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"5","key":"1227_CR29","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e9s","year":"2008","unstructured":"Cand\u00e9s, E. J., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted \u21131 minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1227_CR30","doi-asserted-by":"crossref","unstructured":"Asif, M., Romberg, J.: Fast and accurate algorithms for re-weighted \u21131 norm minimization. IEEE Trans. Signal Process. 61(23), 5905\u20135916 (2013)","DOI":"10.1109\/TSP.2013.2279362"},{"key":"1227_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, Y.B., Li, D.: Reweighted \u21131 minimization for sparse solution to underdetermined linear systems. SIAM J. Optim. 22(3), 1065\u20131088 (2012)","DOI":"10.1137\/110847445"},{"issue":"1","key":"1227_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., Gntrk, C. S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"1227_CR33","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.acha.2017.07.001","volume":"45","author":"CK Lai","year":"2018","unstructured":"Lai, C. K., Li, S. D., Mondo, D.: Spark-level sparsity and the \u21131 tail minimization. Appl. Comput Harmon. Anal. 45(1), 206\u2013215 (2018)","journal-title":"Appl. Comput Harmon. Anal."},{"issue":"10","key":"1227_CR34","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J. A.: Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inf. Theory. 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"1227_CR35","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J. A., Gilbert, A. C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory. 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"1227_CR36","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"Needell, D., Vershynin, R.: Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J. Sel Topics Signal Process. 4(2), 310\u2013316 (2010)","journal-title":"IEEE J. Sel Topics Signal Process."},{"key":"1227_CR37","unstructured":"Donoho, D.L., Tsaig, Y., Drori, I., Starck, J.: Sparse solutions of underdetermined linear equations by stagewise orthogonal matching pursuit, [Online]. Available: http:\/\/www-stat.stanford.edu\/~donoho\/Reports\/2006\/StOMP-20060403.pdf (2006)"},{"issue":"5","key":"1227_CR38","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory. 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"1227_CR39","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J. A.: Cosamp: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"12","key":"1227_CR40","doi-asserted-by":"publisher","first-page":"6202","DOI":"10.1109\/TSP.2012.2218810","volume":"60","author":"J Wang","year":"2012","unstructured":"Wang, J., Kwon, S., Shim, B.: Generalized orthogonal matching pursuit. IEEE Trans. Signal Process. 60(12), 6202\u20136216 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5-6","key":"1227_CR41","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M. E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5-6), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"1227_CR42","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M. E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"1227_CR43","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M. E.: Normalized iterative hard thresholding: Guaranteed stability and performance. IEEE J. Sel. Top. Signal Process. 4(2), 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"3","key":"1227_CR44","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"Blumensath, T.: Accelerated iterative hard thresholding. Signal Process. 92(3), 752\u2013756 (2012)","journal-title":"Signal Process."},{"issue":"4","key":"1227_CR45","first-page":"289","volume":"4","author":"JD Blanchard","year":"2015","unstructured":"Blanchard, J. D., Tanner, J., Wei, K.: CGIHT: Conjugate gradient iterative hard thresholding for compressed sensing and matrix completion. Inf. Inference 4(4), 289\u2013327 (2015)","journal-title":"Inf. Inference"},{"issue":"2","key":"1227_CR46","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/TSP.2014.2379665","volume":"63","author":"JD Blanchard","year":"2014","unstructured":"Blanchard, J. D., Tanner, J., Wei, K.: Conjugate gradient iterative hard thresholding: Observed noise stability for compressed sensing. IEEE Trans. Signal Process. 63(2), 528\u2013537 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"1227_CR47","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"1227_CR48","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.acha.2016.03.002","volume":"41","author":"L Bouchot","year":"2016","unstructured":"Bouchot, L., Foucart, S., Hitczenko, P.: Hard thresholding pursuit algorithms: number of iterations. Appl. Comput. Harmon. Anal. 41(2), 412\u2013435 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1227_CR49","doi-asserted-by":"crossref","unstructured":"Bouchot, J. -L.: A generalized class of hard thresholding algorithms for sparse signal recovery. In: Approximation Theory XIV: San Antonio 2013, pp. 45\u201363. Springer (2014)","DOI":"10.1007\/978-3-319-06404-8_4"},{"issue":"1","key":"1227_CR50","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.acha.2013.09.001","volume":"37","author":"SD Li","year":"2014","unstructured":"Li, S. D., Liu, Y. L., Mi, T. B.: Fast thresholding algorithms with feedbacks for sparse signal recovery. Appl. Comput. Harmon. Anal. 37(1), 69\u201388 (2014)","journal-title":"Appl. Comput. Harmon. Anal."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01227-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01227-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01227-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T08:21:41Z","timestamp":1654676501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01227-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1227"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01227-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"3 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","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 declare that no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}