{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:14:00Z","timestamp":1735017240527,"version":"3.32.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"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":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s42484-024-00186-9","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T15:02:26Z","timestamp":1724684546000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An encoding of argumentation problems using quadratic unconstrained binary optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"Marco","family":"Baioletti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"3","key":"186_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"TM Alkhamis","year":"1998","unstructured":"Alkhamis TM, Hasan M, Ahmed MA (1998) Simulated annealing for the unconstrained quadratic pseudo-Boolean function. Eur J Oper Res 108(3):641\u2013652","journal-title":"Eur J Oper Res"},{"issue":"1\u20132","key":"186_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2019-1808","volume":"167","author":"M Alviano","year":"2019","unstructured":"Alviano M (2019) Argumentation reasoning via circumscription with Pyglaf. Fundam Informaticae 167(1\u20132):1\u201330","journal-title":"Fundam Informaticae"},{"issue":"1\u20132","key":"186_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-016-1032-4","volume":"162","author":"M Anthony","year":"2017","unstructured":"Anthony M, Boros E, Crama Y, Gruber A (2017) Quadratic reformulations of nonlinear binary optimization problems. Math Program 162(1\u20132):115\u2013144","journal-title":"Math Program"},{"issue":"6","key":"186_CR4","first-page":"1543","volume":"8","author":"K Atkinson","year":"2021","unstructured":"Atkinson K, Bench-Capon TJ (2021) Value-based argumentation. FLAP 8(6):1543\u20131588","journal-title":"FLAP"},{"key":"186_CR5","doi-asserted-by":"crossref","unstructured":"Baioletti M, Santini F (2022) Abstract argumentation goes quantum: an encoding to QUBO problems. PRICAI 2022: 19th Pacific Rim International Conference on Artificial Intelligence, vol 13629. LNCS. Springer, Shanghai, China, pp 46\u201360","DOI":"10.1007\/978-3-031-20862-1_4"},{"key":"186_CR6","unstructured":"Baioletti M, Santini F (2023) On using QUBO to enforce extensions in abstract argumentation (short paper). In: AIQxQIA@AI*IA. CEUR Workshop Proceedings, vol. 3586. CEUR-WS.org, Rome, Italy"},{"issue":"1","key":"186_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ijar.2010.05.004","volume":"52","author":"P Baroni","year":"2011","unstructured":"Baroni P, Cerutti F, Giacomin M, Guida G (2011) AFRA: argumentation framework with recursive attacks. Int J Approx Reason 52(1):19\u201337","journal-title":"Int J Approx Reason"},{"issue":"4","key":"186_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P Baroni","year":"2011","unstructured":"Baroni P, Caminada M, Giacomin M (2011) An introduction to argumentation semantics. Knowl Eng Rev 26(4):365\u2013410","journal-title":"Knowl Eng Rev"},{"key":"186_CR9","volume-title":"Handbook of formal argumentation","author":"P Baroni","year":"2018","unstructured":"Baroni P, Gabbay DM, Giacomin M, Torre L (2018) Handbook of formal argumentation. College Publications, Rickmansworth, UK"},{"key":"186_CR10","unstructured":"Baumann R (2012) What does it take to enforce an argument? Minimal change in abstract argumentation. In: ECAI. Frontiers in artificial intelligence and applications, vol. 242, IOS Press, Montpellier, France, pp 127\u2013132"},{"key":"186_CR11","unstructured":"Baumann R, Brewka G (2010) Expanding argumentation frameworks: enforcing and monotonicity results. COMMA, vol 216. Frontiers in Artificial Intelligence and Applications. IOS Press, Potsdam, Germany, pp 75\u201386"},{"key":"186_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ijar.2017.10.006","volume":"92","author":"S Bistarelli","year":"2018","unstructured":"Bistarelli S, Rossi F, Santini F (2018) A novel weighted defence and its relaxation in abstract argumentation. Int J Approx Reason 92:66\u201386","journal-title":"Int J Approx Reason"},{"issue":"6","key":"186_CR13","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1080\/0952813X.2020.1789756","volume":"33","author":"S Bistarelli","year":"2021","unstructured":"Bistarelli S, Rossi F, Santini F (2021) ConArgLib: an argumentation library with support to search strategies and parallel search. J Exp Theor Artif Intell 33(6):891\u2013918","journal-title":"J Exp Theor Artif Intell"},{"key":"186_CR14","unstructured":"Bistarelli S, Kotthoff L, Santini F, Taticchi C (2020) A first overview of ICCMA\u201919. Advances In Argumentation In Artificial Intelligence (AIxIA 2020), vol 2777. CEUR Workshop Proceedings. CEUR-WS.org, Virtual Event, pp 90\u2013102"},{"key":"186_CR15","doi-asserted-by":"crossref","unstructured":"Bistarelli S, Santini F (2011) Conarg: A constraint-based computational framework for argumentation systems. IEEE 23rd International Conference on Tools with Artificial Intelligence. ICTAI 2011. IEEE Computer Society, Boca Raton, FL, USA, pp 605\u2013612","DOI":"10.1109\/ICTAI.2011.96"},{"key":"186_CR16","unstructured":"Boothby K, Bunyk P, Raymond J, Roy A (2020) Next-generation topology of D-wave quantum processors. https:\/\/arxiv.org\/abs\/2003.00133"},{"key":"186_CR17","unstructured":"Caminada M (2007) Comparing two unique extension semantics for formal argumentation: ideal and eager. In: Belgian-Dutch Conference on Artificial Intelligence (BNAIC), pp 81\u201387"},{"issue":"5","key":"186_CR18","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1093\/logcom\/exr033","volume":"22","author":"M Caminada","year":"2012","unstructured":"Caminada M, Carnielli WA, Dunne PE (2012) Semi-stable semantics. J Log Comput 22(5):1207\u20131254","journal-title":"J Log Comput"},{"key":"186_CR19","doi-asserted-by":"crossref","unstructured":"Cayrol C, Devred C, Lagasquie-Schiex M (2007) Handling ignorance in argumentation: semantics of partial argumentation frameworks. ECSQARU, vol 4724. Lecture Notes in Computer Science. Springer, Hammamet, Tunisia, pp 259\u2013270","DOI":"10.1007\/978-3-540-75256-1_25"},{"issue":"8","key":"186_CR20","first-page":"2623","volume":"4","author":"F Cerutti","year":"2017","unstructured":"Cerutti F, Gaggl SA, Thimm M, Wallner J (2017) Foundations of implementations for formal argumentation. If CoLog J Log Appl 4(8):2623\u20132705","journal-title":"If CoLog J Log Appl"},{"issue":"3","key":"186_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.3233\/AAC-200907","volume":"11","author":"F Cerutti","year":"2020","unstructured":"Cerutti F, Thimm M, Vallati M (2020) An experimental analysis on the similarity of argumentation semantics. Argument Comput 11(3):269\u2013304","journal-title":"Argument Comput"},{"issue":"10\u201315","key":"186_CR22","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.artint.2007.04.012","volume":"171","author":"S Coste-Marquis","year":"2007","unstructured":"Coste-Marquis S, Devred C, Konieczny S, Lagasquie-Schiex M, Marquis P (2007) On the merging of Dung\u2019s argumentation systems. Artif Intell 171(10\u201315):730\u2013753","journal-title":"Artif Intell"},{"key":"186_CR23","unstructured":"Coste-Marquis S, Konieczny S, Mailly J, Marquis P (2015) Extension enforcement in abstract argumentation as an optimization problem. International Joint Conference on Artificial Intelligence. IJCAI. AAAI Press, Buenos Aires, Argentina, pp 2876\u20132882"},{"issue":"2","key":"186_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung PM (1995) On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif Intell 77(2):321\u2013358","journal-title":"Artif Intell"},{"issue":"10\u201315","key":"186_CR25","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"PM Dung","year":"2007","unstructured":"Dung PM, Mancarella P, Toni F (2007) Computing ideal sceptical argumentation. Artifl Intell 171(10\u201315):642\u2013674","journal-title":"Artifl Intell"},{"issue":"2","key":"186_CR26","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.artint.2010.09.005","volume":"175","author":"PE Dunne","year":"2011","unstructured":"Dunne PE, Hunter A, McBurney P, Parsons S, Wooldridge MJ (2011) Weighted argument systems: basic definitions, algorithms, and complexity results. Artif Intell 175(2):457\u2013486","journal-title":"Artif Intell"},{"key":"186_CR27","doi-asserted-by":"publisher","first-page":"103873","DOI":"10.1016\/j.artint.2023.103873","volume":"317","author":"W Dvor\u00e1k","year":"2023","unstructured":"Dvor\u00e1k W, Gre\u00dfler A, Rapberger A, Woltran S (2023) The complexity landscape of claim-augmented argumentation frameworks. Artif Intell 317:103873","journal-title":"Artif Intell"},{"key":"186_CR28","unstructured":"Dvor\u00e1k W, Dunne PE (2017) Computational problems in formal argumentation and their complexity. FLAP 4(8)"},{"key":"186_CR29","unstructured":"Dvor\u00e1k W, K\u00f6nig M, Wallner JP, Woltran S (2021) Aspartix-v21. CoRR abs\/2109.03166"},{"key":"186_CR30","doi-asserted-by":"crossref","unstructured":"Egly U, Gaggl SA, Woltran S (2008) ASPARTIX: implementing argumentation frameworks using answer-set programming. Logic Programming, 24th International Conference, ICLP, vol 5366. Lecture Notes in Computer Science. Springer, Udine, Italy, pp 734\u2013738","DOI":"10.1007\/978-3-540-89982-2_67"},{"issue":"4","key":"186_CR31","first-page":"343","volume":"38","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P, R\u00e9nyi A (1961) On the evolution of random graphs. Bull Inst Internat Statist 38(4):343\u2013347","journal-title":"Bull Inst Internat Statist"},{"key":"186_CR32","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm"},{"key":"186_CR33","unstructured":"Gabbay D, Giacomin M, Simari G (2021) Handbook of formal argumentation. Volume 2 vol. v. 2. College Publications, Rickmansworth, UK"},{"key":"186_CR34","doi-asserted-by":"crossref","unstructured":"Gaggl SA, Linsbichler T, Maratea M, Woltran S (2020) Design and results of the second international competition on computational models of argumentation. Artif Intell 279","DOI":"10.1016\/j.artint.2019.103193"},{"key":"186_CR35","doi-asserted-by":"crossref","unstructured":"Glover FW, Kochenberger GA, Du Y (2019) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR 17(4):335\u2013371","DOI":"10.1007\/s10288-019-00424-y"},{"key":"186_CR36","doi-asserted-by":"crossref","unstructured":"Hammer P, Rudeanu S (1968) Boolean methods in operations research and related areas, \u00f6konometrie und unternehmensforschung\/econometrics and operations research. 1007:978\u20133 Springer, Berlin","DOI":"10.1007\/978-3-642-85823-9_2"},{"key":"186_CR37","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.5393","volume":"59","author":"A Hunter","year":"2017","unstructured":"Hunter A, Thimm M (2017) Probabilistic reasoning with abstract argumentation frameworks. J Artif Intell Res 59:565\u2013611","journal-title":"J Artif Intell Res"},{"issue":"4598","key":"186_CR38","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"186_CR39","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"GA Kochenberger","year":"2014","unstructured":"Kochenberger GA, Hao J, Glover FW, Lewis MW, L\u00fc Z, Wang H, Wang Y (2014) The unconstrained binary quadratic programming problem: a survey. J Comb Optim 28(1):58\u201381","journal-title":"J Comb Optim"},{"key":"186_CR40","unstructured":"Laarhoven PJM, Aarts EHL (1987) Simulated annealing: theory and applications. Mathematics and Its Applications, vol. 37. Springer, Heidelberg, Germany"},{"key":"186_CR41","doi-asserted-by":"crossref","unstructured":"Lagniez J, Lonca E, Mailly J (2015) CoQuiAAS: a constraint-based quick abstract argumentation solver. 27th IEEE International conference on tools with artificial intelligence. ICTAI. IEEE Computer Society, Vietri sul Mare, Italy, pp 928\u2013935","DOI":"10.1109\/ICTAI.2015.134"},{"issue":"4","key":"186_CR42","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s10898-011-9713-2","volume":"52","author":"D Li","year":"2012","unstructured":"Li D, Sun X, Liu C (2012) An exact solution method for unconstrained quadratic 0\u20131 programming: a geometric approach. J Glob Optim 52(4):797\u2013829","journal-title":"J Glob Optim"},{"key":"186_CR43","doi-asserted-by":"crossref","unstructured":"Li H, Oren N, Norman TJ (2011) Probabilistic argumentation frameworks. In: TAFA. Lecture Notes in Computer Science, vol. 7132, Springer, Barcelona, Spain pp 1\u201316","DOI":"10.1007\/978-3-642-29184-5_1"},{"issue":"3","key":"186_CR44","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc Z, Glover FW, Hao J (2010) A hybrid metaheuristic approach to solving the UBQP problem. Eur J Oper Res 207(3):1254\u20131262","journal-title":"Eur J Oper Res"},{"key":"186_CR45","doi-asserted-by":"crossref","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Front Phys 2","DOI":"10.3389\/fphy.2014.00005"},{"issue":"7","key":"186_CR46","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1016\/j.cor.2011.09.008","volume":"39","author":"GR Mauri","year":"2012","unstructured":"Mauri GR, Lorena LAN (2012) Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. Comput Oper Res 39(7):1577\u20131581","journal-title":"Comput Oper Res"},{"key":"186_CR47","unstructured":"M\u00fccke S, Piatkowski N, Morik K (2019) Learning bit by bit: extracting the essence of machine learning. In: J\u00e4schke R, Weidlich M (eds) Proceedings of the Conference on \"Lernen, Wissen, Daten, Analysen\". CEUR Workshop Proceedings, vol. 2454, CEUR-WS.org, Berlin, Germany, pp 144\u2013155"},{"key":"186_CR48","doi-asserted-by":"crossref","unstructured":"Niskanen A, J\u00e4rvisalo M (2020) $$\\mu $$-toksia: an efficient abstract argumentation reasoner. In: Proceedings of the 17th International conference on principles of knowledge representation and reasoning, KR, pp 800\u2013804","DOI":"10.24963\/kr.2020\/82"},{"key":"186_CR49","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ijar.2016.07.013","volume":"78","author":"S Nofal","year":"2016","unstructured":"Nofal S, Atkinson K, Dunne PE (2016) Looking-ahead in backtracking algorithms for abstract argumentation. Int J Approx Reason 78:265\u2013282","journal-title":"Int J Approx Reason"},{"issue":"1","key":"186_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(92)90103-5","volume":"57","author":"JL Pollock","year":"1992","unstructured":"Pollock JL (1992) How to reason defeasibly. Artif Intell 57(1):1\u201342","journal-title":"Artif Intell"},{"key":"186_CR51","doi-asserted-by":"crossref","unstructured":"Previti A, J\u00e4rvisalo M (2018) A preference-based approach to backbone computation with application to argumentation. In: Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC, ACM, Pau, France, pp 896\u2013902","DOI":"10.1145\/3167132.3167230"},{"key":"186_CR52","unstructured":"Rosenberg IG (1975) Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle 17:71\u201374"},{"key":"186_CR53","doi-asserted-by":"crossref","unstructured":"Simari GR, Loui RP (1992) A mathematical treatment of defeasible reasoning and its implementation. Artif Intell 53(2\u20133):125\u2013157","DOI":"10.1016\/0004-3702(92)90069-A"},{"key":"186_CR54","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.artint.2017.08.006","volume":"252","author":"M Thimm","year":"2017","unstructured":"Thimm M, Villata S (2017) The first international competition on computational models of argumentation: results and analysis. Artif Intell 252:267\u2013294","journal-title":"Artif Intell"},{"issue":"2","key":"186_CR55","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1080\/00107514.2018.1450720","volume":"59","author":"SE Venegas-Andraca","year":"2018","unstructured":"Venegas-Andraca SE, Cruz-Santos W, McGeoch C, Lanzagorta M (2018) A cross-disciplinary introduction to quantum annealing-based algorithms. Contemp Phys 59(2):174\u2013197","journal-title":"Contemp Phys"},{"key":"186_CR56","unstructured":"Verheij B (1996) Two approaches to dialectical argumentation: admissible sets and argumentation stages. In: Proceedings of the 8th Dutch Conference on Artificial Intelligence (NAIC\u201996), pp 357\u2013368"},{"issue":"Part","key":"186_CR57","doi-asserted-by":"publisher","first-page":"100594","DOI":"10.1016\/j.disopt.2020.100594","volume":"44","author":"A Verma","year":"2022","unstructured":"Verma A, Lewis MW (2022) Penalty and partitioning techniques to improve performance of QUBO solvers. Discret Optim 44(Part):100594","journal-title":"Discret Optim"},{"key":"186_CR58","unstructured":"Vreeswijk G (1991) The feasibility of defeat in defeasible reasoning. In: Proceedings of the 2nd International conference on principles of knowledge representation and reasoning (KR\u201991), Morgan Kaufmann, Cambridge, Massachusetts, USA, pp 526\u2013534"},{"key":"186_CR59","doi-asserted-by":"crossref","unstructured":"Vyskocil T, Djidjev HN (2018) Simple constraint embedding for quantum annealers. In: ICRC,IEEE, McLean, VA, USA, pp 1\u201311","DOI":"10.1109\/ICRC.2018.8638624"},{"key":"186_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5415","volume":"60","author":"JP Wallner","year":"2017","unstructured":"Wallner JP, Niskanen A, J\u00e4rvisalo M (2017) Complexity results and algorithms for extension enforcement in abstract argumentation. J Artif Intell Res 60:1\u201340","journal-title":"J Artif Intell Res"},{"issue":"12","key":"186_CR61","doi-asserted-by":"publisher","first-page":"14870","DOI":"10.1016\/j.eswa.2011.05.060","volume":"38","author":"J Wang","year":"2011","unstructured":"Wang J, Zhou Y, Yin J (2011) Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem. Expert Syst Appl 38(12):14870\u201314881","journal-title":"Expert Syst Appl"},{"issue":"1","key":"186_CR62","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Networks Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Networks Learn Syst"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00186-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-024-00186-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00186-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T16:07:43Z","timestamp":1734970063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-024-00186-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s42484-024-00186-9","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"type":"print","value":"2524-4906"},{"type":"electronic","value":"2524-4914"}],"subject":[],"published":{"date-parts":[[2024,8,26]]},"assertion":[{"value":"3 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"51"}}