{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:10:45Z","timestamp":1783609845223,"version":"3.55.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST111-2221-E-131-012"],"award-info":[{"award-number":["MOST111-2221-E-131-012"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST111-2221-E-262-004"],"award-info":[{"award-number":["MOST111-2221-E-262-004"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["111-2221-E-141-007"],"award-info":[{"award-number":["111-2221-E-141-007"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST111-2221-E-141-006"],"award-info":[{"award-number":["MOST111-2221-E-141-006"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04825-5","type":"journal-article","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T07:03:00Z","timestamp":1663830180000},"page":"4126-4145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting"],"prefix":"10.1007","volume":"79","author":[{"given":"Kung-Jui","family":"Pai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"issue":"5","key":"4825_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.282556","volume":"5","author":"S Lee","year":"1994","unstructured":"Lee S, Shin K (1994) Interleaved all-to-all reliable broadcast on meshes and hypercubes. IEEE Trans Parallel Distrib Syst 5(5):449\u2013458","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4825_CR2","volume-title":"Introduction to parallel algorithms and architecture: arrays, trees, Hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architecture: arrays, trees, Hypercubes. Morgan Kaufmann, San Mateo, Calif"},{"issue":"6","key":"4825_CR3","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TPDS.2011.245","volume":"23","author":"T-J Lin","year":"2012","unstructured":"Lin T-J, Hsieh S-Y, Juan JS-T (2012) Embedding cycles and paths in product networks and their applications to multiprocessor systems. IEEE Trans Parallel Distrib Syst 23(6):1081\u20131089","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"4825_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.sysarc.2004.11.001","volume":"51","author":"N-C Wang","year":"2005","unstructured":"Wang N-C, Yen C-P, Chu C-P (2005) Multicast communication in wormhole-routed symmetric networks with Hamiltonian cycle model. J Syst Arch 51(3):165\u2013183","journal-title":"J Syst Arch"},{"issue":"10","key":"4825_CR5","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/TC.2003.1234525","volume":"52","author":"MM Bae","year":"2003","unstructured":"Bae MM, Bose B (2003) Edge disjoint Hamiltonian cycles in $$k$$-ary $$n$$-cubes and hypercubes. IEEE Trans Comput 52(10):1271\u20131284","journal-title":"IEEE Trans Comput"},{"key":"4825_CR6","doi-asserted-by":"crossref","unstructured":"Rowley R, Bose B (1991) Edge disjoint Hamiltonian cycles in de Bruijn networks. In: Proceedings of the 6th Distributed Memory Computing Conference, Portland, USA, pp 707\u2013709","DOI":"10.1109\/DMCC.1991.633359"},{"issue":"2","key":"4825_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s11464-009-0017-5","volume":"4","author":"J-M Xu","year":"2009","unstructured":"Xu J-M, Ma M (2009) A survey on cycle and path embedding in some networks. Front Math China 4(2):217\u2013252","journal-title":"Front Math China"},{"key":"4825_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"4","key":"4825_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(94)00087-5","volume":"51","author":"D Barth","year":"1994","unstructured":"Barth D, Raspaud A (1994) Two edge-disjoint Hamiltonian cycles in the butterfly graph. Inf Process Lett 51(4):175\u2013179","journal-title":"Inf Process Lett"},{"issue":"1","key":"4825_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TC.2015.2409843","volume":"65","author":"B Albader","year":"2016","unstructured":"Albader B, Bose B (2016) Edge disjoint Hamiltonian cycles in Gaussian networks. IEEE Trans Comput 65(1):315\u2013321","journal-title":"IEEE Trans Comput"},{"key":"4825_CR11","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2011.05.004","volume":"412","author":"R-W Hung","year":"2011","unstructured":"Hung R-W (2011) Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Theor Comput Sci 412:4747\u20134753","journal-title":"Theor Comput Sci"},{"key":"4825_CR12","doi-asserted-by":"crossref","unstructured":"Li S-Y, Chang J-M, Pai K-J (2020) A parallel algorithm for constructing two edge-disjoint hamiltonian cycles in locally twisted cubes. In: Proceedings of International Computer Conference (ICS 2020), Tainan, Taiwan, 17\u201319 Dec, pp 116\u2013119","DOI":"10.1109\/ICS51289.2020.00032"},{"key":"4825_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ipl.2018.12.004","volume":"144","author":"H L\u00fc","year":"2019","unstructured":"L\u00fc H, Wu T (2019) Edge-disjoint Hamiltonian cycles of balanced hypercubes. Inf Process Lett 144:25\u201330","journal-title":"Inf Process Lett"},{"issue":"1","key":"4825_CR14","first-page":"42","volume":"39","author":"R-W Hung","year":"2012","unstructured":"Hung R-W (2012) Constructing two edge-disjoint Hamiltonian cycles and two-equal path cover in augmented cubes. IAENG Int\u2019l J Comput Sci 39(1):42\u201349","journal-title":"IAENG Int\u2019l J Comput Sci"},{"key":"4825_CR15","unstructured":"Hung R-W, Chan S-J, Liao C-C (2012) Embedding two edge disjoint Hamiltonian cycles and two equal node disjoint cycles into twisted cubes. In: Proceedings of International Multi-Conference Engineers and Computer Scientists (IMECS 2012), Hong Kong, 14\u20136 Mar, pp 362\u2013367"},{"key":"4825_CR16","first-page":"2248","volume":"336\u2013338","author":"Y Wang","year":"2013","unstructured":"Wang Y, Fan J, Liu W, Wang X (2013) Embedding two edge-disjoint Hamiltonian cycles into parity cubes. Appl Mech Mater 336\u2013338:2248\u20132251","journal-title":"Appl Mech Mater"},{"key":"4825_CR17","doi-asserted-by":"crossref","unstructured":"Pai K-J (2020) A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes. In: Proceedings of 14th International Conference on Algorithmic Applications in Management (AAIM 2020). Lecture Notes in Computer Science, 12290: 448\u2013455","DOI":"10.1007\/978-3-030-57602-8_40"},{"key":"4825_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dam.2014.09.006","volume":"181","author":"R-W Hung","year":"2015","unstructured":"Hung R-W (2015) The property of edge disjoint Hamiltonian cycles in transposition networks and hypercube like networks. Discrete Appl Math 181:109\u2013122","journal-title":"Discrete Appl Math"},{"key":"4825_CR19","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2015.08.003","volume":"86","author":"ZA Hussain","year":"2015","unstructured":"Hussain ZA, Bose B, Al-Dhelaan A (2015) Edge disjoint Hamiltonian cycles in Eisenstein-Jacobi networks. J Parallel Distrib Comput 86:62\u201370","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"4825_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/jgt.20120","volume":"51","author":"V Petrovic","year":"2006","unstructured":"Petrovic V, Thomassen C (2006) Edge disjoint Hamiltonian cycles in hypertournaments. J Graph Theory 51(1):49\u201352","journal-title":"J Graph Theory"},{"key":"4825_CR21","unstructured":"Huang C-H, Fang J-F, Yang C-Y (2004) Edge-disjoint Hamiltonian cycles of WK-recursive networks. In: Proceedings of 7th International Workshop on Applied Parallel Computing (PARA 2004). Lecture Notes in Computer Science, 3732: 1009\u20131104"},{"issue":"2","key":"4825_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/TC.2012.192","volume":"63","author":"ZA Hussain","year":"2014","unstructured":"Hussain ZA, Bose B, Al-Dhelaan A (2014) Generalized hypercubes: edge-disjoint Hamiltonian cycles and Gray codes. IEEE Trans Comput 63(2):375\u2013382","journal-title":"IEEE Trans Comput"},{"issue":"12","key":"4825_CR23","doi-asserted-by":"publisher","first-page":"2116","DOI":"10.1587\/transinf.2015PAP0019","volume":"E98\u2013D","author":"H-C Chen","year":"2015","unstructured":"Chen H-C, Kung T-L, Zou Y-H, Mao H-W (2015) The fault-tolerant Hamiltonian problems of crossed cube with path faults. IEICE Trans Infom Syst E98\u2013D(12):2116\u20132122","journal-title":"IEICE Trans Infom Syst"},{"issue":"6","key":"4825_CR24","first-page":"1359","volume":"E85\u2013A","author":"W-T Huang","year":"2002","unstructured":"Huang W-T, Chuang Y-C, Tan JJ-M, Hsu L-H (2002) On the fault-tolerant Hamiltonicity of faulty crossed cubes. IEICE Trans Fundam Electron Commun Comput Sci E85\u2013A(6):1359\u20131370","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"3","key":"4825_CR25","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1109\/TPDS.2007.70729","volume":"19","author":"D Wang","year":"2008","unstructured":"Wang D (2008) On embedding hamiltonian cycles in crossed cubes. IEEE Trans Parallel Distrib Syst 19(3):334\u2013346","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"4825_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/S0129054121500167","volume":"32","author":"X Xu","year":"2021","unstructured":"Xu X, Zhang H, Wang Z, Zhang Q, Zhang P (2021) ($$n-2$$)-fault-tolerant edge-pancyclicity of crossed cubes $$CQ_n$$. Int J Found Comput Sci 32(3):289\u2013304","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"4825_CR27","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s11227-008-0232-y","volume":"49","author":"J-S Fu","year":"2009","unstructured":"Fu J-S, Hung H-S, Chen G-H (2009) Embedding fault-free cycles in crossed cubes with conditional link faults. J Supercomput 49(2):219\u2013233","journal-title":"J Supercomput"},{"key":"4825_CR28","doi-asserted-by":"publisher","first-page":"5664","DOI":"10.1016\/j.ins.2007.05.032","volume":"177","author":"H-S Hung","year":"2007","unstructured":"Hung H-S, Fu J-S, Chen G-H (2007) Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Inf Sci 177:5664\u20135674","journal-title":"Inf Sci"},{"issue":"6","key":"4825_CR29","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1007\/s11227-018-2295-8","volume":"74","author":"H-C Chen","year":"2018","unstructured":"Chen H-C (2018) The panpositionable panconnectedness of crossed cubes. J Supercomput 74(6):2638\u20132655","journal-title":"J Supercomput"},{"issue":"24","key":"4825_CR30","first-page":"10058","volume":"217","author":"H-C Chen","year":"2011","unstructured":"Chen H-C, Kung T-L, Hsu L-H (2011) Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions. Appl Math Comput 217(24):10058\u201310065","journal-title":"Appl Math Comput"},{"issue":"12","key":"4825_CR31","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.ipl.2014.06.015","volume":"114","author":"J-M Chang","year":"2014","unstructured":"Chang J-M, Wang J-D, Yang J-S, Pai K-J (2014) A comment on \u201cindependent spanning trees in crossed cubes\u2019\u2019. Inf Process Lett 114(12):734\u2013739","journal-title":"Inf Process Lett"},{"issue":"5","key":"4825_CR32","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.jpdc.2013.01.009","volume":"73","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Wang J (2013) Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes. J Parallel Distrib Comput 73(5):641\u2013652","journal-title":"J Parallel Distrib Comput"},{"key":"4825_CR33","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ins.2013.01.010","volume":"233","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Zhang S (2013) Independent spanning trees in crossed cubes. Inf Sci 233:276\u2013289","journal-title":"Inf Sci"},{"key":"4825_CR34","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.future.2018.02.010","volume":"87","author":"B Cheng","year":"2018","unstructured":"Cheng B, Fan J, Lyu Q, Zhou J, Liu Z (2018) Constructing independent spanning trees with height $$n$$ on the $$n$$-dimensional crossed cube. Future Gener Comput Syst 87:404\u2013415","journal-title":"Future Gener Comput Syst"},{"key":"4825_CR35","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"B Cheng","year":"2017","unstructured":"Cheng B, Wang D, Fan J (2017) Constructing completely independent spanning trees in crossed cubes. Discrete Appl Math 219:100\u2013109","journal-title":"Discrete Appl Math"},{"key":"4825_CR36","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2016.08.024","volume":"652","author":"K-J Pai","year":"2016","unstructured":"Pai K-J, Chang J-M (2016) Constructing two completely independent spanning trees in hypercube-variant networks. Theor Comput Sci 652:28\u201337","journal-title":"Theor Comput Sci"},{"key":"4825_CR37","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2019.03.035","volume":"784","author":"K-J Pai","year":"2019","unstructured":"Pai K-J, Chang R-S, Wu R-Y, Chang J-M (2019) A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor Comput Sci 784:65\u201374","journal-title":"Theor Comput Sci"},{"key":"4825_CR38","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ins.2020.05.048","volume":"541","author":"K-J Pai","year":"2020","unstructured":"Pai K-J, Chang R-S, Wu R-Y, Chang J-M (2020) Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf Sci 541:516\u2013530","journal-title":"Inf Sci"},{"issue":"1","key":"4825_CR39","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1007\/s11227-021-03872-8","volume":"78","author":"X Wang","year":"2022","unstructured":"Wang X, Fan J, Zhang S, Yu J (2022) Node-to-set disjoint paths problem in cross-cubes. J Supercomput 78(1):1356\u20131380","journal-title":"J Supercomput"},{"issue":"10","key":"4825_CR40","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/TPDS.2002.1041887","volume":"13","author":"J Fan","year":"2002","unstructured":"Fan J (2002) Diagnosability of crossed cubes under the comparison diagnosis model. IEEE Trans Parallel Distrib Syst 13(10):1099\u20131104","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4825_CR41","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2018.06.046","volume":"755","author":"J Guo","year":"2019","unstructured":"Guo J, Li D, Lu M (2019) The $$g$$-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model. Theor Comput Sci 755:81\u201388","journal-title":"Theor Comput Sci"},{"issue":"1","key":"4825_CR42","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/71.824643","volume":"11","author":"C-P Chang","year":"2000","unstructured":"Chang C-P, Sung T-Y, Hsu L-H (2000) Edge congestion and topological properties of crossed cubes. IEEE Trans Parallel Distrib Syst 11(1):64\u201380","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"12","key":"4825_CR43","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1016\/0167-8191(94)90130-9","volume":"20","author":"K Efe","year":"1994","unstructured":"Efe K, Blackwell PK, Slough W, Shiau T (1994) Topological properties of the crossed cube architecture. Parallel Comput 20(12):1763\u20131775","journal-title":"Parallel Comput"},{"issue":"5","key":"4825_CR44","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe K (1992) The crossed cube architecture for parallel computation. IEEE Trans Parallel Distrib Syst 3(5):513\u2013524","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"4825_CR45","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"P Fragopoulou","year":"1996","unstructured":"Fragopoulou P, Akl SG (1996) Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans Comput 45(2):174\u2013185","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"4825_CR46","first-page":"139","volume":"E83\u2013A","author":"Y-S Chen","year":"2000","unstructured":"Chen Y-S, Juang T-Y, Tseng E-H (2000) Efficient broadcasting in an arrangement graph using multiple spanning trees. IEICE Trans Fundam Electron Commun Comput Sci E83\u2013A(1):139\u2013149","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"4825_CR47","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.dam.2011.04.014","volume":"159","author":"J-S Yang","year":"2011","unstructured":"Yang J-S, Chan H-C, Chang J-M (2011) Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discrete Appl Math 159:1254\u20131263","journal-title":"Discrete Appl Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04825-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04825-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04825-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T00:17:56Z","timestamp":1674951476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04825-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,22]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4825"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04825-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,22]]},"assertion":[{"value":"7 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2022","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}