{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:14:47Z","timestamp":1772266487015,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares characterizations and sampling. We consider the interplay of sampling and symmetry reduction as well as a greedy method to obtain numerically good bases and sample points. We apply this to the computation of three-point bounds for the kissing number problem, for which we show a significant speedup. This allows for the computation of improved kissing number bounds in dimensions 11 through 23. The approach performs well for problems with bad numerical conditioning, which we show through new computations for the binary sphere packing problem.<\/jats:p>","DOI":"10.1007\/s12532-024-00264-w","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:03:14Z","timestamp":1725634994000},"page":"503-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving clustered low-rank semidefinite programs arising from polynomial optimization"],"prefix":"10.1007","volume":"16","author":[{"given":"Nando","family":"Leijenhorst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"de Laat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,6]]},"reference":[{"issue":"3","key":"264_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P Delsarte","year":"1977","unstructured":"Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedicata 6(3), 363\u2013388 (1977). https:\/\/doi.org\/10.1007\/BF03187604","journal-title":"Geom. Dedicata"},{"issue":"1","key":"264_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4007\/annals.2008.168.1","volume":"168","author":"OR Musin","year":"2008","unstructured":"Musin, O.R.: The kissing number in four dimensions. Ann. Math. (2) 168(1), 1\u201332 (2008). https:\/\/doi.org\/10.4007\/annals.2008.168.1","journal-title":"Ann. Math. (2)"},{"issue":"3","key":"264_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C Bachoc","year":"2008","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing numbers from semidefinite programming. J. Am. Math. Soc. 21(3), 909\u2013924 (2008). https:\/\/doi.org\/10.1090\/S0894-0347-07-00589-9","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"264_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/10586458.2010.10129070","volume":"19","author":"HD Mittelmann","year":"2010","unstructured":"Mittelmann, H.D., Vallentin, F.: High accuracy semidefinite programming bounds for kissing numbers. Exp. Math. 19(2), 175\u2013179 (2010). https:\/\/doi.org\/10.1080\/10586458.2010.10129070. arXiv:0902.1105","journal-title":"Exp. Math."},{"issue":"3","key":"264_CR5","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/10586458.2017.1286273","volume":"27","author":"FC Machado","year":"2018","unstructured":"Machado, F.C., de Oliveira Filho, F.M.: Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Exp. Math. 27(3), 362\u2013369 (2018). https:\/\/doi.org\/10.1080\/10586458.2017.1286273","journal-title":"Exp. Math."},{"issue":"2","key":"264_CR6","doi-asserted-by":"publisher","first-page":"689","DOI":"10.4007\/annals.2003.157.689","volume":"157","author":"H Cohn","year":"2003","unstructured":"Cohn, H., Elkies, N.: New upper bounds on sphere packings. I. Ann. Math. (2) 157(2), 689\u2013714 (2003). https:\/\/doi.org\/10.4007\/annals.2003.157.689","journal-title":"Ann. Math. (2)"},{"key":"264_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2014.24","volume":"2","author":"D de Laat","year":"2014","unstructured":"de Laat, D., de Oliveira Filho, F.M., Vallentin, F.: Upper bounds for packings of spheres of several radii. Forum Math. Sigma 2, e23 (2014). https:\/\/doi.org\/10.1017\/fms.2014.24","journal-title":"Forum Math. Sigma"},{"issue":"2","key":"264_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00454-017-9882-y","volume":"58","author":"M Dostert","year":"2017","unstructured":"Dostert, M., Guzm\u00e1n, C., de Oliveira Filho, F.M., Vallentin, F.: New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry. Discrete Comput. Geom. 58(2), 449\u2013481 (2017). https:\/\/doi.org\/10.1007\/s00454-017-9882-y","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"264_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1515\/dma.1993.3.1.75","volume":"4","author":"VA Yudin","year":"1992","unstructured":"Yudin, V.A.: Minimum potential energy of a point system of charges. Diskret. Mat. 4(2), 115\u2013121 (1992). https:\/\/doi.org\/10.1515\/dma.1993.3.1.75","journal-title":"Diskret. Mat."},{"issue":"4","key":"264_CR10","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1090\/S0894-0347-2012-00737-1","volume":"25","author":"H Cohn","year":"2012","unstructured":"Cohn, H., Woo, J.: Three-point bounds for energy minimization. J. Am. Math. Soc. 25(4), 929\u2013958 (2012). https:\/\/doi.org\/10.1090\/S0894-0347-2012-00737-1","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"264_CR11","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1090\/tran\/7976","volume":"373","author":"D de Laat","year":"2019","unstructured":"de Laat, D.: Moment methods in energy minimization: New bounds for Riesz minimal energy problems. Trans. Am. Math. Soc. 373(2), 1407\u20131453 (2019). https:\/\/doi.org\/10.1090\/tran\/7976. arXiv:1610.04905","journal-title":"Trans. Am. Math. Soc."},{"key":"264_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2019.106926","volume":"361","author":"A Chirre","year":"2020","unstructured":"Chirre, A., Gon\u00e7alves, F., de Laat, D.: Pair correlation estimates for the zeros of the zeta function via semidefinite programming. Adv. Math. 361, 106926 (2020). https:\/\/doi.org\/10.1016\/j.aim.2019.106926","journal-title":"Adv. Math."},{"issue":"6","key":"264_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/JHEP06(2015)174","volume":"2015","author":"D Simmons-Duffin","year":"2015","unstructured":"Simmons-Duffin, D.: A semidefinite program solver for the conformal bootstrap. J. High Energy Phys. 2015(6), 174 (2015). https:\/\/doi.org\/10.1007\/JHEP06(2015)174","journal-title":"J. High Energy Phys."},{"key":"264_CR14","unstructured":"Yamashita, M., Fujisawa, K., Nakata, K., Nakata, M., Fukuda, M., Kobayashi, K., Goto, K.: A high-performance software package for semidefinite programs: SDPA 7. Research Report B-460, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan (2010)"},{"key":"264_CR15","doi-asserted-by":"publisher","unstructured":"Lofberg, J., Parrilo, P.: From coefficients to samples: a new approach to SOS optimization. In: 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601), pp. 3154\u20133159. IEEE, Nassau (2004). https:\/\/doi.org\/10.1109\/CDC.2004.1428957","DOI":"10.1109\/CDC.2004.1428957"},{"key":"264_CR16","doi-asserted-by":"publisher","unstructured":"Liu, Z., Vandenberghe, L.: Low-rank structure in semidefinite programs derived from the KYP lemma. In: 2007 46th IEEE Conference on Decision and Control, pp. 5652\u20135659. IEEE, New Orleans, LA, USA (2007). https:\/\/doi.org\/10.1109\/CDC.2007.4434343","DOI":"10.1109\/CDC.2007.4434343"},{"key":"264_CR17","doi-asserted-by":"crossref","unstructured":"Benson, S.J.: DSDP5: software for semidefinite programming. ACM Trans. Math. Softw.\u00a021 (2005)","DOI":"10.2172\/947970"},{"key":"264_CR18","doi-asserted-by":"publisher","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: On the implementation and usage of SDPT3\u2014A Matlab software package for semidefinite-quadratic-linear programming, version 4.0. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, vol. 166, pp. 715\u2013754. Springer US, Boston (2012). https:\/\/doi.org\/10.1007\/978-1-4614-0769-0_25","DOI":"10.1007\/978-1-4614-0769-0_25"},{"key":"264_CR19","unstructured":"Landry, W., Simmons-Duffin, D.: Scaling the semidefinite program solver SDPB. arXiv:1909.09745 [hep-th] (2019)"},{"issue":"1","key":"264_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"issue":"8","key":"264_CR21","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TC.2017.2690633","volume":"66","author":"F Johansson","year":"2017","unstructured":"Johansson, F.: Arb: Efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Trans. Comput. 66(8), 1281\u20131292 (2017). https:\/\/doi.org\/10.1109\/TC.2017.2690633","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"264_CR22","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996). https:\/\/doi.org\/10.1137\/0806020","journal-title":"SIAM J. Optim."},{"issue":"1","key":"264_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(1), 86\u2013125 (1997). https:\/\/doi.org\/10.1137\/S1052623494269035","journal-title":"SIAM J. Optim."},{"issue":"3","key":"264_CR24","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7(3), 663\u2013678 (1997). https:\/\/doi.org\/10.1137\/S1052623495293056","journal-title":"SIAM J. Optim."},{"issue":"4","key":"264_CR25","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992). https:\/\/doi.org\/10.1137\/0802028","journal-title":"SIAM J. Optim."},{"issue":"3","key":"264_CR26","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1013777203597","volume":"21","author":"KC Toh","year":"2002","unstructured":"Toh, K.C.: A note on the calculation of step-lengths in interior-point methods for semidefinite programming. Comput. Optim. Appl. 21(3), 301\u2013310 (2002). https:\/\/doi.org\/10.1023\/A:1013777203597","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"264_CR27","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"issue":"1","key":"264_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-005-0684-2","volume":"107","author":"CW Scherer","year":"2006","unstructured":"Scherer, C.W., Hol, C.W.J.: Matrix sum-of-squares relaxations for robust semi-definite programs. Math. Program. 107(1), 189\u2013211 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0684-2","journal-title":"Math. Program."},{"issue":"3","key":"264_CR29","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1512\/iumj.2010.59.4107","volume":"59","author":"I Klep","year":"2010","unstructured":"Klep, I., Schweighofer, M.: Pure states, positive matrix polynomials and sums of Hermitian squares. Indiana Univ. Math. J. 59(3), 857\u2013874 (2010). https:\/\/doi.org\/10.1512\/iumj.2010.59.4107. arXiv:0907.2260","journal-title":"Indiana Univ. Math. J."},{"issue":"1","key":"264_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1), 95\u2013128 (2004). https:\/\/doi.org\/10.1016\/j.jpaa.2003.12.011","journal-title":"J. Pure Appl. Algebra"},{"key":"264_CR31","unstructured":"Serre, J.P.: Linear Representations of Finite Groups, corr. 5th print edn. No.\u00a042 in Graduate Texts in Mathematics. Springer, New York (1996)"},{"key":"264_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511623646","volume-title":"Reflection Groups and Coxeter Groups","author":"JE Humphreys","year":"1990","unstructured":"Humphreys, J.E.: Reflection Groups and Coxeter Groups. Cambridge University Press, Cambridge (1990). https:\/\/doi.org\/10.1017\/cbo9780511623646"},{"issue":"4","key":"264_CR33","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1137\/0714050","volume":"14","author":"KC Chung","year":"1977","unstructured":"Chung, K.C., Yao, T.H.: On lattices admitting unique Lagrange interpolations. SIAM J. Numer. Anal. 14(4), 735\u2013743 (1977). https:\/\/doi.org\/10.1137\/0714050","journal-title":"SIAM J. Numer. Anal."},{"issue":"8","key":"264_CR34","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1016\/j.camwa.2008.11.011","volume":"57","author":"A Sommariva","year":"2009","unstructured":"Sommariva, A., Vianello, M.: Computing approximate Fekete points by QR factorizations of Vandermonde matrices. Comput. Math. Appl. 57(8), 1324\u20131336 (2009). https:\/\/doi.org\/10.1016\/j.camwa.2008.11.011","journal-title":"Comput. Math. Appl."},{"issue":"5","key":"264_CR35","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1137\/S0036142998337247","volume":"38","author":"MA Taylor","year":"2000","unstructured":"Taylor, M.A., Wingate, B.A., Vincent, R.E.: An algorithm for computing Fekete points in the triangle. SIAM J. Numer. Anal. 38(5), 1707\u20131720 (2000). https:\/\/doi.org\/10.1137\/S0036142998337247","journal-title":"SIAM J. Numer. Anal."},{"key":"264_CR36","doi-asserted-by":"publisher","unstructured":"Fieker, C., Hart, W., Hofmann, T., Johansson, F.: Nemo\/hecke: Computer algebra and number theory packages for the julia programming language. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC \u201917, pp. 157\u2013164. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3087604.3087611","DOI":"10.1145\/3087604.3087611"},{"issue":"8","key":"264_CR37","first-page":"873","volume":"51","author":"F Pfender","year":"2004","unstructured":"Pfender, F., Ziegler, G.M.: Kissing numbers, sphere packings, and some unexpected proofs. Not. Am. Math. Soc. 51(8), 873\u2013883 (2004)","journal-title":"Not. Am. Math. Soc."},{"issue":"2","key":"264_CR38","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1137\/20M1351692","volume":"31","author":"M Dostert","year":"2021","unstructured":"Dostert, M., de Laat, D., Moustrou, P.: Exact semidefinite programming bounds for packing problems. SIAM J. Optim. 31(2), 1433\u20131458 (2021). https:\/\/doi.org\/10.1137\/20M1351692","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"264_CR39","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 613\u2013623 (1999). https:\/\/doi.org\/10.1080\/10556789908805765","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"264_CR40","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0773-1","volume":"150","author":"A Skajaa","year":"2015","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150(2), 391\u2013422 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0773-1","journal-title":"Math. Program."},{"key":"264_CR41","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: On \u201cA Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization\u201d. arXiv:1712.00492 [math] (2018)"},{"key":"264_CR42","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: Sum-of-squares optimization without semidefinite programming. arXiv:1712.01792 [math] (2018)"},{"key":"264_CR43","doi-asserted-by":"crossref","unstructured":"Johansson, F.: Faster arbitrary-precision dot product and matrix multiplication. arXiv:1901.04289 [cs] (2019)","DOI":"10.1109\/ARITH.2019.00012"},{"issue":"3","key":"264_CR44","doi-asserted-by":"publisher","first-page":"991","DOI":"10.4007\/annals.2017.185.3.7","volume":"185","author":"M Viazovska","year":"2017","unstructured":"Viazovska, M.: The sphere packing problem in dimension 8. Ann. Math. 185(3), 991\u20131015 (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.7","journal-title":"Ann. Math."},{"issue":"3","key":"264_CR45","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.4007\/annals.2017.185.3.8","volume":"185","author":"H Cohn","year":"2017","unstructured":"Cohn, H., Kumar, A., Miller, S.D., Radchenko, D., Viazovska, M.: The sphere packing problem in dimension 24. Ann. Math. 185(3), 1017\u20131033 (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.3.8. arXiv:1603.06518","journal-title":"Ann. Math."},{"key":"264_CR46","unstructured":"de\u00a0Laat, D.: Optimal densities of packings consisting of highly unequal objects. arXiv:1603.01094 [math] (2016)"},{"issue":"3","key":"264_CR47","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BF02851249","volume":"9","author":"A Florian","year":"1960","unstructured":"Florian, A.: Ausf\u00fcllung der Ebene durch Kreise. Rendiconti del Circolo Matematico di Palermo 9(3), 300\u2013312 (1960). https:\/\/doi.org\/10.1007\/BF02851249","journal-title":"Rendiconti del Circolo Matematico di Palermo"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00264-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-024-00264-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00264-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T07:27:46Z","timestamp":1727076466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-024-00264-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["264"],"URL":"https:\/\/doi.org\/10.1007\/s12532-024-00264-w","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"31 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}