{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:26:40Z","timestamp":1771547200534,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:00:00Z","timestamp":1721865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:00:00Z","timestamp":1721865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CINECA, ISCRA","award":["HP10CU89SO"],"award-info":[{"award-number":["HP10CU89SO"]}]},{"name":"ICSC - National Research Centre in High Performance Computing, Big Data and Quantum Computing"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The field of Quantum Computing has gathered significant popularity in recent years and a large number of papers have studied its effectiveness in tackling many tasks. We focus in particular on Quantum Annealing (QA), a meta-heuristic solver for Quadratic Unconstrained Binary Optimization (QUBO) problems. It is known that the effectiveness of QA is dependent on the task itself, as is the case for classical solvers, but there is not yet a clear understanding of which are the characteristics of a problem that make it difficult to solve with QA. In this work, we propose a new methodology to study the effectiveness of QA based on meta-learning models. To do so, we first build a dataset composed of more than five thousand instances of ten different optimization problems. We define a set of more than a hundred features to describe their characteristics and solve them with both QA and three classical solvers. We publish this dataset online for future research. Then, we train multiple meta-models to predict whether QA would solve that instance effectively and use them to probe which features with the strongest impact on the effectiveness of QA. Our results indicate that it is possible to accurately predict the effectiveness of QA, validating our methodology. Furthermore, we observe that the distribution of the problem coefficients representing the bias and coupling terms is very informative in identifying the probability of finding good solutions, while the density of these coefficients alone is not enough. The methodology we propose allows to open new research directions to further our understanding of the effectiveness of QA, by probing specific dimensions or by developing new QUBO formulations that are better suited for the particular nature of QA. Furthermore, the proposed methodology is flexible and can be extended or used to study other quantum or classical solvers.<\/jats:p>","DOI":"10.1007\/s42484-024-00179-8","type":"journal-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:02:41Z","timestamp":1721901761000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing the effectiveness of quantum annealing with meta-learning"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0435-0264","authenticated-orcid":false,"given":"Riccardo","family":"Pellini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7103-2788","authenticated-orcid":false,"given":"Maurizio","family":"Ferrari Dacrema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,25]]},"reference":[{"key":"179_CR1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash T, Lidar DA (2018) Adiabatic quantum computation. Rev Mod Phys 90:015002. https:\/\/doi.org\/10.1103\/RevModPhys.90.015002","journal-title":"Adiabatic quantum computation. Rev Mod Phys"},{"key":"179_CR2","doi-asserted-by":"publisher","unstructured":"Boothby K, Bunyk P, Raymond J, Roy A (2020) Next-generation topology of d-wave quantum processors. https:\/\/doi.org\/10.48550\/arXiv.2003.00133","DOI":"10.48550\/arXiv.2003.00133"},{"key":"179_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01343193","volume":"51","author":"M Born","year":"1928","unstructured":"Born M, Fock V (1928) Beweis des adiabatensatzes. Zeitschrift f\u00fcr Physik 51:165\u2013180","journal-title":"Beweis des adiabatensatzes. Zeitschrift f\u00fcr Physik"},{"key":"179_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10100-014-0350-y","volume":"24","author":"I Brezina","year":"2016","unstructured":"Brezina I, Pek\u00e1r J, \u010ci\u010dkov\u00e1 Z, Reiff M (2016) Herfindahl\u2013Hirschman index level of concentration values modification and analysis of their change. CEJOR 24:49\u201372. https:\/\/doi.org\/10.1007\/s10100-014-0350-y","journal-title":"CEJOR"},{"key":"179_CR5","doi-asserted-by":"publisher","unstructured":"Bukhari F, Nurdiati S, Najib M, Safiqri N (2022) Formulation of sudoku puzzle using binary integer linear programming and its implementation in Julia, Python, and Minizinc. Jambura J Math 4. https:\/\/doi.org\/10.34312\/jjom.v4i2.14194","DOI":"10.34312\/jjom.v4i2.14194"},{"key":"179_CR6","doi-asserted-by":"publisher","unstructured":"Cai J, Macready WG, Roy A (2014) A practical heuristic for finding graph minors. arXiv e-prints arXiv:1406.2741. https:\/\/doi.org\/10.48550\/arXiv.1406.2741","DOI":"10.48550\/arXiv.1406.2741"},{"key":"179_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1365\/s13291-022-00247-7","volume":"124","author":"J Carmesin","year":"2022","unstructured":"Carmesin J (2022) Graph theory \u2013 a survey on the occasion of the Abel prize for l\u00e1szl\u00f3 lov\u00e1sz. Jahresber Deutsch Math-Verein 124:83\u2013108. https:\/\/doi.org\/10.1365\/s13291-022-00247-7","journal-title":"Jahresber Deutsch Math-Verein"},{"key":"179_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11265-018-1357-8","volume":"91","author":"G Chapuis","year":"2019","unstructured":"Chapuis G, Djidjev H, Hahn G, Rizk G (2019) Finding maximum cliques on the d-wave quantum annealer. J Signal Process Syst 91:363\u2013377. https:\/\/doi.org\/10.1007\/s11265-018-1357-8","journal-title":"J Signal Process Syst"},{"key":"179_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","volume":"7","author":"V Choi","year":"2008","unstructured":"Choi V (2008) Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf Process 7:193\u2013209. https:\/\/doi.org\/10.1007\/s11128-008-0082-9","journal-title":"Quantum Inf Process"},{"key":"179_CR10","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1890\/0012-9658(2000)081[1139:DIIPSO]2.0.CO;2","volume":"81","author":"C Damgaard","year":"2000","unstructured":"Damgaard C, Weiner J (2000) Describing inequality in plant size or fecundity. Ecology 81:1139\u20131142. https:\/\/doi.org\/10.1890\/0012-9658(2000)081[1139:DIIPSO]2.0.CO;2","journal-title":"Ecology"},{"key":"179_CR11","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. http:\/\/arxiv.org\/abs\/1411.4028"},{"key":"179_CR12","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution. https:\/\/arxiv.org\/abs\/quant-ph\/0001106"},{"key":"179_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s41313-021-00032-6","volume":"6","author":"DA Fedorov","year":"2022","unstructured":"Fedorov DA, Peng B, Govind N, Alexeev Y (2022) VQE method: a short survey and recent developments. Materials Theory 6:2. https:\/\/doi.org\/10.1186\/s41313-021-00032-6","journal-title":"Materials Theory"},{"key":"179_CR14","doi-asserted-by":"publisher","unstructured":"Ferrari Dacrema M et\u00a0al (2022) Towards feature selection for ranking and classification exploiting quantum annealers. In: Amig\u00f3 E et\u00a0al (eds) SIGIR \u201922: the 45th International ACM SIGIR conference on research and development in information retrieval, Madrid, Spain, July 11 - 15, 2022. ACM, pp 2814\u20132824. https:\/\/doi.org\/10.1145\/3477495.3531755","DOI":"10.1145\/3477495.3531755"},{"key":"179_CR15","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/3434185","volume":"39","author":"M Ferrari Dacrema","year":"2021","unstructured":"Ferrari Dacrema M, Boglio S, Cremonesi P, Jannach D (2021) A troubling analysis of reproducibility and progress in recommender systems research. ACM Trans Inf Syst 39:20:1-20:49. https:\/\/doi.org\/10.1145\/3434185","journal-title":"ACM Trans Inf Syst"},{"key":"179_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover F, Kochenberger G, Hennig R, Du Y (2022) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Ann Oper Res 314:141\u2013183. https:\/\/doi.org\/10.1007\/s10479-022-04634-2","journal-title":"Ann Oper Res"},{"key":"179_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ab85b8","volume":"83","author":"P Hauke","year":"2020","unstructured":"Hauke P, Katzgraber HG, Lechner W, Nishimori H, Oliver WD (2020) Perspectives of quantum annealing: methods and implementations. Rep Prog Phys 83:054401. https:\/\/doi.org\/10.1088\/1361-6633\/ab85b8","journal-title":"Rep Prog Phys"},{"key":"179_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11128-017-1586-y","volume":"16","author":"M Hernandez","year":"2017","unstructured":"Hernandez M, Aramon M (2017) Enhancing quantum annealing performance for the molecular similarity problem. Quantum Inf Process 16:133. https:\/\/doi.org\/10.1007\/s11128-017-1586-y","journal-title":"Quantum Inf Process"},{"key":"179_CR19","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.1109\/TC.2022.3219257","volume":"72","author":"T Huang","year":"2023","unstructured":"Huang T et al (2023) Benchmarking quantum(-inspired) annealing hardware on practical use cases. IEEE Trans Computers 72:1692\u20131705. https:\/\/doi.org\/10.1109\/TC.2022.3219257","journal-title":"IEEE Trans Computers"},{"key":"179_CR20","doi-asserted-by":"publisher","unstructured":"Ikeda K, Nakamura Y, Humble TS (2019) Application of quantum annealing to nurse scheduling problem. Sci Rep 9. https:\/\/doi.org\/10.1038\/s41598-019-49172-3","DOI":"10.1038\/s41598-019-49172-3"},{"key":"179_CR21","doi-asserted-by":"publisher","first-page":"624","DOI":"10.22331\/q-2022-01-18-624","volume":"6","author":"B Irsigler","year":"2022","unstructured":"Irsigler B, Grass T (2022) The quantum annealing gap and quench dynamics in the exact cover problem. Quantum 6:624. https:\/\/doi.org\/10.22331\/q-2022-01-18-624","journal-title":"Quantum"},{"key":"179_CR22","doi-asserted-by":"publisher","first-page":"104165","DOI":"10.1109\/ACCESS.2023.3318206","volume":"11","author":"J Jiang","year":"2023","unstructured":"Jiang J, Chu C (2023) Classifying and benchmarking quantum annealing algorithms based on quadratic unconstrained binary optimization for solving np-hard problems. IEEE Access 11:104165\u2013104178. https:\/\/doi.org\/10.1109\/ACCESS.2023.3318206","journal-title":"IEEE Access"},{"key":"179_CR23","doi-asserted-by":"publisher","unstructured":"Katzgraber HG, Hamze F, Andrist RS (2014) Glassy chimeras could be blind to quantum speedup: designing better benchmarks for quantum annealing machines. Phys Rev X 4. https:\/\/doi.org\/10.1103\/PhysRevX.4.021008","DOI":"10.1103\/PhysRevX.4.021008"},{"key":"179_CR24","unstructured":"King AD et\u00a0al (2024) Computational supremacy in quantum simulation. arXiv e-prints arXiv:2403.00910"},{"key":"179_CR25","doi-asserted-by":"publisher","unstructured":"Kumar V, Bass G, Tomlin C, III JD (2018) Quantum annealing for combinatorial clustering. Quantum Inf Process 17:39. https:\/\/doi.org\/10.1007\/s11128-017-1809-2","DOI":"10.1007\/s11128-017-1809-2"},{"key":"179_CR26","doi-asserted-by":"publisher","unstructured":"Lucas A (2014) Ising formulations of many np problems. Front Phys 2. https:\/\/doi.org\/10.3389\/fphy.2014.00005","DOI":"10.3389\/fphy.2014.00005"},{"key":"179_CR27","doi-asserted-by":"publisher","unstructured":"Mandr\u00e0 S, Zhu Z, Wang W, Perdomo-Ortiz A, Katzgraber HG (2016) Strengths and weaknesses of weak-strong cluster problems: a detailed overview of state-of-the-art classical heuristics versus quantum approaches. Phys Rev A 94. https:\/\/doi.org\/10.1103\/PhysRevA.94.022337","DOI":"10.1103\/PhysRevA.94.022337"},{"key":"179_CR28","doi-asserted-by":"publisher","unstructured":"Micheletti C, Hauke P, Faccioli P (2021) Polymer physics by quantum computing. Phys Rev Lett 127. https:\/\/doi.org\/10.1103\/PhysRevLett.127.080501","DOI":"10.1103\/PhysRevLett.127.080501"},{"key":"179_CR29","doi-asserted-by":"publisher","unstructured":"Mirkarimi P, Hoyle DC, Williams R, Chancellor N (2024) Experimental demonstration of improved quantum optimization with linear Ising penalties. https:\/\/doi.org\/10.48550\/arXiv.2404.05476","DOI":"10.48550\/arXiv.2404.05476"},{"key":"179_CR30","doi-asserted-by":"publisher","DOI":"10.1063\/1.2995837","volume":"49","author":"S Morita","year":"2008","unstructured":"Morita S, Nishimori H (2008) Mathematical foundation of quantum annealing. J Math Phys 49:125210. https:\/\/doi.org\/10.1063\/1.2995837","journal-title":"J Math Phys"},{"key":"179_CR31","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1038\/nature24047","volume":"550","author":"A Mott","year":"2017","unstructured":"Mott A, Job J, Vlimant JR, Lidar D, Spiropulu M (2017) Solving a Higgs optimization problem with quantum annealing for machine learning. Nature 550:375\u2013379. https:\/\/doi.org\/10.1038\/nature24047","journal-title":"Nature"},{"key":"179_CR32","doi-asserted-by":"publisher","unstructured":"Negre CF, Ushijima-Mwesigwa H, Mniszewski SM (2020) Detecting multiple communities using quantum annealing on the d-wave system. PLoS ONE 15. https:\/\/doi.org\/10.1371\/journal.pone.0227538","DOI":"10.1371\/journal.pone.0227538"},{"key":"179_CR33","doi-asserted-by":"publisher","unstructured":"Nembrini R, Carugno C, Ferrari Dacrema M, Cremonesi P (2022) Towards recommender systems with community detection and quantum computing. In: Golbeck J et\u00a0al (eds) RecSys \u201922: Sixteenth ACM conference on recommender systems, Seattle, WA, USA, September 18 - 23, 2022. ACM, pp 579\u2013585. https:\/\/doi.org\/10.1145\/3523227.3551478","DOI":"10.1145\/3523227.3551478"},{"key":"179_CR34","doi-asserted-by":"publisher","unstructured":"Nembrini R, Ferrari Dacrema M, Cremonesi P (2021) Feature selection for recommender systems with quantum computing. Entropy 23(8):970. https:\/\/doi.org\/10.3390\/e23080970","DOI":"10.3390\/e23080970"},{"key":"179_CR35","doi-asserted-by":"crossref","unstructured":"Neukart F, Dollen DV, Seidel C (2018) Quantum-assisted cluster anal-\u00a0ysis on a quantum annealing device. Front Phys 6. https:\/\/www.frontiersin.org\/articles\/10.3389\/fphy.2018.00055","DOI":"10.3389\/fphy.2018.00055"},{"key":"179_CR36","doi-asserted-by":"publisher","unstructured":"Neukart F, Von Dollen D, Seidel C, Compostella G (2018) Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces. Front Phys 5. https:\/\/doi.org\/10.3389\/fphy.2017.00071","DOI":"10.3389\/fphy.2017.00071"},{"key":"179_CR37","unstructured":"Neven H, Denchev VS, Rose G, Macready WG (2009) Training a large scale classifier with the quantum adiabatic algorithm. CoRR abs\/0912.0779, http:\/\/arxiv.org\/abs\/0912.0779"},{"key":"179_CR38","doi-asserted-by":"crossref","unstructured":"Ohzeki M (2020) Breaking limitation of quantum annealer in solving optimization problems under constraints. CoRR abs\/2002.05298. https:\/\/arxiv.org\/abs\/2002.05298","DOI":"10.1038\/s41598-020-60022-5"},{"key":"179_CR39","unstructured":"O\u2019Malley D, Vesselinov VV, Alexandrov BS, Alexandrov LB (2017) Nonnegative\/binary matrix factorization with a d-wave quantum annealer. CoRR abs\/1704.01605. http:\/\/arxiv.org\/abs\/1704.01605"},{"key":"179_CR40","doi-asserted-by":"publisher","unstructured":"Ottaviani D, Amendola A (2018) Low rank non-negative matrix factorization with d-wave 2000q. https:\/\/doi.org\/10.48550\/arXiv.1808.08721","DOI":"10.48550\/arXiv.1808.08721"},{"key":"179_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-014-0892-x","volume":"14","author":"EG Rieffel","year":"2015","unstructured":"Rieffel EG et al (2015) A case study in programming a quantum annealer for hard operational planning problems. Quantum Inf Process 14:1\u201336. https:\/\/doi.org\/10.1007\/s11128-014-0892-x","journal-title":"Quantum Inf Process"},{"key":"179_CR42","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379\u2013423. https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst Tech J"},{"key":"179_CR43","doi-asserted-by":"publisher","unstructured":"Shehzad F, Jannach D (2023) Everyone\u2019s a winner! on hyperparameter tuning of recommendation models. In: Zhang J et\u00a0al (eds) Proceedings of the 17th ACM conference on recommender systems, RecSys 2023, Singapore, September 18-22, 2023. ACM, pp 652\u2013657. https:\/\/doi.org\/10.1145\/3604915.3609488","DOI":"10.1145\/3604915.3609488"},{"key":"179_CR44","doi-asserted-by":"publisher","unstructured":"Snoek J, Larochelle H, Adams RP (2012) Practical Bayesian optimization of machine learning algorithms. https:\/\/doi.org\/10.48550\/arXiv.1206.2944","DOI":"10.48550\/arXiv.1206.2944"},{"key":"179_CR45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.72.014303","volume":"72","author":"L Stella","year":"2005","unstructured":"Stella L, Santoro GE, Tosatti E (2005) Optimization by quantum annealing: lessons from simple cases. Phys Rev B 72:014303. https:\/\/doi.org\/10.1103\/PhysRevB.72.014303","journal-title":"Phys Rev B"},{"key":"179_CR46","doi-asserted-by":"publisher","unstructured":"Stollenwerk T, Lobe E, Jung M (2017) Flight gate assignment with a quantum annealer. In: Feld S, Linnhoff-Popien C (eds) Quantum technology and optimization problems - first international workshop, QTOP@NetSys 2019, Munich, Germany, March 18, 2019, Proceedings, vol 11413 of Lecture Notes in Computer Science. Springer, pp 99\u2013110. https:\/\/doi.org\/10.1007\/978-3-030-14082-3_9","DOI":"10.1007\/978-3-030-14082-3_9"},{"key":"179_CR47","doi-asserted-by":"publisher","unstructured":"Streif M, Neukart F, Leib M (2019) Solving quantum chemistry problems with a d-wave quantum annealer. https:\/\/doi.org\/10.48550\/arXiv.1811.05256","DOI":"10.48550\/arXiv.1811.05256"},{"key":"179_CR48","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s12530-020-09345-2","volume":"12","author":"AH Victoria","year":"2021","unstructured":"Victoria AH, Maragatham G (2021) Automatic tuning of hyperparameters using Bayesian optimization. Evol Syst 12:217\u2013223. https:\/\/doi.org\/10.1007\/s12530-020-09345-2","journal-title":"Evol Syst"},{"key":"179_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2019.107006","volume":"248","author":"D Willsch","year":"2020","unstructured":"Willsch D, Willsch M, Raedt HD, Michielsen K (2020) Support vector machines on the d-wave quantum annealer. Comput Phys Commun 248:107006. https:\/\/doi.org\/10.1016\/j.cpc.2019.107006","journal-title":"Comput Phys Commun"},{"key":"179_CR50","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1021\/acs.jpcb.7b10371","volume":"122","author":"R Xia","year":"2018","unstructured":"Xia R, Bian T, Kais S (2018) Electronic structure calculations and the Ising Hamiltonian. J Phys Chem B 122:3384\u20133395. https:\/\/doi.org\/10.1021\/acs.jpcb.7b10371","journal-title":"J Phys Chem B"},{"key":"179_CR51","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54","volume":"85","author":"S Yarkoni","year":"2022","unstructured":"Yarkoni S, Raponi E, B\u00e4ck T, Schmitt S (2022) Quantum annealing for industry applications: introduction and review. Rep Prog Phys 85:104001. https:\/\/doi.org\/10.1088\/1361-6633\/ac8c54","journal-title":"Rep Prog Phys"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00179-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-024-00179-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00179-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T16:06:46Z","timestamp":1734970006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-024-00179-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,25]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s42484-024-00179-8","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,25]]},"assertion":[{"value":"14 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 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":"48"}}