{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:47:31Z","timestamp":1770421651831,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002957","name":"Technische Universit\u00e4t Dresden","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002957","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we advance the understanding of the fundamental limits of computation for binary polynomial optimization (BPO), which is the problem of maximizing a given polynomial function over all binary points. In our main result we provide a novel class of BPO that can be solved efficiently both from a theoretical and computational perspective. In fact, we give a strongly polynomial-time algorithm for instances whose corresponding hypergraph is<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\beta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b2<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-acyclic. We note that the<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\beta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b2<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-acyclicity assumption is natural in several applications including relational database schemes and the lifted multicut problem on trees. Due to the novelty of our proving technique, we obtain an algorithm which is interesting also from a practical viewpoint. This is because our algorithm is very simple to implement and the running time is a polynomial of very low degree in the number of nodes and edges of the hypergraph. Our result completely settles the computational complexity of BPO over acyclic hypergraphs, since the problem is NP-hard on<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\alpha $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b1<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-acyclic instances. Our algorithm can also be applied to any general BPO problem that contains<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\beta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b2<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-cycles. For these problems, the algorithm returns a smaller instance together with a rule to extend any optimal solution of the smaller instance to an optimal solution of the original instance.<\/jats:p>","DOI":"10.1007\/s00453-022-01086-9","type":"journal-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T06:02:33Z","timestamp":1672207353000},"page":"2189-2213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs"],"prefix":"10.1007","volume":"85","author":[{"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Di Gregorio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"1086_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1086_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"1086_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-019-00169-z","volume":"12","author":"A Del Pia","year":"2020","unstructured":"Del Pia, A., Khajavirad, A., Sahinidis, N.: On the impact of running-intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12, 165\u2013191 (2020)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1086_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Del Pia","year":"2017","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1086_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-017-1158-z","volume":"170","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: On decomposability of multilinear sets. Math. Program. Ser. A 170(2), 387\u2013415 (2018)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"1086_CR6","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1287\/moor.2021.1121","volume":"46","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Khajavirad, A.: The running intersection relaxation of the multilinear polytope. Math. Oper. Res. 46(3), 1008\u20131037 (2021)","journal-title":"Math. Oper. Res."},{"key":"1086_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Incorporated, Berlin (2014)"},{"issue":"1","key":"1086_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F Barahona","year":"1986","unstructured":"Barahona, F.: A solvable case of quadratic 0\u20131 programming. Discrete Appl. Math. 13(1), 23\u201326 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"1086_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1\u20133), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"1086_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for non-linear 0\u20131 maximization problems. Math. Program. 61(1), 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"1086_CR11","first-page":"157","volume-title":"Emerging Applications of Algebraic Geometry. The IMA Volumes in Mathematics and its Applications","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry. The IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, New York (2009)"},{"key":"1086_CR12","doi-asserted-by":"crossref","unstructured":"Michini, C.: Tight cycle relaxations for the cut polytope. To appear in SIAM Journal on Discrete Mathematics (2021)","DOI":"10.1137\/20M1318523"},{"key":"1086_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., Jaumard, B.: The basic algorithm for pseudo-boolean programming revisited. Discret. Appl. Math. 29, 171\u2013185 (1990)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1086_CR14","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/15M1054079","volume":"28","author":"D Bienstock","year":"2018","unstructured":"Bienstock, D., Mu\u00f1oz, G.: LP formulations for polynomial optimization problems. SIAM J. Optim. 28(2), 1121\u20131150 (2018)","journal-title":"SIAM J. Optim."},{"key":"1086_CR15","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Berlin (2003)"},{"issue":"3","key":"1086_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. Assoc. Comput. Mach. 30(3), 514\u2013550 (1983)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1086_CR17","doi-asserted-by":"publisher","first-page":"6535","DOI":"10.1016\/j.disc.2009.06.035","volume":"309","author":"P J\u00e9goua","year":"2009","unstructured":"J\u00e9goua, P., Ndiayeb, S.N.: On the notion of cycles in hypergraphs. Discrete Math. 309, 6535\u20136543 (2009)","journal-title":"Discrete Math."},{"key":"1086_CR18","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019alg\u00e9bre de boole en recherche op\u00e8rationelle. Revue Fran\u00e7aise d\u2019Automatique, Informatique et Recherche Op\u00e9rationnelle 4, 17\u201326 (1960)","journal-title":"Revue Fran\u00e7aise d\u2019Automatique, Informatique et Recherche Op\u00e9rationnelle"},{"key":"1086_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.disopt.2017.02.001","volume":"25","author":"Y Crama","year":"2017","unstructured":"Crama, Y., Rodr\u00edguez-Heck, E.: A class of valid inequalities for multilinear 0\u20131 optimization problems. Discrete Optim. 25, 28\u201347 (2017)","journal-title":"Discrete Optim."},{"issue":"2","key":"1086_CR20","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1086_CR21","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2018.07.045","volume":"273","author":"C Buchheim","year":"2018","unstructured":"Buchheim, C., Crama, Y., Rodr\u00edguez-Heck, E.: Berge-acyclic multilinear 0\u20131 optimization problems. Eur. J. Oper. Res. 273(1), 102\u2013107 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1086_CR22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0049","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Di Gregorio, S.: Chv\u00e1tal rank in binary polynomial optimization. INFORMS J. Optim. (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0049","journal-title":"INFORMS J. Optim."},{"key":"1086_CR23","unstructured":"Hojny, C., Pfetsch, M.E., Walter, M.: Integrality of linearizations of polynomials over binary variables using additional monomials (2019)"},{"key":"1086_CR24","first-page":"71","volume":"17","author":"I Rosenberg","year":"1975","unstructured":"Rosenberg, I.: Reduction of bivalent maximization to the quadratic case. Cahiers Centre \u00c9tudes Recherche Op\u00e9r. 17, 71\u201374 (1975)","journal-title":"Cahiers Centre \u00c9tudes Recherche Op\u00e9r."},{"key":"1086_CR25","doi-asserted-by":"crossref","unstructured":"Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: CVPR, pp. 939\u2013946. IEEE Computer Society (2005)","DOI":"10.1109\/CVPR.2005.143"},{"issue":"4","key":"1086_CR26","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1137\/050646500","volume":"18","author":"C Buchheim","year":"2007","unstructured":"Buchheim, C., Rinaldi, G.: Efficient reduction of polynomial zero-one optimization to the quadratic case. SIAM J. Optim. 18(4), 1398\u20131413 (2007)","journal-title":"SIAM J. Optim."},{"key":"1086_CR27","doi-asserted-by":"crossref","unstructured":"Ishikawa, H.: Higher-order gradient descent by fusion-move graph cut. In: ICCV, pp. 568\u2013574. IEEE (2009)","DOI":"10.1109\/ICCV.2009.5459187"},{"issue":"6","key":"1086_CR28","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TPAMI.2010.91","volume":"33","author":"H Ishikawa","year":"2011","unstructured":"Ishikawa, H.: Transformation of general binary MRF minimization to the first-order case. IEEE Trans. Pattern Anal. Mach. Intell. 33(6), 1234\u20131249 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1086_CR29","first-page":"359","volume":"14","author":"PL Hammer","year":"1963","unstructured":"Hammer, P.L., Rosenberg, I., Rudeanu, S.: On the determination of the minima of pseudo-boolean functions. Stud. Cerc. Mat. 14, 359\u2013364 (1963). (in Romanian)","journal-title":"Stud. Cerc. Mat."},{"key":"1086_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"PL Hammer","year":"1968","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer, Berlin (1968)"},{"key":"1086_CR31","unstructured":"Boros, E., Gruber, A.: On quadratization of pseudo-boolean functions. Preprint arXiv:1404.6538. (2012)"},{"key":"1086_CR32","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10878-019-00511-0","volume":"39","author":"E Boros","year":"2020","unstructured":"Boros, E., Crama, Y., Rodr\u00edguez-Heck, E.: Compact quadratizations for pseudo-boolean functions. J. Comb. Optim. 39, 687\u2013707 (2020)","journal-title":"J. Comb. Optim."},{"key":"1086_CR33","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.039","volume":"481","author":"S Ordyniak","year":"2013","unstructured":"Ordyniak, S., Paulusma, D., Szeider, S.: Satisfiability of acyclic and almost acyclic CNF formulas. Theoret. Comput. Sci. 481, 85\u201399 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"1086_CR34","doi-asserted-by":"crossref","unstructured":"Fagin, R.: Acyclic database schemes (of various degrees): a painless introduction. In: CAAP (1983)","DOI":"10.1007\/3-540-12727-5_3"},{"key":"1086_CR35","doi-asserted-by":"crossref","unstructured":"Lange, J.-H., Andres, B.: On the lifted multicut polytope for trees. In: Pattern Recognition, vol. 12544, pp. 360\u2013372 (2021). 42nd DAGM German Conference, DAGM GCPR 2020","DOI":"10.1007\/978-3-030-71278-5_26"},{"issue":"2","key":"1086_CR36","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1038\/nmeth.4151","volume":"14","author":"T Beier","year":"2017","unstructured":"Beier, T., Pape, C., Rahaman, N., Prange, T., Berg, S., Bock, D., Cardona, A., Knott, G., Plaza, S., Scheffer, L., Koethe, U., Kreshuk, A., Hamprecht, F.: Multicut brings automated neurite segmentation closer to human performance. Nat. Methods 14(2), 101\u2013102 (2017)","journal-title":"Nat. Methods"},{"key":"1086_CR37","doi-asserted-by":"crossref","unstructured":"Tang, S., Andriluka, M., Andres, B., Schiele, B.: Multiple people tracking by lifted multicut and person re-identification. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3701\u20133710 (2017)","DOI":"10.1109\/CVPR.2017.394"},{"key":"1086_CR38","doi-asserted-by":"crossref","unstructured":"Keuper, M.: Higher-order minimum cost lifted multicuts for motion segmentation. In: 2017 IEEE International Conference on Computer Vision (ICCV), pp. 4252\u20134260 (2017)","DOI":"10.1109\/ICCV.2017.455"},{"key":"1086_CR39","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30, 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"3","key":"1086_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2983573","volume":"49","author":"J Brault-Baron","year":"2016","unstructured":"Brault-Baron, J.: Hypergraph acyclicity revisited. ACM Comput. Surv. 49(3), 1\u201326 (2016)","journal-title":"ACM Comput. Surv."},{"key":"1086_CR41","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1086_CR42","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadgets, approximation, and linear programming. SIAM J. Comput. 29(6), 2074\u20132097 (2000)","journal-title":"SIAM J. Comput."},{"key":"1086_CR43","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ipl.2012.05.005","volume":"112","author":"D Duris","year":"2012","unstructured":"Duris, D.: Some characterizations of $$\\gamma $$ and $$\\beta $$-acyclicity of hypergraphs. Inf. Process. Lett. 112, 617\u2013620 (2012)","journal-title":"Inf. Process. Lett."},{"key":"1086_CR44","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"1086_CR45","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Nashua (1997)"},{"key":"1086_CR46","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"1086_CR47","doi-asserted-by":"crossref","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for max-cut and other two-variable CSPs. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 146\u2013154 (2004)","DOI":"10.1109\/FOCS.2004.49"},{"key":"1086_CR48","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131154 (1995)","journal-title":"J. ACM"},{"key":"1086_CR49","doi-asserted-by":"crossref","unstructured":"Mossel, E., O\u2019Donnell, R., Oleszkiewicz, K.: Noise stability of functions with low influences: invariance and optimality. In: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 21\u201330 (2005)","DOI":"10.1109\/SFCS.2005.53"},{"key":"1086_CR50","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01086-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T02:40:29Z","timestamp":1728614429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01086-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":50,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1086"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01086-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"assertion":[{"value":"2 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}