{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T06:22:07Z","timestamp":1774938127830,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005639","name":"Universidade De S\u00e3o Paulo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005639","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>As quantum computing rapidly evolves, scaling quantum algorithms to utilize multiple quantum processing units (QPUs) becomes crucial for overcoming the limitations of current noisy intermediate-scale quantum (NISQ) devices. This paper focuses on distributed quantum computing (DQC), specifically targeting the challenges associated with circuit cutting and circuit distribution in multi-QPU environments. By leveraging techniques such as hypergraph partitioning and threading models, this paper presents alternative strategies for dividing and managing both static and adaptive quantum circuits across multiple QPUs. A central research question is how the partitioning and distribution of quantum circuits can be optimized to minimize communication overhead and maximize computational performance in multi-QPU systems, for static and adaptive quantum circuits. To answer this question, a hypergraph partitioning method is proposed to effectively segment large static quantum circuits into manageable subcircuits, ensuring minimal inter-QPU gate operations and reduced time for the partitioning process. Additionally, a co-design threading model is presented, tailored for adaptive quantum circuits. This category of circuits can dynamically adjust their sequence of gates in runtime, based on intermediate measurements and classical control flows, creating unique challenges for circuit partition. Finally, to support the coordination between circuit partitions with static and adaptive circuits, we propose a quantum resource manager (QRM) architecture, bridging the gap between partitioning techniques and practical coordination for a scalable quantum computing system with multi-QPU architecture.<\/jats:p>","DOI":"10.1007\/s11128-026-05136-x","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T04:52:03Z","timestamp":1774932723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Co-design threading model and circuit cutting for static and adaptive quantum circuits"],"prefix":"10.1007","volume":"25","author":[{"given":"Waldemir","family":"Cambiucci","sequence":"first","affiliation":[]},{"given":"Regina Melo","family":"Silveira","sequence":"additional","affiliation":[]},{"given":"Wilson Vicente","family":"Ruggiero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,31]]},"reference":[{"key":"5136_CR1","doi-asserted-by":"crossref","unstructured":"Bandic M, Feld S, Almudever CG (2022) Full-stack quantum computing systems in the NISQ era: algorithm-driven and hardware-aware compilation techniques. In: 2022 design, automation & test in Europe conference & exhibition (DATE) (pp. 1-6). IEEE","DOI":"10.23919\/DATE54114.2022.9774643"},{"key":"5136_CR2","doi-asserted-by":"crossref","unstructured":"Riesebos, L et al. (2022) Modular software for real-time quantum control systems. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, p. 545\u2013555","DOI":"10.1109\/QCE53715.2022.00077"},{"key":"5136_CR3","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.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"issue":"2","key":"5136_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.022317","volume":"89","author":"C Monroe","year":"2014","unstructured":"Monroe, C., et al.: Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects. Phys. Rev. A 89(2), 022317 (2014)","journal-title":"Phys. Rev. A"},{"key":"5136_CR5","doi-asserted-by":"crossref","unstructured":"Loke SW. From distributed quantum computing to quantum internet computing: an Overview. arXiv preprint arXiv:2208.10127, 2022.","DOI":"10.1002\/9781394185542"},{"key":"5136_CR6","doi-asserted-by":"crossref","unstructured":"Yimsiriwattana A, Lomonaco JR, Samuel J. Distributed quantum computing: A distributed Shor algorithm. In: Quantum Information and Computation II. SPIE, 2004. p. 360\u2013372. https:\/\/arxiv.org\/abs\/quant-ph\/0403146.","DOI":"10.1117\/12.546504"},{"key":"5136_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02871-7","volume":"19","author":"Z Davarzani","year":"2020","unstructured":"Davarzani, Z., et al.: A dynamic programming approach for distributing quantum circuits by bipartite graphs. Quantum Inf. Process. 19, 1\u201318 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"12","key":"5136_CR8","doi-asserted-by":"publisher","first-page":"3804","DOI":"10.1007\/s10773-020-04633-8","volume":"59","author":"O Daei","year":"2020","unstructured":"Daei, O., Navi, K., Zomorodi-Moghadam, M.: Optimized quantum circuit partitioning. Int. J. Theor. Phys. 59(12), 3804\u20133820 (2020)","journal-title":"Int. J. Theor. Phys."},{"issue":"4","key":"5136_CR9","doi-asserted-by":"publisher","first-page":"2734","DOI":"10.1109\/TIT.2023.3310797","volume":"70","author":"C Piveteau","year":"2023","unstructured":"Piveteau, C., Sutter, D.: Circuit knitting with classical communication. IEEE Trans. Inform. Theory. 70(4), 2734\u20132745 (2023)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"5136_CR10","doi-asserted-by":"crossref","unstructured":"Barral D. et al. Review of distributed quantum computing. from single qpu to high performance quantum computing. arXiv preprint arXiv:2404.01265, 2024.","DOI":"10.1016\/j.cosrev.2025.100747"},{"key":"5136_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110672","volume":"254","author":"M Caleffi","year":"2024","unstructured":"Caleffi, M., et al.: Distributed quantum computing: a survey. Comput. Netw. 254, 110672 (2024)","journal-title":"Comput. Netw."},{"issue":"3","key":"5136_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032308","volume":"100","author":"P Andres-Martinez","year":"2019","unstructured":"Andres-Martinez, P., Heunen, C.: Automated distribution of quantum circuits via hypergraph partitioning. Phys. Rev. A 100(3), 032308 (2019)","journal-title":"Phys. Rev. A"},{"key":"5136_CR13","unstructured":"Nie J, Zi W, Sun X. Quantum circuit for multi-qubit Toffoli gate with optimal resource. arXiv preprint arXiv:2402.05053, 2024."},{"key":"5136_CR14","volume-title":"Quantum Computation and Quantum Information","author":"Michael Nielsen and Isaac Chuang","year":"2000","unstructured":"Michael Nielsen and Isaac Chuang: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"27","key":"5136_CR15","first-page":"1","volume":"10","author":"S Schlag","year":"2023","unstructured":"Schlag, S., et al.: High-quality hypergraph partitioning. ACM J. Exper. Algorithm. 10(27), 1\u201339 (2023)","journal-title":"ACM J. Exper. Algorithm."},{"key":"5136_CR16","unstructured":"Ouvrard, X. Hypergraphs: an introduction and review. arXiv preprint arXiv:2002.05014, 2020."},{"key":"5136_CR17","unstructured":"Javadi-Abhari, A. et al. Quantum computing with Qiskit. arXiv preprint arXiv:2405.08810, 2024."},{"issue":"1","key":"5136_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1038\/s42005-024-01698-3","volume":"7","author":"M Iqbal","year":"2024","unstructured":"Iqbal, M., et al.: Topological order from measurements and feed-forward on a trapped ion quantum computer. Commun. Phys. 7(1), 205 (2024)","journal-title":"Commun. Phys."},{"key":"5136_CR19","unstructured":"Foss-Feig, M. et al. Experimental demonstration of the advantage of adaptive quantum circuits. arXiv preprint arXiv:2302.03029, 2023."},{"issue":"5","key":"5136_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s11128-023-03927-0","volume":"22","author":"X Cheng","year":"2023","unstructured":"Cheng, X., Chen, X., Cao, K., Zhu, P., Feng, S., Guan, Z.: Optimization of the transmission cost of distributed quantum circuits based on merged transfer. Quant. Inform. Proc. 22(5), 187 (2023)","journal-title":"Quant. Inform. Proc."},{"key":"5136_CR21","doi-asserted-by":"crossref","unstructured":"Hayashi, A. et al. Enabling Multi-threading in Heterogeneous Quantum-Classical Programming Models. In: 2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2023. p. 509\u2013516.","DOI":"10.1109\/IPDPSW59300.2023.00090"},{"key":"5136_CR22","doi-asserted-by":"publisher","DOI":"10.1145\/3380964","author":"TM Mintz","year":"2020","unstructured":"Mintz, T.M., McCaskey, A.J., Dumitrescu, E.F., Moore, S.V., Powers, S., Lougovski, P.: Qcor: a language extension specification for the heterogeneous quantum-classical model of computation. J. Emerg. Technol. Comput. Syst. (2020). https:\/\/doi.org\/10.1145\/3380964","journal-title":"J. Emerg. Technol. Comput. Syst."},{"key":"5136_CR23","doi-asserted-by":"crossref","unstructured":"Burt F, Chen KC, Leung KK. Generalised circuit partitioning for distributed quantum computing. arXiv preprint arXiv:2408.01424, 2024.","DOI":"10.1109\/QCE60285.2024.10273"},{"key":"5136_CR24","unstructured":"Pawar, A. et al. Integrated qubit reuse and circuit cutting for large quantum circuit evaluation. arXiv preprint arXiv:2312.10298, 2023."},{"key":"5136_CR25","doi-asserted-by":"crossref","unstructured":"Perlin, MA. et al. Quantum circuit cutting with maximum likelihood tomography. arXiv preprint arXiv:2005.12702, 2020.","DOI":"10.1038\/s41534-021-00390-6"},{"key":"5136_CR26","unstructured":"Majumdar, R. and Christopher J. Wood. \u201cError mitigated quantum circuit cutting.\u201d (2022)."},{"key":"5136_CR27","doi-asserted-by":"publisher","unstructured":"G. Uchehara, T. M. Aamodt and O. Di Matteo, \"Rotation-inspired circuit cut optimization,\" 2022 IEEE\/ACM Third International Workshop on Quantum Computing Software (QCS), Dallas, TX, USA, 2022, pp. 50\u201356, https:\/\/doi.org\/10.1109\/QCS56647.2022.00011.","DOI":"10.1109\/QCS56647.2022.00011"},{"key":"5136_CR28","doi-asserted-by":"crossref","unstructured":"Hart, M., & McAllister, J. (2024). Quantum circuit cutting minimising loss of qubit entanglement. In CF \u201824: Proceedings of the 21st ACM International Conference on Computing Frontiers (pp. 207 - 214).","DOI":"10.1145\/3649153.3649189"},{"key":"5136_CR29","doi-asserted-by":"crossref","unstructured":"Li, Peiyi et al. Enhancing Virtual Distillation with Circuit Cutting for Quantum Error Mitigation. In: 2023 IEEE 41st International Conference on Computer Design (ICCD). IEEE, 2023. p. 94\u2013101.","DOI":"10.1109\/ICCD58817.2023.00024"},{"key":"5136_CR30","doi-asserted-by":"crossref","unstructured":"Kan, S. et al. Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System. arXiv preprint arXiv:2405.04514, 2024.","DOI":"10.1109\/QCE60285.2024.00127"},{"issue":"4","key":"5136_CR31","doi-asserted-by":"publisher","first-page":"279","DOI":"10.22331\/q-2020-06-04-279","volume":"4","author":"R Duncan","year":"2020","unstructured":"Duncan, R., et al.: Graph-theoretic simplification of quantum circuits with the ZX-calculus. Quantum 4(4), 279 (2020)","journal-title":"Quantum"},{"key":"5136_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2024.112085","volume":"214","author":"S Basu","year":"2024","unstructured":"Basu, S., et al.: FragQC: an efficient quantum error reduction technique using quantum circuit fragmentation. J. Syst. Softw. 214, 112085 (2024)","journal-title":"J. Syst. Softw."},{"key":"5136_CR33","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-03-02-934","volume":"7","author":"A Lowe","year":"2023","unstructured":"Lowe, A., et al.: Fast quantum circuit cutting with randomized measurements. Quantum 7, 934 (2023)","journal-title":"Quantum"},{"key":"5136_CR34","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1007\/s10773-017-3618-x","volume":"57","author":"M Zomorodi-Moghadam","year":"2018","unstructured":"Zomorodi-Moghadam, M., Houshmand, M., Houshmand, M.: Optimizing teleportation cost in distributed quantum circuits. Int. J. Theor. Phys. 57, 848\u2013861 (2018)","journal-title":"Int. J. Theor. Phys."},{"key":"5136_CR35","unstructured":"Wang Y., Kleinberg, J. From graphs to hypergraphs: Hypergraph projection and its remediation. arXiv preprint arXiv:2401.08519, 2024."},{"key":"5136_CR36","doi-asserted-by":"crossref","unstructured":"Mcsherry, F. (2001). Spectral partitioning of random graphs. Proceedings 2001 IEEE International Conference on Cluster Computing, 529\u2013537.","DOI":"10.1109\/SFCS.2001.959929"},{"issue":"2","key":"5136_CR37","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW kernighan","year":"1970","unstructured":"kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970). https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x","journal-title":"Bell Syst. Tech. J."},{"key":"5136_CR38","unstructured":"Karypis, G. & Kumar, V. (1995). METIS - Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0."},{"key":"5136_CR39","doi-asserted-by":"crossref","unstructured":"Pirani M, Mitra A, Sundaram S. A survey of graph-theoretic approaches for analyzing the resilience of networked control systems. arXiv preprint arXiv:2205.12498, 2022.","DOI":"10.1016\/j.automatica.2023.111264"},{"issue":"2","key":"5136_CR40","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5136_CR41","doi-asserted-by":"publisher","unstructured":"Reeves, C. (2003). Genetic Algorithms. In: Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 57. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/0-306-48056-5_3","DOI":"10.1007\/0-306-48056-5_3"},{"issue":"4","key":"5136_CR42","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997). https:\/\/doi.org\/10.1145\/263867.263872","journal-title":"J. ACM"},{"key":"5136_CR43","doi-asserted-by":"crossref","unstructured":"Frick A, Ludwig A, Mehldau H (1994) A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration). In: International symposium on graph drawing (pp. 388-403). Berlin, Springer Berlin Heidelberg","DOI":"10.1007\/3-540-58950-3_393"},{"issue":"1","key":"5136_CR44","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"5136_CR45","doi-asserted-by":"crossref","unstructured":"Schlag, S. et al. K-way hypergraph partitioning via n-level recursive bisection. In: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2016. p. 53\u201367. https:\/\/arxiv.org\/abs\/1511.03137.","DOI":"10.1137\/1.9781611974317.5"},{"key":"5136_CR46","doi-asserted-by":"publisher","unstructured":"Fiduccia CM, Mattheyses RM (1982) A Linear-Time Heuristic for Improving Network Partitions,\" 19th Design Automation Conference, pp. 175\u2013181, https:\/\/doi.org\/10.1109\/DAC.1982.1585498.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"5136_CR47","doi-asserted-by":"crossref","unstructured":"Umur Acikalin U, Caskurlu B. Multilevel memetic hypergraph partitioning with greedy recombination. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. 2022. p. 168\u2013171. https:\/\/arxiv.org\/abs\/2204.03730.","DOI":"10.1145\/3520304.3529050"},{"issue":"1","key":"5136_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-9260(00)00008-0","volume":"30","author":"W-K Mak","year":"2000","unstructured":"Mak, W.-K., Wong, D.F.: A fast hypergraph min-cut algorithm for circuit partitioning. Integration 30(1), 1\u201311 (2000). https:\/\/doi.org\/10.1016\/S0167-9260(00)00008-0. (ISSN 0167-9260)","journal-title":"Integration"},{"key":"5136_CR49","doi-asserted-by":"crossref","unstructured":"Crampton, O. et al. A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution. arXiv preprint arXiv:2405.05875, 2024.","DOI":"10.32604\/jqc.2025.061275"},{"key":"5136_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-4851-2_30","volume-title":"Next Generation Information Processing System","author":"SV Patil","year":"2021","unstructured":"Patil, S.V., Kulkarni, D.B.: Graph partitioning using heuristic kernighan-lin algorithm for parallel computing. In: Deshpande, P., Abraham, A., Iyer, B., Ma, K. (eds.) Next Generation Information Processing System. Advances in Intelligent Systems and Computing, Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-4851-2_30"},{"key":"5136_CR51","unstructured":"Fang, K. et al. Dynamic quantum circuit compilation. arXiv preprint arXiv:2310.11021, 2023."},{"issue":"5","key":"5136_CR52","first-page":"1","volume":"26","author":"S Brandhofer","year":"2023","unstructured":"Brandhofer, S., Polian, I., Krsulich, K.: Optimal partitioning of quantum circuits using gate cuts and wire cuts. IEEE Trans. Quant. Eng. 26(5), 1 (2023)","journal-title":"IEEE Trans. Quant. Eng."},{"key":"5136_CR53","unstructured":"Cross, AW. et al. Open quantum assembly language. arXiv preprint arXiv:1707.03429, 2017."},{"issue":"3","key":"5136_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505636","volume":"3","author":"A Cross","year":"2022","unstructured":"Cross, A., et al.: OpenQASM 3: a broader and deeper quantum assembly language. ACM Trans. Quantum Comput. 3(3), 1\u201350 (2022)","journal-title":"ACM Trans. Quantum Comput."},{"key":"5136_CR55","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-07-20-1062","volume":"7","author":"N Quetschlich","year":"2023","unstructured":"Quetschlich, N., Burgholzer, L., Wille, R.: MQT Bench: benchmarking software and design automation tools for quantum computing. Quantum 7, 1062 (2023)","journal-title":"Quantum"},{"key":"5136_CR56","doi-asserted-by":"publisher","unstructured":"Baker JM, Duckering C, Hoover A, Chong FT (2020) Time-sliced quantum circuit partitioning for modular architectures. In Proceedings of the 17th ACM International Conference on Computing Frontiers (CF \u201820). Association for Computing Machinery, New York, pp. 98\u2013107. https:\/\/doi.org\/10.1145\/3387902.3392617.","DOI":"10.1145\/3387902.3392617"},{"issue":"1","key":"5136_CR57","doi-asserted-by":"publisher","DOI":"10.1145\/3655029","volume":"6","author":"P Escofet","year":"2025","unstructured":"Escofet, P., Ovide, A., Bandic, M., Prielinger, L., van Someren, H., Feld, S., Alarcon, E., Abadal, S., Almudever, C.: Revisiting the mapping of quantum circuits: entering the multi-core era. ACM Trans. Quantum Comput. 6(1), Article 4 (2025). https:\/\/doi.org\/10.1145\/3655029","journal-title":"ACM Trans. Quantum Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05136-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05136-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05136-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T04:52:13Z","timestamp":1774932733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05136-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,31]]},"references-count":57,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["5136"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05136-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,31]]},"assertion":[{"value":"17 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","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":"118"}}