{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T12:04:32Z","timestamp":1784030672150,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T00:00:00Z","timestamp":1779753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T00:00:00Z","timestamp":1779753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00211-026-01547-1","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T11:31:28Z","timestamp":1779795088000},"page":"1361-1388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stable algorithms for general linear systems by preconditioning the normal equations"],"prefix":"10.1007","volume":"158","author":[{"given":"Ethan N.","family":"Epperly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anne","family":"Greenbaum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuji","family":"Nakatsukasa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,26]]},"reference":[{"key":"1547_CR1","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, vol. 82, 2nd edn. SIAM, Philadelphia (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","DOI":"10.1137\/1.9780898718003"},{"key":"1547_CR2","doi-asserted-by":"publisher","unstructured":"Spielman, D., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 81\u201390 (2004). https:\/\/doi.org\/10.1145\/1007352.1007372","DOI":"10.1145\/1007352.1007372"},{"key":"1547_CR3","doi-asserted-by":"publisher","unstructured":"Kelner, J., Orecchia, L., Sidford, A., Zhu, Z.A.: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 911\u2013920 (2013). https:\/\/doi.org\/10.1145\/2488608.2488724","DOI":"10.1145\/2488608.2488724"},{"key":"1547_CR4","doi-asserted-by":"publisher","unstructured":"Kyng, R., Sachdeva, S.: Approximate Gaussian elimination for Laplacians-fast, sparse, and simple. In: 57th Annual Symposium on Foundations of Computer Science, pp. 573\u2013582 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.68","DOI":"10.1109\/FOCS.2016.68"},{"issue":"6","key":"1547_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/20M1380624","volume":"43","author":"C Chen","year":"2021","unstructured":"Chen, C., Liang, T., Biros, G.: RCHOL: randomized Cholesky factorization for solving SDD linear systems. SIAM J. Sci. Comput. 43(6), 411\u2013438 (2021). https:\/\/doi.org\/10.1137\/20M1380624","journal-title":"SIAM J. Sci. Comput."},{"key":"1547_CR6","unstructured":"Gao, Y., Kyng, R., Spielman, D.A.: Robust and practical solution of Laplacian equations by approximate elimination. arXiv preprint arXiv:2303.00709 (2023)"},{"issue":"4","key":"1547_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/110843563","volume":"34","author":"O Livne","year":"2012","unstructured":"Livne, O., Brandt, A.: Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. SIAM J. Sci. Comput. 34(4), 499\u2013522 (2012). https:\/\/doi.org\/10.1137\/110843563","journal-title":"SIAM J. Sci. Comput."},{"key":"1547_CR8","unstructured":"Kyng, R.: Approximate Gaussian elimination. PhD thesis, Yale University (2017). https:\/\/rasmuskyng.com\/rjkyng-dissertation.pdf"},{"issue":"3","key":"1547_CR9","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1002\/nla.2152","volume":"25","author":"A Fox","year":"2018","unstructured":"Fox, A., Manteuffel, T.: Algebraic multigrid for directed graph Laplacian linear systems (NS-LAMG). Numer. Linear Algebra Appl. 25(3), 2152 (2018). https:\/\/doi.org\/10.1002\/nla.2152","journal-title":"Numer. Linear Algebra Appl."},{"issue":"36","key":"1547_CR10","doi-asserted-by":"publisher","first-page":"13212","DOI":"10.1073\/pnas.0804869105","volume":"105","author":"V Rokhlin","year":"2008","unstructured":"Rokhlin, V., Tygert, M.: A fast randomized algorithm for overdetermined linear least-squares regression. Proc. Natl. Acad. Sci. 105(36), 13212\u201313217 (2008). https:\/\/doi.org\/10.1073\/pnas.0804869105","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"1547_CR11","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/090767911","volume":"32","author":"H Avron","year":"2010","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: supercharging LAPACK\u2019s least-squares solver. SIAM J. Sci. Comput. 32(3), 1217\u20131236 (2010). https:\/\/doi.org\/10.1137\/090767911","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1547_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/21M1466244","volume":"44","author":"Z Frangella","year":"2023","unstructured":"Frangella, Z., Tropp, J.A., Udell, M.: Randomized Nystr\u00f6m preconditioning. SIAM J. Matrix Anal. Appl. 44(2), 718\u2013752 (2023). https:\/\/doi.org\/10.1137\/21M1466244","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1547_CR13","unstructured":"D\u00edaz, M., Epperly, E.N., Frangella, Z., Tropp, J.A., Webber, R.J.: Robust, randomized preconditioning for kernel ridge regression. arXiv preprint arXiv:2304.12465 (2024)"},{"key":"1547_CR14","doi-asserted-by":"publisher","unstructured":"Derezi\u0144ski, M., Musco, C., Yang, J.: Faster linear systems and matrix norm approximation via multi-level sketched preconditioning. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1972\u20132004 (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.62","DOI":"10.1137\/1.9781611978322.62"},{"key":"1547_CR15","doi-asserted-by":"publisher","unstructured":"Cutajar, K., Osborne, M.A., Cunningham, J.P., Filippone, M.: Preconditioning kernel matrices. In: Proceedings of the 33rd International Conference on Machine Learning. JMLR Workshop and Conference Proceedings, vol. 48, pp. 2529\u20132538 (2016). https:\/\/doi.org\/10.5555\/3045390.3045657","DOI":"10.5555\/3045390.3045657"},{"issue":"4","key":"1547_CR16","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1137\/110835347","volume":"34","author":"Y Notay","year":"2012","unstructured":"Notay, Y.: Aggregation-based algebraic multigrid for convection-diffusion equations. SIAM J. Sci. Comput. 34(4), 2288\u20132316 (2012). https:\/\/doi.org\/10.1137\/110835347","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"1547_CR17","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.1137\/10079687X","volume":"33","author":"DC-L Fong","year":"2011","unstructured":"Fong, D.C.-L., Saunders, M.: LSMR: an iterative algorithm for sparse least-squares problems. SIAM J. Sci. Comput. 33(5), 2950\u20132971 (2011). https:\/\/doi.org\/10.1137\/10079687X","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1547_CR18","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1145\/321406.321416","volume":"14","author":"JL Rigal","year":"1967","unstructured":"Rigal, J.L., Gaches, J.: On the compatibility of a given solution with the data of a linear system. J. ACM 14(3), 543\u2013548 (1967). https:\/\/doi.org\/10.1145\/321406.321416","journal-title":"J. ACM"},{"key":"1547_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (2002). https:\/\/doi.org\/10.1137\/1.9780898718027"},{"key":"1547_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719505","volume-title":"A Multigrid Tutorial","author":"WL Briggs","year":"2000","unstructured":"Briggs, W.L., Henson, V.E., McCormick, S.F.: A Multigrid Tutorial. SIAM, Philadelphia (2000). https:\/\/doi.org\/10.1137\/1.9780898719505"},{"key":"1547_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.laa.2024.04.003","volume":"692","author":"E Carson","year":"2024","unstructured":"Carson, E., Liesen, J., Strako\u0161, Z.: Towards understanding CG and GMRES through examples. Linear Algebra Appl. 692, 241\u2013291 (2024). https:\/\/doi.org\/10.1016\/j.laa.2024.04.003","journal-title":"Linear Algebra Appl."},{"key":"1547_CR22","unstructured":"Higham, N.J.: Seven sins of numerical linear algebra. (2022). https:\/\/nhigham.com\/2022\/10\/11\/seven-sins-of-numerical-linear-algebra\/"},{"key":"1547_CR23","doi-asserted-by":"publisher","unstructured":"Shewchuk, J.R.: An introduction to the conjugate gradient method without the agonizing pain. Technical Report, Carnegie Mellon University, USA (1994). https:\/\/doi.org\/10.5555\/865018","DOI":"10.5555\/865018"},{"issue":"1","key":"1547_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/23M1549079","volume":"45","author":"P Amestoy","year":"2024","unstructured":"Amestoy, P., Buttari, A., Higham, N.J., L\u2019excellent, J.-Y., Mary, T., Vieubl\u00e9, B.: Five-precision GMRES-based iterative refinement. SIAM J. Matrix Anal. Appl. 45(1), 529\u2013552 (2024). https:\/\/doi.org\/10.1137\/23M1549079","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1547_CR25","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1137\/17M1140819","volume":"40","author":"E Carson","year":"2018","unstructured":"Carson, E., Higham, N.J.: Accelerating the solution of linear systems by iterative refinement in three precisions. SIAM J. Sci. Comput. 40(2), 817\u2013847 (2018). https:\/\/doi.org\/10.1137\/17M1140819","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1547_CR26","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/19M1298263","volume":"43","author":"NJ Higham","year":"2021","unstructured":"Higham, N.J., Pranesh, S.: Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems. SIAM J. Sci. Comput. 43(1), 258\u2013277 (2021). https:\/\/doi.org\/10.1137\/19M1298263","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"1547_CR27","doi-asserted-by":"publisher","first-page":"2834","DOI":"10.1137\/17M1122918","volume":"39","author":"E Carson","year":"2017","unstructured":"Carson, E., Higham, N.J.: A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems. SIAM J. Sci. Comput. 39(6), 2834\u20132856 (2017). https:\/\/doi.org\/10.1137\/17M1122918","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1547_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/cpa.70013","volume":"79","author":"EN Epperly","year":"2026","unstructured":"Epperly, E.N., Meier, M., Nakatsukasa, Y.: Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers. Commun. Pure Appl. Math. 79(2), 293\u2013339 (2026). https:\/\/doi.org\/10.1002\/cpa.70013","journal-title":"Commun. Pure Appl. Math."},{"key":"1547_CR29","doi-asserted-by":"publisher","DOI":"10.1137\/23M1616790","author":"EN Epperly","year":"2024","unstructured":"Epperly, E.N.: Fast and forward stable randomized algorithms for linear least-squares problems. SIAM J. Matrix Anal. Appl. (2024). https:\/\/doi.org\/10.1137\/23M1616790","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1547_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/23M1551973","author":"M Meier","year":"2024","unstructured":"Meier, M., Nakatsukasa, Y., Townsend, A., Webb, M.: Are sketch-and-precondition least squares solvers numerically stable? SIAM J. Matrix Anal. Appl. (2024). https:\/\/doi.org\/10.1137\/23M1551973","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1547_CR31","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1137\/0613049","volume":"13","author":"NM Nachtigal","year":"1992","unstructured":"Nachtigal, N.M., Reddy, S.C., Trefethen, L.N.: How fast are nonsymmetric matrix iterations? SIAM J. Matrix Anal. Appl. 13(3), 778\u2013795 (1992). https:\/\/doi.org\/10.1137\/0613049","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1547_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970937","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative methods for solving linear systems. Front. Appl. Math. (1997). https:\/\/doi.org\/10.1137\/1.9781611970937","journal-title":"Front. Appl. Math."},{"issue":"2","key":"1547_CR33","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/050633032","volume":"28","author":"N Li","year":"2006","unstructured":"Li, N., Saad, Y.: MIQR: a multilevel incomplete QR preconditioner for large sparse least-squares problems. SIAM J. Matrix Anal. Appl. 28(2), 524\u2013550 (2006). https:\/\/doi.org\/10.1137\/050633032","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1547_CR34","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/24M1664927","volume":"46","author":"E Carson","year":"2025","unstructured":"Carson, E., Dau\u017eickait\u0117, I.: A comparison of mixed precision iterative refinement approaches for least-squares problems. SIAM J. Matrix Anal. Appl. 46(2), 1117\u20131144 (2025). https:\/\/doi.org\/10.1137\/24M1664927","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1547_CR35","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/S0895479803436652","volume":"28","author":"S Chandrasekaran","year":"2006","unstructured":"Chandrasekaran, S., Gu, M., Pals, T.: A fast $$ULV$$ decomposition solver for hierarchically semiseparable representations. SIAM J. Matrix Anal. Appl. 28(3), 603\u2013622 (2006). https:\/\/doi.org\/10.1137\/S0895479803436652","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1547_CR36","unstructured":"Lazzarino, L., Nakatsukasa, Y., Zerbinati, U.: Preconditioned normal equations for solving discretised partial differential equations. arXiv preprint arXiv:2502.17626 (2025). (Manuscript released concurrently with present work)"},{"key":"1547_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.22234","author":"Y Chen","year":"2025","unstructured":"Chen, Y., Epperly, E.N., Tropp, J.A., Webber, R.J.: Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations. Commun. Pure Appl. Math. (2025). https:\/\/doi.org\/10.1002\/cpa.22234","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"1547_CR38","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1), 43\u201371 (1982). https:\/\/doi.org\/10.1145\/355984.355989","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"1547_CR39","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/080724071","volume":"31","author":"X-W Chang","year":"2009","unstructured":"Chang, X.-W., Paige, C.C., Titley-Peloquin, D.: Stopping criteria for the iterative solution of linear least squares problems. SIAM J. Matrix Anal. Appl. 31(2), 831\u2013852 (2009). https:\/\/doi.org\/10.1137\/080724071","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1547_CR40","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson, P.-G., Tropp, J.A.: Randomized numerical linear algebra: foundations and algorithms. Acta Numer 29, 403\u2013572 (2020). https:\/\/doi.org\/10.1017\/S0962492920000021","journal-title":"Acta Numer"},{"key":"1547_CR41","unstructured":"Meier, M.: Randomized algorithms and theory for rank estimation and least squares. PhD thesis, University of Oxford (2024)"},{"key":"1547_CR42","unstructured":"Wilkinson, J.H.: Numerical linear algebra on digital computers. IMA Bull. 10(9\/10), 354\u2013356 (1974). Quote documented by Sven Hammarling and Nicholas Higham at https:\/\/nlagrouporg.wordpress.com\/2019\/05\/13\/wilkinson-quotes\/"},{"key":"1547_CR43","unstructured":"Chen, T.: The Lanczos algorithm for matrix functions: a handbook for scientists. arXiv preprint arXiv:2410.11090 (2024)"},{"key":"1547_CR44","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1553\/etna_vol65s63","volume":"65","author":"T Chen","year":"2026","unstructured":"Chen, T., Huber, C., Lin, E., Zaid, H.: Preconditioning without a preconditioner using randomized block Krylov subspace methods. ETNA Electron. Trans. Numer. Anal. 65, 63\u201392 (2026). https:\/\/doi.org\/10.1553\/etna_vol65s63","journal-title":"ETNA Electron. Trans. Numer. Anal."},{"key":"1547_CR45","doi-asserted-by":"publisher","unstructured":"Musco, C., Musco, C., Sidford, A.: Stability of the Lanczos method for matrix function approximation. In: Proceedings of the 2018 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1605\u20131624 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.105","DOI":"10.1137\/1.9781611975031.105"},{"issue":"7","key":"1547_CR46","doi-asserted-by":"publisher","first-page":"20","DOI":"10.5555\/151905.151908","volume":"31","author":"VL Druskin","year":"1992","unstructured":"Druskin, V.L., Knizhnerman, L.A.: Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues. Comput. Math. Math. Phys. 31(7), 20\u201330 (1992). https:\/\/doi.org\/10.5555\/151905.151908","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"1547_CR47","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/S1064827596303661","volume":"19","author":"V Druskin","year":"1998","unstructured":"Druskin, V., Greenbaum, A., Knizhnerman, L.: Using nonorthogonal Lanczos vectors in the computation of matrix functions. SIAM J. Sci. Comput. 19(1), 38\u201354 (1998). https:\/\/doi.org\/10.1137\/S1064827596303661","journal-title":"SIAM J. Sci. Comput."},{"key":"1547_CR48","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (2011). https:\/\/doi.org\/10.1145\/1961189.1961199","journal-title":"ACM Trans. Intell. Syst. Technol."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01547-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-026-01547-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01547-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T11:13:02Z","timestamp":1784027582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-026-01547-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,26]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1547"],"URL":"https:\/\/doi.org\/10.1007\/s00211-026-01547-1","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,26]]},"assertion":[{"value":"8 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2026","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 conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}