{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T15:04:39Z","timestamp":1777907079550,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T00:00:00Z","timestamp":1690761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T00:00:00Z","timestamp":1690761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"crossref","award":["2021\/0281"],"award-info":[{"award-number":["2021\/0281"]}],"id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10288-023-00549-1","type":"journal-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T18:02:12Z","timestamp":1690826532000},"page":"363-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An introduction to variational quantum algorithms for combinatorial optimization problems"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9063-8048","authenticated-orcid":false,"given":"Camille","family":"Grange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9145-2525","authenticated-orcid":false,"given":"Michael","family":"Poss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3641-5609","authenticated-orcid":false,"given":"Eric","family":"Bourreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,31]]},"reference":[{"issue":"1","key":"549_CR1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac3e54","volume":"7","author":"D Amaro","year":"2022","unstructured":"Amaro D, Modica C, Rosenkranz M, Fiorentini M, Benedetti M, Lubasch M (2022) Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci Technol 7(1):015021","journal-title":"Quantum Sci Technol"},{"key":"549_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis A, Balodis K, Iraids J, Kokainis M, Pr\u016bsis K, Vihrovs J (2019) Quantum speedups for exponential-time dynamic programming algorithms. In: Proceedings of the thirtieth annual ACM-SIAM symposium on discrete algorithms, pp 1783\u20131793. SIAM","DOI":"10.1137\/1.9781611975482.107"},{"key":"549_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"PK Barkoutsos","year":"2020","unstructured":"Barkoutsos PK, Nannicini G, Robert A, Tavernelli I, Woerner S (2020) Improving variational quantum optimization using CVaR. Quantum 4:256","journal-title":"Quantum"},{"issue":"26","key":"549_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505","volume":"125","author":"S Bravyi","year":"2020","unstructured":"Bravyi S, Kliesch A, Koenig R, Tang E (2020) Obstacles to variational quantum optimization from symmetry protection. Phys Rev Lett 125(26):260505","journal-title":"Phys Rev Lett"},{"key":"549_CR5","doi-asserted-by":"publisher","first-page":"678","DOI":"10.22331\/q-2022-03-30-678","volume":"6","author":"S Bravyi","year":"2022","unstructured":"Bravyi S, Kliesch A, Koenig R, Tang E (2022) Hybrid quantum-classical algorithms for approximate graph coloring. Quantum 6:678","journal-title":"Quantum"},{"issue":"9","key":"549_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo M, Arrasmith A, Babbush R, Benjamin SC, Endo S, Fujii K, McClean JR, Mitarai K, Yuan X, Cincio L et al (2021) Variational quantum algorithms. Nat Rev Phys 3(9):625\u2013644","journal-title":"Nat Rev Phys"},{"key":"549_CR7","unstructured":"Crooks GE (2018) Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419"},{"issue":"1","key":"549_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.4.010309","volume":"4","author":"G De Palma","year":"2023","unstructured":"De Palma G, Marvian M, Rouz\u00e9 C, Fran\u00e7a DS (2023) Limitations of variational quantum algorithms: a quantum optimal transport approach. PRX Quantum 4(1):010309","journal-title":"PRX Quantum"},{"key":"549_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","volume":"5","author":"DJ Egger","year":"2021","unstructured":"Egger DJ, Marecek J, Woerner S (2021) Warm-starting quantum optimization. Quantum 5:479","journal-title":"Quantum"},{"key":"549_CR10","unstructured":"Farhi E, Gamarnik D, Gutmann S (2020) The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002"},{"key":"549_CR11","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028"},{"key":"549_CR12","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution. arXiv preprint arXiv:quant-ph\/0001106"},{"key":"549_CR13","unstructured":"Farhi E, Harrow AW (2016) Quantum supremacy through the quantum approximate optimization algorithm. arXiv preprint arXiv:1602.07674"},{"key":"549_CR14","unstructured":"Fortran I, Press W, Teukolsky S, Vetterling W, Flannery B (1992) Numerical recipes. Cambridge, UK, Cambridge University Press"},{"key":"549_CR15","doi-asserted-by":"crossref","unstructured":"Glover F, Kochenberger G, Du Y (2019) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR, 17:335\u2013371","DOI":"10.1007\/s10288-019-00424-y"},{"issue":"6","key":"549_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM (JACM) 42(6):1115\u20131145","journal-title":"J ACM (JACM)"},{"key":"549_CR17","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp 212\u2013219","DOI":"10.1145\/237814.237866"},{"issue":"1","key":"549_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi GG, Matsuura AY (2019) QAOA for max-cut requires hundreds of qubits for quantum speed-up. Sci Rep 9(1):1\u20137","journal-title":"Sci Rep"},{"issue":"2","key":"549_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield S, Wang Z, O\u2019gorman B, Rieffel EG, Venturelli D, Biswas R (2019) From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2):34","journal-title":"Algorithms"},{"key":"549_CR20","doi-asserted-by":"crossref","unstructured":"Hastings MB (2019) Classical and quantum bounded depth approximation algorithms. arXiv preprint arXiv:1905.07047","DOI":"10.26421\/QIC19.13-14-3"},{"issue":"3","key":"549_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10287-018-0330-0","volume":"15","author":"L Hellemo","year":"2018","unstructured":"Hellemo L, Barton PI, Tomasgard A (2018) Decision-dependent probabilities in stochastic programs with recourse. CMS 15(3):369\u2013395","journal-title":"CMS"},{"issue":"10","key":"549_CR22","doi-asserted-by":"publisher","first-page":"294","DOI":"10.3390\/a14100294","volume":"14","author":"R Herrman","year":"2021","unstructured":"Herrman R, Treffert L, Ostrowski J, Lotshaw PC, Humble TS, Siopsis G (2021) Globally optimizing QAOA circuit depth for constrained optimization problems. Algorithms 14(10):294","journal-title":"Algorithms"},{"issue":"1","key":"549_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010313","volume":"3","author":"Z Holmes","year":"2022","unstructured":"Holmes Z, Sharma K, Cerezo M, Coles PJ (2022) Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum 3(1):010313","journal-title":"PRX Quantum"},{"issue":"1","key":"549_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3406306","volume":"1","author":"I Kerenidis","year":"2020","unstructured":"Kerenidis I, Prakash A (2020) A quantum interior point method for LPs and SDPs. ACM Trans Quantum Comput 1(1):1\u201332","journal-title":"ACM Trans Quantum Comput"},{"key":"549_CR25","doi-asserted-by":"publisher","first-page":"427","DOI":"10.22331\/q-2021-04-08-427","volume":"5","author":"I Kerenidis","year":"2021","unstructured":"Kerenidis I, Prakash A, Szil\u00e1gyi D (2021) Quantum algorithms for second-order cone programming and support vector machines. Quantum 5:427","journal-title":"Quantum"},{"key":"549_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07438-4","author":"MT Khumalo","year":"2022","unstructured":"Khumalo MT, Chieza HA, Prag K, Woolway M (2022) An investigation of IBM quantum computing device performance on combinatorial optimisation problems. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-022-07438-4","journal-title":"Neural Comput Appl"},{"key":"549_CR27","unstructured":"Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"549_CR28","unstructured":"Kitaev AY (1995) Quantum measurements and the Abelian stabilizer problem. arXiv preprint arXiv:quant-ph\/9511026"},{"issue":"2","key":"549_CR29","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2023.03.013","volume":"310","author":"K Kurowski","year":"2023","unstructured":"Kurowski K, Pecyna T, Slysz M, R\u00f3\u017cycki R, Walig\u00f3ra G, Weglarz J (2023) Application of quantum approximate optimization algorithm to job shop scheduling problem. European J Operat Res 310(2):518\u201328","journal-title":"European J Operat Res"},{"key":"549_CR30","unstructured":"Lao L, Manzano D, van Someren H, Ashraf I, Almudever CG (2019) Mapping of quantum circuits onto NISQ superconducting processors. Quantum Physics. arXiv:1908.04226"},{"issue":"2","key":"549_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023074","volume":"2","author":"L Li","year":"2020","unstructured":"Li L, Fan M, Coram M, Riley P, Leichenauer S et al (2020) Quantum optimization with a novel Gibbs objective function and ansatz architecture search. Phys Rev Res 2(2):023074","journal-title":"Phys Rev Res"},{"issue":"12","key":"549_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03342-3","volume":"20","author":"PC Lotshaw","year":"2021","unstructured":"Lotshaw PC, Humble TS, Herrman R, Ostrowski J, Siopsis G (2021) Empirical performance bounds for quantum approximate optimization. Quantum Inf Process 20(12):1\u201332","journal-title":"Quantum Inf Process"},{"key":"549_CR33","doi-asserted-by":"crossref","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Front Phys, 5","DOI":"10.3389\/fphy.2014.00005"},{"key":"549_CR34","doi-asserted-by":"publisher","first-page":"757","DOI":"10.22331\/q-2022-07-07-757","volume":"6","author":"K Marwaha","year":"2022","unstructured":"Marwaha K, Hadfield S (2022) Bounds on approximating Max $$k$$XOR with quantum and classical local algorithms. Quantum 6:757","journal-title":"Quantum"},{"issue":"1","key":"549_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean JR, Boixo S, Smelyanskiy VN, Babbush R, Neven H (2018) Barren plateaus in quantum neural network training landscapes. Nat Commun 9(1):1\u20136","journal-title":"Nat Commun"},{"issue":"47","key":"549_CR36","doi-asserted-by":"publisher","first-page":"10243","DOI":"10.1088\/0305-4470\/34\/47\/324","volume":"34","author":"R Mosseri","year":"2001","unstructured":"Mosseri R, Dandoloff R (2001) Geometry of entangled states, Bloch spheres and Hopf fibrations. J Phys A Math Gen 34(47):10243","journal-title":"J Phys A Math Gen"},{"key":"549_CR37","doi-asserted-by":"crossref","unstructured":"Nagarajan H, Lockwood O, Coffrin C (2021) QuantumCircuitOpt: an open-source framework for provably optimal quantum circuit design. In: 2021 IEEE\/ACM second international workshop on quantum computing software (QCS), pp 55\u201363. IEEE","DOI":"10.1109\/QCS54837.2021.00010"},{"issue":"1","key":"549_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304","volume":"99","author":"G Nannicini","year":"2019","unstructured":"Nannicini G (2019) Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Phys Rev E 99(1):013304","journal-title":"Phys Rev E"},{"key":"549_CR39","doi-asserted-by":"crossref","unstructured":"Nannicini G (2021) Fast Quantum Subroutines for the Simplex Method. In: Singh M, Williamson DP (eds) Integer programming and combinatorial optimization\u201322nd international conference, IPCO 2021, Atlanta, GA, USA, proceedings, vol 12707 of Lecture Notes in Computer Science, pp 311\u2013325. Springer","DOI":"10.1007\/978-3-030-73879-2_22"},{"issue":"4","key":"549_CR40","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308\u2013313","journal-title":"Comput J"},{"key":"549_CR41","doi-asserted-by":"crossref","unstructured":"Nielsen MA, Chuang I (2002) Quantum computation and quantum information","DOI":"10.1119\/1.1463744"},{"key":"549_CR42","doi-asserted-by":"crossref","unstructured":"N\u00fc\u00dflein J, Gabor T, Linnhoff-Popien C, Feld S (2022) Algorithmic QUBO formulations for k-SAT and hamiltonian cycles. In: Proceedings of the genetic and evolutionary computation conference companion, pp 2240\u20132246","DOI":"10.1145\/3520304.3533952"},{"key":"549_CR43","unstructured":"Oh YH, Mohammadbagherpoor H, Dreher P, Singh A, Yu X, Rindos AJ (2019) Solving multi-coloring combinatorial optimization problems using hybrid quantum algorithms. arXiv preprint arXiv:1911.00595"},{"issue":"1","key":"549_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, McClean J, Shadbolt P, Yung M-H, Zhou X-Q, Love PJ, Aspuru-Guzik A, O\u2019brien JL (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5(1):1\u20137","journal-title":"Nat Commun"},{"key":"549_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_4","volume-title":"A direct search optimization method that models the objective and constraint functions by linear interpolation","author":"MJ Powell","year":"1994","unstructured":"Powell MJ (1994) A direct search optimization method that models the objective and constraint functions by linear interpolation. Springer, Netherlands"},{"key":"549_CR46","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"key":"549_CR47","unstructured":"Radzihovsky M, Murphy J, Mason S (2019) A QAOA solution to the traveling salesman problem using pyQuil"},{"issue":"3","key":"549_CR48","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.32604\/cmc.2020.010001","volume":"63","author":"Y Ruan","year":"2020","unstructured":"Ruan Y, Marsh S, Xue X, Liu Z, Wang J et al (2020) The quantum approximate algorithm for solving traveling salesman problem. Comput Mater Continua 63(3):1237\u20131247","journal-title":"Comput Mater Continua"},{"key":"549_CR49","unstructured":"Ruder S (2016) An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747"},{"key":"549_CR50","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume":"10","author":"A Shapiro","year":"2003","unstructured":"Shapiro A (2003) Monte Carlo sampling methods. Handbooks Oper Res Manag Sci 10:353\u2013425","journal-title":"Handbooks Oper Res Manag Sci"},{"key":"549_CR51","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science, pp 124\u2013134. IEEE","DOI":"10.1109\/SFCS.1994.365700"},{"key":"549_CR52","doi-asserted-by":"crossref","unstructured":"Soloviev VP, Larra\u00f1aga P, Bielza C (2022) Quantum parametric circuit optimization with estimation of distribution algorithms. In: Proceedings of the genetic and evolutionary computation conference companion, pp 2247\u20132250","DOI":"10.1145\/3520304.3533963"},{"issue":"3","key":"549_CR53","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"JC Spall","year":"1992","unstructured":"Spall JC (1992) Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans Autom Control 37(3):332\u2013341","journal-title":"IEEE Trans Autom Control"},{"key":"549_CR54","doi-asserted-by":"crossref","unstructured":"Tabi Z, El-Safty KH, Kallus Z, H\u00e1ga P, Kozsik T, Glos A, Zimbor\u00e1s Z (2020) Quantum optimization for the graph coloring problem with space-efficient embedding. In: 2020 IEEE international conference on quantum computing and engineering (QCE), pp 56\u201362. IEEE","DOI":"10.1109\/QCE49297.2020.00018"},{"issue":"2","key":"549_CR55","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304","volume":"97","author":"Z Wang","year":"2018","unstructured":"Wang Z, Hadfield S, Jiang Z, Rieffel EG (2018) Quantum approximate optimization algorithm for MaxCut: a fermionic view. Phys Rev A 97(2):022304","journal-title":"Phys Rev A"},{"key":"549_CR56","doi-asserted-by":"publisher","first-page":"635","DOI":"10.22331\/q-2022-01-27-635","volume":"6","author":"J Wurtz","year":"2022","unstructured":"Wurtz J, Love PJ (2022) Counterdiabaticity and the quantum approximate optimization algorithm. Quantum 6:635","journal-title":"Quantum"},{"issue":"2","key":"549_CR57","volume":"7","author":"Z-C Yang","year":"2017","unstructured":"Yang Z-C, Rahmani A, Shabani A, Neven H, Chamon C (2017) Optimizing variational quantum algorithms using Pontryagin\u2019s minimum principle. Phys Rev X 7(2):021027","journal-title":"Phys Rev X"},{"issue":"2","key":"549_CR58","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou L, Wang S-T, Choi S, Pichler H, Lukin MD (2020) Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys Rev X 10(2):021067","journal-title":"Phys Rev X"},{"issue":"3","key":"549_CR59","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.033029","volume":"4","author":"L Zhu","year":"2022","unstructured":"Zhu L, Tang HL, Barron GS, Calderon-Vargas F, Mayhall NJ, Barnes E, Economou SE (2022) Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Phys Rev Res 4(3):033029","journal-title":"Phys Rev Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00549-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00549-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00549-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T11:45:31Z","timestamp":1729856731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00549-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,31]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00549-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,31]]},"assertion":[{"value":"20 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}