{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T11:48:53Z","timestamp":1782215333337,"version":"3.54.5"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:00:00Z","timestamp":1780012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:00:00Z","timestamp":1780012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Research Council of Finland","doi-asserted-by":"publisher","award":["359181"],"award-info":[{"award-number":["359181"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005192","name":"Technical University of Denmark","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005192","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is decomposed into a set of weighted paths from a fixed source node to a fixed sink node that precisely represents the flow distribution across all edges. MFD problems permeate multiple important applications, including reconstructing genomic sequences to representing the flow of goods or passengers in distribution networks. Inspired by these applications, we generalize the MFD to an inexact case with bounded flow values, provide a detailed analysis, and explore different variants that are solvable in polynomial time. Moreover, we introduce the concept of robust flow decomposition by incorporating uncertain bounds and applying different robustness concepts to handle the uncertainty. Finally, we present two different adjustably robust problem formulations and perform computational experiments illustrating the benefit of adjustability.<\/jats:p>","DOI":"10.1007\/s43069-026-00649-8","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:33:48Z","timestamp":1780040028000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Robust Optimization Approach to Flow Decomposition"],"prefix":"10.1007","volume":"7","author":[{"given":"Moritz","family":"Stinzend\u00f6rfer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philine","family":"Schiewe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabricio","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,29]]},"reference":[{"key":"649_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1988) Network flows","DOI":"10.21236\/ADA594171"},{"issue":"2","key":"649_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.22222","volume":"84","author":"O Arslan","year":"2024","unstructured":"Arslan O, Laporte G (2024) Network design with vulnerability constraints and probabilistic edge reliability. Networks 84(2):181\u2013199. https:\/\/doi.org\/10.1002\/net.22222","journal-title":"Networks"},{"key":"649_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Vol 28. Princeton university press","DOI":"10.1515\/9781400831050"},{"issue":"4","key":"649_CR4","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805","journal-title":"Math Oper Res"},{"issue":"2","key":"649_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A et al (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376","journal-title":"Math Program"},{"issue":"3","key":"649_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501","journal-title":"SIAM Rev"},{"issue":"1","key":"649_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"issue":"33-34","key":"649_CR8","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","volume":"196","author":"H-G Beyer","year":"2007","unstructured":"Beyer H-G, Sendhoff B (2007) Robust optimization-a comprehensive survey. Comput Methods Appl Mech Eng 196(33\u201334):3190\u20133218","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"4","key":"649_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s12469-010-0018-5","volume":"1","author":"S Bunte","year":"2009","unstructured":"Bunte S, Kliewer N (2009) An overview on vehicle scheduling models. Public Transport 1(4):299\u2013317","journal-title":"Public Transport"},{"key":"649_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2020.03.009","volume":"136","author":"V Cacchiani","year":"2020","unstructured":"Cacchiani V, Qi J, Yang L (2020) Robust optimization models for integrated train stop planning and timetabling with passenger demand uncertainty. Trans Res Part B Methodol 136:1\u201329","journal-title":"Trans Res Part B Methodol"},{"issue":"3","key":"649_CR11","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ejor.2011.11.003","volume":"219","author":"V Cacchiani","year":"2012","unstructured":"Cacchiani V, Toth P (2012) Nominal and robust train timetabling problems. Eur J Oper Res 219(3):727\u2013737","journal-title":"Eur J Oper Res"},{"key":"649_CR12","doi-asserted-by":"publisher","first-page":"105191","DOI":"10.1016\/j.cor.2020.105191","volume":"128","author":"M Casazza","year":"2021","unstructured":"Casazza M, Ceselli A (2021) Optimization algorithms for resilient path selection in networks. Comput Oper Res 128:105191. https:\/\/doi.org\/10.1016\/j.cor.2020.105191","journal-title":"Comput Oper Res"},{"issue":"4","key":"649_CR13","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato G, Fischetti M (2006) Combinatorial benders\u2019 cuts for mixed-integer linear programming. Oper Res 54(4):756\u2013766. https:\/\/doi.org\/10.1287\/opre.1060.0286","journal-title":"Oper Res"},{"key":"649_CR14","doi-asserted-by":"crossref","unstructured":"Dias FHC, Tomescu AI (2023) Accurate flow decomposition via robust integer linear programming. bioRxiv, pp 2023\u201303","DOI":"10.1101\/2023.03.20.533019"},{"issue":"11","key":"649_CR15","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1089\/cmb.2022.0257","volume":"29","author":"FHC Dias","year":"2022","unstructured":"Dias FHC et al (2022) Efficient minimum flow decomposition via integer linear programming. J Comput Biol 29(11):1252\u20131267","journal-title":"J Comput Biol"},{"issue":"33","key":"649_CR16","first-page":"12","volume":"173","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory 3rd ed. Grad Texts Math 173(33):12","journal-title":"Grad Texts Math"},{"issue":"3","key":"649_CR17","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: an overview. Eur J Oper Res 235(3):471\u2013483","journal-title":"Eur J Oper Res"},{"key":"649_CR18","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to the theory of NP-completeness"},{"key":"649_CR19","doi-asserted-by":"publisher","first-page":"106087","DOI":"10.1016\/j.cor.2022.106087","volume":"151","author":"M Goerigk","year":"2023","unstructured":"Goerigk M, Kurtz J (2023) Data-driven robust optimization using deep neural networks. Comput Oper Res 151:106087","journal-title":"Comput Oper Res"},{"key":"649_CR20","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Tardos E, Tarjan R (1989) Network flow algorithm. Tech. rep. Cornell University Operations Research and Industrial Engineering","DOI":"10.21236\/ADA214689"},{"issue":"10","key":"649_CR21","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1016\/j.tra.2008.03.011","volume":"42","author":"V Guihaire","year":"2008","unstructured":"Guihaire V, Hao J-K (2008) Transit network design and scheduling: A global review. Trans Res Part A Pol Pract 42(10):1251\u20131273","journal-title":"Trans Res Part A Pol Pract"},{"key":"649_CR22","doi-asserted-by":"crossref","unstructured":"Hartman T et al (2012) How to split a flow? In: 2012 Proceedings IEEE INFOCOM. IEEE, pp 828\u2013836","DOI":"10.1109\/INFCOM.2012.6195830"},{"issue":"4","key":"649_CR23","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1111\/j.1467-9574.2005.00303.x","volume":"59","author":"D Huisman","year":"2005","unstructured":"Huisman D et al (2005) Operations research in passenger railway transportation. Stat Neerl 59(4):467\u2013497","journal-title":"Stat Neerl"},{"key":"649_CR24","unstructured":"Kouvelis P, Yu G (2013) Robust discrete optimization and its applications. Vol 14. Springer Science & Business Media"},{"issue":"9","key":"649_CR25","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2012","unstructured":"Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. J Oper Res Soc 63(9):1294\u20131306","journal-title":"J Oper Res Soc"},{"key":"649_CR26","unstructured":"Ley E et al (2023) Robust optimization under controllable uncertainty"},{"issue":"2","key":"649_CR27","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.jnca.2012.12.020","volume":"36","author":"B Li","year":"2013","unstructured":"Li B et al (2013) A survey of network flow applications. J Netw Comput Appl 36(2):567\u2013581","journal-title":"J Netw Comput Appl"},{"issue":"11","key":"649_CR28","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1089\/cmb.2011.0171","volume":"18","author":"W Li","year":"2011","unstructured":"Li W, Feng J, Jiang T (2011) IsoLasso: a LASSO regression approach to RNA-Seq based transcriptome assembly. J Comput Biol 18(11):1693\u20131707","journal-title":"J Comput Biol"},{"issue":"1","key":"649_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.07.044","volume":"266","author":"RM Lusby","year":"2018","unstructured":"Lusby RM, Larsen J, Bull S (2018) A survey on robustness in railway planning. Eur J Oper Res 266(1):1\u201315","journal-title":"Eur J Oper Res"},{"key":"649_CR30","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00291-009-0189-0","volume":"33","author":"RM Lusby","year":"2011","unstructured":"Lusby RM et al (2011) Railway track allocation: models and methods. OR Spectrum 33:843\u2013883","journal-title":"OR Spectrum"},{"issue":"3","key":"649_CR31","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ejor.2024.05.001","volume":"317","author":"Z Mao","year":"2024","unstructured":"Mao Z et al (2024) Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints. Eur J Oper Res 317(3):890\u2013905. https:\/\/doi.org\/10.1016\/j.ejor.2024.05.001","journal-title":"Eur J Oper Res"},{"key":"649_CR32","doi-asserted-by":"publisher","unstructured":"Michels AS et al (2019) A Benders\u2019 decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem. Eur J Oper Res 278(3):796\u2013808. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.001, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221719303844","DOI":"10.1016\/j.ejor.2019.05.001"},{"key":"649_CR33","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"SC Ntafos","year":"1979","unstructured":"Ntafos SC, Hakimi SL (1979) On path cover problems in digraphs and applications to program testing. IEEE Trans Software Eng 5:520\u2013529","journal-title":"IEEE Trans Software Eng"},{"key":"649_CR34","doi-asserted-by":"crossref","unstructured":"Olsen N, Kliewer N, Wolbeck L (2022) A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time\u2013space network models. Central Eur J Oper Res 1\u201337","DOI":"10.1007\/s10100-020-00705-6"},{"key":"649_CR35","doi-asserted-by":"crossref","unstructured":"Orlin J (1988) A faster strongly polynomial minimum cost flow algorithm. In: Proceedings of the Twentieth annual ACM symposium on theory of computing, pp 377\u2013387","DOI":"10.1145\/62212.62249"},{"issue":"4","key":"649_CR36","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1080\/01441647.2015.1113574","volume":"36","author":"J Parbo","year":"2016","unstructured":"Parbo J, Nielsen OA, Prato CG (2016) Passenger perspectives in railway timetabling: a literature review. Transp Rev 36(4):500\u2013526","journal-title":"Transp Rev"},{"issue":"3","key":"649_CR37","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani R et al (2017) The Benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801\u2013817. https:\/\/doi.org\/10.1016\/j.ejor.2016.12.005","journal-title":"Eur J Oper Res"},{"key":"649_CR38","doi-asserted-by":"publisher","unstructured":"Rist Y, Forbes M (2022) A column generation and combinatorial benders decomposition algorithm for the selective dial-a-ride-problem. Comput Oper Res 140:105649. https:\/\/doi.org\/10.1016\/j.cor.2021.105649, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054821003531","DOI":"10.1016\/j.cor.2021.105649"},{"issue":"1","key":"649_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12351-020-00564-8","volume":"22","author":"K Salimifard","year":"2022","unstructured":"Salimifard K, Bigharaz S (2022) The multicommodity network flow problem: state of the art classification, applications, and solution methods. Oper Res Int J 22(1):1\u201347","journal-title":"Oper Res Int J"},{"key":"649_CR40","unstructured":"Schiewe P, Stinzend\u00f6rfer M (2022) Integrated line planning and vehicle scheduling for public transport. In: INOC, pp 1\u20136"},{"key":"649_CR41","unstructured":"Schiewe P et al (2024) LinTim: An integrated environment for mathematical public transport optimization. Coursematerial. https:\/\/nbn-resolving.de\/urn:nbn:de:hbz:386- kluedo-83557"},{"issue":"2","key":"649_CR42","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00186-014-0474-9","volume":"80","author":"A Sch\u00f6bel","year":"2014","unstructured":"Sch\u00f6bel A (2014) Generalized light robustness and the trade-off between robustness and nominal quality. Math Methods Oper Res 80(2):161\u2013191","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"649_CR43","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00291-011-0251-6","volume":"34","author":"A Sch\u00f6bel","year":"2012","unstructured":"Sch\u00f6bel A (2012) Line planning in public transportation: models and methods. OR Spectrum 34(3):491\u2013510","journal-title":"OR Spectrum"},{"issue":"2","key":"649_CR44","first-page":"658","volume":"16","author":"Mingfu Shao and Carl Kingsford","year":"2017","unstructured":"Mingfu Shao and Carl Kingsford (2017) Theory and a heuristic for the minimum path flow decomposition problem. IEEE\/ACM Trans Comput Biol Bioinf 16(2):658\u2013670","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"5","key":"649_CR45","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154\u20131157","journal-title":"Oper Res"},{"issue":"6","key":"649_CR46","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TCBB.2015.2418753","volume":"12","author":"AI Tomescu","year":"2015","unstructured":"Tomescu AI et al (2015) Explaining a weighted DAG with few paths for solving genomeguided multi-assembly. IEEE\/ACM Trans Comput Biol Bioinf 12(6):1345\u20131354","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"3","key":"649_CR47","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1016\/j.ejor.2006.05.043","volume":"185","author":"B Vatinlen","year":"2008","unstructured":"Vatinlen B et al (2008) Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. Eur J Oper Res 185(3):1390\u20131401","journal-title":"Eur J Oper Res"},{"key":"649_CR48","doi-asserted-by":"crossref","unstructured":"Veldhorst M (1993) A bibliography on network flow problems. In: Network optimization problems: algorithms, applications and complexity. World Scientific, pp 301\u2013331","DOI":"10.1142\/9789812798190_0016"},{"key":"649_CR49","doi-asserted-by":"crossref","unstructured":"Wayne KD(1999) A polynomial combinatorial algorithm for generalized minimum cost flow. In: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp 11\u201318","DOI":"10.1145\/301250.301261"},{"key":"649_CR50","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s10957-018-1256-y","volume":"177","author":"H-Z Wei","year":"2018","unstructured":"Wei H-Z, Chen C-R, Li S-J (2018) Characterizations for optimality conditions of general robust optimization problems. J Optim Theory Appl 177:835\u2013856","journal-title":"J Optim Theory Appl"},{"key":"649_CR51","doi-asserted-by":"crossref","unstructured":"Williams L, Reynolds G, Mumey B (2019) RNA transcript assembly using inexact flows. In: 2019 IEEE international conference on bioinformatics and biomedicine (BIBM). IEEE, pp 1907\u20131914","DOI":"10.1109\/BIBM47256.2019.8983180"},{"issue":"3","key":"649_CR52","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1101\/gr.1304504","volume":"14","author":"Y Xing","year":"2004","unstructured":"Xing Y, Resch A, Lee C (2004) The multiassembly problem: reconstructing multiple transcript isoforms from EST fragment mixtures. Genome Res 14(3):426\u2013441","journal-title":"Genome Res"},{"issue":"3","key":"649_CR53","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"\u0130 Yan\u0131ko\u011flu","year":"2019","unstructured":"Yan\u0131ko\u011flu \u0130, Gorissen BL, den Hertog D (2019) A survey of adjustable robust optimization. Eur J Oper Res 277(3):799\u2013813","journal-title":"Eur J Oper Res"},{"issue":"5","key":"649_CR54","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-andconstraint generation method. Oper Res Lett 41(5):457\u2013461","journal-title":"Oper Res Lett"},{"issue":"8","key":"649_CR55","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.cor.2010.11.006","volume":"38","author":"X Zhu","year":"2011","unstructured":"Zhu X et al (2011) Minimal-cost network flow problems with variable lower bounds on arc flows. Comput Oper Res 38(8):1210\u20131218","journal-title":"Comput Oper Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00649-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-026-00649-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00649-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T10:59:01Z","timestamp":1782212341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-026-00649-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,29]]},"references-count":55,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s43069-026-00649-8","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,29]]},"assertion":[{"value":"16 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 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":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"67"}}