{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:59:29Z","timestamp":1775815169577,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["ONISQ"],"award-info":[{"award-number":["ONISQ"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"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 quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. Optimal QAOA parameter concentration effects for special MaxCut problem instances have been observed, but a rigorous study of the subject is still lacking. Due to clustering of optimal QAOA parameters for MaxCut, successful parameter transferability between different MaxCut instances can be explained and predicted based on local properties of the graphs, including the type of subgraphs (lightcones) from which graphs are composed as well as the overall degree of nodes in the graph (parity). In this work, we apply five different graph embedding techniques to determine good donor candidates for parameter transferability, including parameter transferability between different classes of MaxCut instances. Using this technique, we effectively reduce the number of iterations required for parameter optimization, obtaining an approximate solution to the target problem with an order of magnitude speedup. This procedure also effectively removes the problem of encountering barren plateaus during the variational optimization of parameters. Additionally, our findings demonstrate that the transferred parameters maintain effectiveness when subjected to noise, supporting their use in real-world quantum applications. This work presents a framework for identifying classes of combinatorial optimization instances for which optimal donor candidates can be predicted such that QAOA can be substantially accelerated under both ideal and noisy conditions.<\/jats:p>","DOI":"10.1007\/s42484-024-00178-9","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T06:01:50Z","timestamp":1721628110000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Graph representation learning for parameter transferability in quantum approximate optimization algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Jose","family":"Falla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quinn","family":"Langfitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Alexeev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"key":"178_CR1","doi-asserted-by":"crossref","unstructured":"Akshay V, Rabinovich D, Campos E, Biamonte J (2021) Parameter concentration in quantum approximate optimization. arXiv:2103.11976","DOI":"10.1103\/PhysRevA.104.L010401"},{"key":"178_CR2","doi-asserted-by":"publisher","unstructured":"Alexeev Y, Bacon D, Brown KR, Calderbank R, Carr LD, Chong FT, DeMarco B, Englund D, Farhi E, Fefferman B, Gorshkov AV, Houck A, Kim J, Kimmel S, Lange M, Lloyd S, Lukin MD, Maslov D, Maunz P, Monroe C, Preskill J, Roetteler M, Savage MJ, Thompson J (2021) Quantum computer systems for scientific discovery. PRX Quantum 2(1). https:\/\/doi.org\/10.1103\/prxquantum.2.017001","DOI":"10.1103\/prxquantum.2.017001"},{"key":"178_CR3","doi-asserted-by":"publisher","unstructured":"Anschuetz ER, Kiani BT (2022) Beyond barren plateaus: quantum variational algorithms are swamped with traps. Nat Commun 13(1):7760. https:\/\/doi.org\/10.1038\/s41467-022-35364-5. arXiv:2205.05786 [quant-ph]. Accessed 30 Apr 2023","DOI":"10.1038\/s41467-022-35364-5"},{"key":"178_CR4","unstructured":"Bach B, Falla J, Safro I (2024) MLQAOA: graph learning accelerated hybrid quantum-classical multilevel QAOA. arXiv. arXiv:2404.14399 [physics, physics:quant-ph]. Accessed 27 May 2024"},{"key":"178_CR5","unstructured":"Biamonte J, Bergholm V (2017) Tensor networks in a nutshell. arXiv:1708.00006 Accessed 27 Apr 2023"},{"key":"178_CR6","doi-asserted-by":"publisher","unstructured":"Borgwardt KM, Kriegel H (2005) Shortest-path kernels on graphs. In: Fifth IEEE international conference on data mining (ICDM\u201905), pp 74\u201381. IEEE, Houston, TX, USA. https:\/\/doi.org\/10.1109\/ICDM.2005.132. http:\/\/ieeexplore.ieee.org\/document\/1565664\/ Accessed 12 Oct 2023","DOI":"10.1109\/ICDM.2005.132"},{"key":"178_CR7","unstructured":"Brandao FG, Broughton M, Farhi E, Gutmann S, Neven H (2018) For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances. arXiv:1812.04170"},{"key":"178_CR8","doi-asserted-by":"publisher","unstructured":"Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637. https:\/\/doi.org\/10.1109\/TKDE.2018.2807452. Accessed 2023-10-11","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"178_CR9","doi-asserted-by":"crossref","unstructured":"Cai Z, Babbush R, Benjamin SC, Endo S, Huggins WJ, Li Y, McClean JR, O\u2019Brien TE (2023) Quantum error mitigation","DOI":"10.1103\/RevModPhys.95.045005"},{"key":"178_CR10","unstructured":"Cai C, Wang Y (2022) A simple yet effective baseline for non-attributed graph classification. arXiv:1811.03508 [cs, stat]. Accessed 11 Oct 2023"},{"key":"178_CR11","unstructured":"Ceroni J, Stetina TF, Kieferova M, Marrero CO, Arrazola JM, Wiebe N (2023) Generating approximate ground states of molecules using quantum machine learning. arXiv. arXiv:2210.05489 [quant-ph]. Accessed 27 May 2024"},{"issue":"2","key":"178_CR12","doi-asserted-by":"publisher","first-page":"020329","DOI":"10.1103\/PRXQuantum.2.020329","volume":"2","author":"A Cervera-Lierta","year":"2021","unstructured":"Cervera-Lierta A, Kottmann JS, Aspuru-Guzik A (2021) Meta-variational quantum eigensolver: learning energy profiles of parameterized Hamiltonians for quantum simulation. PRX Quantum 2(2):020329. https:\/\/doi.org\/10.1103\/PRXQuantum.2.020329","journal-title":"PRX Quantum"},{"key":"178_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-36718-3_1","volume-title":"Neural Information Processing","author":"H Chen","year":"2019","unstructured":"Chen H, Koga H (2019) Gl2vec: graph embedding enriched by line graphs with edge features. In: Gedeon T, Wong KW, Lee M (eds) Neural Information Processing. Springer, Cham, pp 3\u201314"},{"key":"178_CR14","unstructured":"Ding F, Zhang X, Sybrandt J, Safro I (2020) Unsupervised hierarchical graph representation learning by mutual information maximization. ACM KDD 2020 workshop on mining and learning with graphs. arXiv:2003.08420"},{"key":"178_CR15","doi-asserted-by":"crossref","unstructured":"Egger DJ, Marecek J, Woerner S (2020) Warm-starting quantum optimization","DOI":"10.22331\/q-2021-06-17-479"},{"key":"178_CR16","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"key":"178_CR17","doi-asserted-by":"publisher","unstructured":"Galda A, Gupta E, Falla J, Liu X, Lykov D, Alexeev Y, Safro I (2023) Similarity-based parameter transferability in the quantum approximate optimization algorithm. Front Quantum Sci Technol 2:1200975. https:\/\/doi.org\/10.3389\/frqst.2023.1200975. Accessed 2023-08-21","DOI":"10.3389\/frqst.2023.1200975"},{"key":"178_CR18","doi-asserted-by":"crossref","unstructured":"Galda A, Liu X, Lykov D, Alexeev Y, Safro I (2021) Transferability of optimal QAOA parameters between random graphs. In: 2021 IEEE international conference on quantum computing and engineering (QCE), pp 171\u2013180. IEEE","DOI":"10.1109\/QCE52317.2021.00034"},{"key":"178_CR19","unstructured":"Galland A, Lelarge M (2019) Invariant embedding for graph classification. In: ICML 2019 workshop on learning and reasoning with graph-structured data"},{"key":"178_CR20","unstructured":"Gao F, Wolf G, Hirn M (2019) Geometric scattering for graph data analysis. In: Proceeding of the 36th international conference on machine learning"},{"key":"178_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner T, Flach P, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. In: Sch\u00f6lkopf B, Warmuth MK (eds) Learning Theory and Kernel Machines. Springer, Berlin, Heidelberg, pp 129\u2013143"},{"key":"178_CR22","doi-asserted-by":"publisher","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl-Based Syst 151:78\u201394. https:\/\/doi.org\/10.1016\/j.knosys.2018.03.022. arXiv:1705.02801 [physics]. Accessed 11 Oct 2023","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"178_CR23","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. arXiv. arXiv:1607.00653 [cs, stat]. Accessed 11 Oct 2023","DOI":"10.1145\/2939672.2939754"},{"key":"178_CR24","unstructured":"Gurobi\u00a0Optimization L (2021) Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"issue":"8","key":"178_CR25","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/s42254-023-00603-1","volume":"5","author":"D Herman","year":"2023","unstructured":"Herman D, Googin C, Liu X, Sun Y, Galda A, Safro I, Pistoia M, Alexeev Y (2023) Quantum computing for finance. Nat Rev Phys 5(8):450\u2013465","journal-title":"Nat Rev Phys"},{"key":"178_CR26","doi-asserted-by":"crossref","unstructured":"Joseph I, Shi Y, Porter M, Castelli A, Geyko V, Graziani F, Libby S, DuBois J (2023) Quantum computing for fusion energy science applications. Phys Plasmas 30(1)","DOI":"10.1063\/5.0123765"},{"key":"178_CR27","doi-asserted-by":"publisher","unstructured":"Kardashin A, Uvarov A, Biamonte J (2021) Quantum machine learning tensor network states. Front Phys 8:586374. https:\/\/doi.org\/10.3389\/fphy.2020.586374. Accessed 27 Apr 2023","DOI":"10.3389\/fphy.2020.586374"},{"key":"178_CR28","doi-asserted-by":"crossref","unstructured":"Khairy S, Shaydulin R, Cincio L, Alexeev Y, Balaprakash P (2020) Learning to optimize variational quantum circuits to solve combinatorial problems. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 2367\u20132375","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"178_CR29","doi-asserted-by":"crossref","unstructured":"Kulshrestha A, Safro I (2022) Beinit: avoiding barren plateaus in variational quantum algorithms. In: 2022 IEEE international conference on quantum computing and engineering (QCE), pp 197\u2013203. IEEE","DOI":"10.1109\/QCE53715.2022.00039"},{"key":"178_CR30","unstructured":"Lara N, Pineau E (2018) A simple baseline algorithm for graph classification. arXiv. arXiv:1810.09155 [cs, stat]. Accessed 12 Oct 2023"},{"key":"178_CR31","unstructured":"Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: Xing EP, Jebara T (eds) Proceedings of the 31st International conference on machine learning. Proceedings of machine learning research, vol 32, pp 1188\u20131196. PMLR, Bejing, China. https:\/\/proceedings.mlr.press\/v32\/le14.html"},{"key":"178_CR32","doi-asserted-by":"crossref","unstructured":"Liu X, Shaydulin R, Safro I (2022) Quantum approximate optimization algorithm with sparsified phase operator. In: 2022 IEEE international conference on quantum computing and engineering (QCE), pp 133\u2013141. IEEE","DOI":"10.1109\/QCE53715.2022.00032"},{"key":"178_CR33","unstructured":"Lykov D, Galda A, Alexeev Y (2021) QTensor. GitHub"},{"key":"178_CR34","unstructured":"Narayanan A, Chandramohan M, Venkatesan R, Chen L, Liu Y, Jaiswal S (2017) graph2vec: learning distributed representations of graphs. arXiv. arXiv:1707.05005 [cs]. Accessed 30 Apr 2023"},{"issue":"1","key":"178_CR35","first-page":"1481","volume":"11","author":"C Outeiral","year":"2021","unstructured":"Outeiral C, Strahm M, Shi J, Morris GM, Benjamin SC, Deane CM (2021) The prospects of quantum computing in computational molecular biology. Wiley Interdiscip Rev: Comput Mol Sci 11(1):1481","journal-title":"Wiley Interdiscip Rev: Comput Mol Sci"},{"key":"178_CR36","doi-asserted-by":"publisher","unstructured":"Qiu Z, Shaydulin R, Liu X, Alexeev Y, Henry CS, Safro I (2021) ELRUNA: elimination rule-based network alignment. ACM J Exp Algorithmics 26. https:\/\/doi.org\/10.1145\/3450703","DOI":"10.1145\/3450703"},{"key":"178_CR37","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Kiss O, Sarkar R (2020) Karate Club: an API oriented open-source python framework for unsupervised learning on graphs. In: Proceedings of the 29th ACM international conference on information and knowledge management (CIKM \u201920), pp 3125\u20133132. ACM","DOI":"10.1145\/3340531.3412757"},{"key":"178_CR38","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. arXiv. arXiv:2005.07959 [cs, stat]. Accessed 12 Oct 2023","DOI":"10.1145\/3340531.3411866"},{"key":"178_CR39","unstructured":"Rozemberczki B, Sarkar R (2020) Fast sequence-based embedding with diffusion graphs. arXiv. arXiv:2001.07463 [cs, stat]. Accessed 11 Oct 2023"},{"issue":"6","key":"178_CR40","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MC.2019.2908942","volume":"52","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin R, Ushijima-Mwesigwa H, Negre CF, Safro I, Mniszewski SM, Alexeev Y (2019) A hybrid approach for solving optimization problems on small quantum computers. Computer 52(6):18\u201326","journal-title":"Computer"},{"issue":"9","key":"178_CR41","doi-asserted-by":"publisher","first-page":"1900029","DOI":"10.1002\/qute.201900029","volume":"2","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin R, Ushijima-Mwesigwa H, Safro I, Mniszewski S, Alexeev Y (2019) Network community detection on small quantum computers. Adv Quantum Technol 2(9):1900029","journal-title":"Adv Quantum Technol"},{"key":"178_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03298-4","volume":"20","author":"R Shaydulin","year":"2021","unstructured":"Shaydulin R, Hadfield S, Hogg T, Safro I (2021) Classical symmetries and the quantum approximate optimization algorithm. Quantum Inf Process 20:1\u201328","journal-title":"Quantum Inf Process"},{"key":"178_CR43","doi-asserted-by":"publisher","unstructured":"Shaydulin R, Alexeev Y (2019) Evaluating quantum approximate optimization algorithm: a case study. In: 2019 Tenth International green and sustainable computing conference (IGSC), pp 1\u20136. https:\/\/doi.org\/10.1109\/IGSC48788.2019.8957201","DOI":"10.1109\/IGSC48788.2019.8957201"},{"key":"178_CR44","doi-asserted-by":"crossref","unstructured":"Shaydulin R, Safro I, Larson J (2019) Multistart methods for quantum approximate optimization. In: 2019 IEEE high performance extreme computing conference (HPEC), pp 1\u20138. IEEE","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"178_CR45","unstructured":"Shervashidze N (2011) Weisfeiler-Lehman Graph Kernels. J Mach Learn Res"},{"issue":"3","key":"178_CR46","doi-asserted-by":"publisher","first-page":"034008","DOI":"10.1088\/2058-9565\/ab8c2b","volume":"5","author":"M Streif","year":"2020","unstructured":"Streif M, Leib M (2020) Training the quantum approximate optimization algorithm without access to a quantum processing unit. Quantum Sci Technol 5(3):034008","journal-title":"Quantum Sci Technol"},{"key":"178_CR47","unstructured":"Sybrandt J, Safro I (2020) FOBE and HOBE: first-and high-order bipartite embeddings. ACM KDD 2020 workshop on mining and learning with graphs. arXiv:1905.10953"},{"key":"178_CR48","doi-asserted-by":"publisher","unstructured":"Tsitsulin A, Mottin D, Karras P, Bronstein A, M\u00fcller E (2018) Netlsd: hearing the shape of a graph. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. KDD \u201918, pp 2347\u20132356. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3219819.3219991","DOI":"10.1145\/3219819.3219991"},{"key":"178_CR49","unstructured":"Tsvelikhovskiy B, Safro I, Alexeev Y (2023) Of representation theory and quantum approximate optimization algorithm. arXiv:2309.13787"},{"issue":"1","key":"178_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3425607","volume":"2","author":"H Ushijima-Mwesigwa","year":"2021","unstructured":"Ushijima-Mwesigwa H, Shaydulin R, Negre CF, Mniszewski SM, Alexeev Y, Safro I (2021) Multilevel combinatorial optimization across quantum architectures. ACM Trans Quantum Comput 2(1):1\u201329","journal-title":"ACM Trans Quantum Comput"},{"key":"178_CR51","unstructured":"Verma S, Zhang Z-L (2017) Hunt for the unique, stable, sparse and fast feature learning on graphs. Advances in Neural Information Processing Systems 30"},{"key":"178_CR52","doi-asserted-by":"publisher","unstructured":"Wang S, Fontana E, Cerezo M, Sharma K, Sone A, Cincio L, Coles PJ (2021) Noise-induced barren plateaus in variational quantum algorithms. Nat Commun 12(1):6961. https:\/\/doi.org\/10.1038\/s41467-021-27045-6. Accessed 30 Apr 2023","DOI":"10.1038\/s41467-021-27045-6"},{"key":"178_CR53","doi-asserted-by":"publisher","unstructured":"Wang L, Huang C, Ma W, Cao X, Vosoughi S (2021) Graph embedding via diffusion-wavelets-based node feature distribution characterization. In: Proceedings of the 30th ACM international conference on information & knowledge management, pp 3478\u20133482. ACM, Virtual Event Queensland Australia. https:\/\/doi.org\/10.1145\/3459637.3482115. https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482115 Accessed 11 Oct 2023","DOI":"10.1145\/3459637.3482115"},{"issue":"6684","key":"178_CR54","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"2","key":"178_CR55","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.orl.2004.03.010","volume":"33","author":"GJ Woeginger","year":"2005","unstructured":"Woeginger GJ (2005) Combinatorial approximation algorithms: a comparative review. Oper Res Lett 33(2):210\u2013215. https:\/\/doi.org\/10.1016\/j.orl.2004.03.010","journal-title":"Oper Res Lett"},{"key":"178_CR56","doi-asserted-by":"publisher","unstructured":"Wurtz J, Love P (2021) MaxCut quantum approximate optimization algorithm performance guarantees for p> 1. Phys Rev A 103(4):042612. https:\/\/doi.org\/10.1103\/PhysRevA.103.042612. Accessed 2023-11-17","DOI":"10.1103\/PhysRevA.103.042612"},{"key":"178_CR57","doi-asserted-by":"publisher","unstructured":"Yanardag P, Vishwanathan SVN (2015) Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1365\u20131374. ACM, Sydney NSW Australia. https:\/\/doi.org\/10.1145\/2783258.2783417. https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783417 Accessed 05 Oct 2023","DOI":"10.1145\/2783258.2783417"},{"key":"178_CR58","doi-asserted-by":"publisher","unstructured":"Yang D, Rosso P, Li B, Cudre-Mauroux P (2019) NodeSketch: highly-efficient graph embeddings via recursive sketching. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1162\u20131172. ACM, Anchorage AK USA. https:\/\/doi.org\/10.1145\/3292500.3330951. https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330951 Accessed 11 Oct 2023","DOI":"10.1145\/3292500.3330951"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00178-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-024-00178-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-00178-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T16:05:10Z","timestamp":1734969910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-024-00178-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s42484-024-00178-9","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"17 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 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":"46"}}