{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:58:19Z","timestamp":1775599099766,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LZ23F020012"],"award-info":[{"award-number":["LZ23F020012"]}]},{"name":"Guangxi Science and Technology Major Program","award":["AA22068067"],"award-info":[{"award-number":["AA22068067"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172119"],"award-info":[{"award-number":["62172119"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20467"],"award-info":[{"award-number":["U21A20467"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2702901"],"award-info":[{"award-number":["2022YFB2702901"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["Z220001"],"award-info":[{"award-number":["Z220001"]}]},{"name":"Guangxi Key Laboratory of Trusted Software","award":["KX202329"],"award-info":[{"award-number":["KX202329"]}]},{"name":"Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies","award":["2022B1212010005"],"award-info":[{"award-number":["2022B1212010005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11280-024-01324-w","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T02:52:09Z","timestamp":1737427929000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DyBFT: leaderless BFT protocol based on locally adjustable valid committee set mechanism"],"prefix":"10.1007","volume":"28","author":[{"given":"Donglin","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianhong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changsong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Decun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"1324_CR1","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"1324_CR2","unstructured":"Wood, G.: Ethereum: A secure decentralised generalised transaction ledger, vol. 151, pp. 1\u201332 (2014). https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf"},{"issue":"1","key":"1324_CR3","doi-asserted-by":"publisher","first-page":"486","DOI":"10.3390\/encyclopedia2010031","volume":"2","author":"S Mystakidis","year":"2022","unstructured":"Mystakidis, S.: Metaverse. Encyclopedia 2(1), 486\u2013497 (2022). https:\/\/doi.org\/10.3390\/encyclopedia2010031","journal-title":"Metaverse. Encyclopedia"},{"issue":"5","key":"1324_CR4","doi-asserted-by":"publisher","first-page":"8076","DOI":"10.1109\/JIOT.2019.2920987","volume":"6","author":"H-N Dai","year":"2019","unstructured":"Dai, H.-N., Zheng, Z., Zhang, Y.: Blockchain for internet of things: A survey. IEEE Internet Things J. 6(5), 8076\u20138094 (2019). https:\/\/doi.org\/10.1109\/JIOT.2019.2920987","journal-title":"IEEE Internet Things J."},{"issue":"3","key":"1324_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tbench.2022.100073","volume":"2","author":"M Javaid","year":"2022","unstructured":"Javaid, M., Haleem, A., Singh, R.P., Suman, R., Khan, S.: A review of blockchain technology applications for financial services. BenchCouncil Transactions on Benchmarks, Standards and Evaluations 2(3), 100073 (2022). https:\/\/doi.org\/10.1016\/j.tbench.2022.100073","journal-title":"BenchCouncil Transactions on Benchmarks, Standards and Evaluations"},{"key":"1324_CR6","doi-asserted-by":"publisher","unstructured":"Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., Muralidharan, S., Murthy, C., Nguyen, B., Sethi, M., Singh, G., Smith, K., Sorniotti, A., Stathakopoulou, C., Vukoli\u0107, M., Cocco, S.W., Yellick, J.: Hyperledger fabric: A distributed operating system for permissioned blockchains (2018). https:\/\/doi.org\/10.1145\/3190508.3190538","DOI":"10.1145\/3190508.3190538"},{"key":"1324_CR7","doi-asserted-by":"publisher","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: Scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles. SOSP \u201917, pp. 51\u201368. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"key":"1324_CR8","doi-asserted-by":"publisher","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: Bft consensus with linearity and responsiveness, pp. 347\u2013356 (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"},{"issue":"12","key":"1324_CR9","doi-asserted-by":"publisher","first-page":"3452","DOI":"10.1109\/JSAC.2022.3213306","volume":"40","author":"W Wang","year":"2022","unstructured":"Wang, W., Yang, Y., Yin, Z., Dev, K., Zhou, X., Li, X., Qureshi, N.M.F., Su, C.: Bsif: Blockchain-based secure, interactive, and fair mobile crowdsensing. IEEE J. Sel. Areas Commun. 40(12), 3452\u20133469 (2022). https:\/\/doi.org\/10.1109\/JSAC.2022.3213306","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"1324_CR10","doi-asserted-by":"publisher","first-page":"9547","DOI":"10.1109\/JIOT.2023.3324543","volume":"11","author":"W Wang","year":"2024","unstructured":"Wang, W., Han, Z., Gadekallu, T.R., Raza, S., Tanveer, J., Su, C.: Lightweight blockchain-enhanced mutual authentication protocol for uavs. IEEE Internet Things J. 11(6), 9547\u20139557 (2024). https:\/\/doi.org\/10.1109\/JIOT.2023.3324543","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"1324_CR11","doi-asserted-by":"publisher","first-page":"3770","DOI":"10.1109\/TCE.2024.3372506","volume":"70","author":"R Li","year":"2024","unstructured":"Li, R., Wang, Z., Fang, L., Peng, C., Wang, W., Xiong, H.: Efficient blockchain-assisted distributed identity-based signature scheme for integrating consumer electronics in metaverse. IEEE Trans. Consum. Electron. 70(1), 3770\u20133780 (2024). https:\/\/doi.org\/10.1109\/TCE.2024.3372506","journal-title":"IEEE Trans. Consum. Electron."},{"key":"1324_CR12","unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OsDI, vol. 99, pp. 173\u2013186 (1999). https:\/\/www.usenix.org\/legacy\/publications\/library\/proceedings\/osdi99\/full_papers\/castro\/castro.ps"},{"issue":"3","key":"1324_CR13","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1324_CR14","doi-asserted-by":"publisher","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected O(1) rounds, expected o(n$$ ^{\\text{2}}$$) communication, and optimal resilience. In: Goldberg, I., Moore, T. (eds.) Financial Cryptography and Data Security, pp. 320\u2013334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_20","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"1324_CR15","doi-asserted-by":"publisher","unstructured":"Aublin, P.-L., Mokhtar, S.B., Qu\u00e9ma, V.: Rbft: Redundant byzantine fault tolerance. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp. 297\u2013306 (2013).https:\/\/doi.org\/10.1109\/ICDCS.2013.53","DOI":"10.1109\/ICDCS.2013.53"},{"key":"1324_CR16","doi-asserted-by":"publisher","unstructured":"Malkhi, D., Nayak, K., Ren, L.: Flexible byzantine fault tolerance. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201919, pp. 1041\u20131053. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3319535.3354225","DOI":"10.1145\/3319535.3354225"},{"key":"1324_CR17","doi-asserted-by":"publisher","unstructured":"Kursawe, K., Shoup, V.: Optimistic asynchronous atomic broadcast. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, pp. 204\u2013215. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_17","DOI":"10.1007\/11523468_17"},{"key":"1324_CR18","doi-asserted-by":"publisher","unstructured":"Lu, Y., Lu, Z., Tang, Q.: Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, pp. 2159\u20132173. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3559346","DOI":"10.1145\/3548606.3559346"},{"key":"1324_CR19","doi-asserted-by":"publisher","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"1324_CR20","doi-asserted-by":"publisher","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: Speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4) (2010). https:\/\/doi.org\/10.1145\/1658357.1658358","DOI":"10.1145\/1658357.1658358"},{"key":"1324_CR21","unstructured":"Zhang, Y., Setty, S., Chen, Q., Zhou, L., Alvisi, L.: Byzantine ordered consensus without byzantine oligarchy. In: 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pp. 633\u2013649 (2020). https:\/\/www.usenix.org\/conference\/osdi20\/presentation\/zhang-yunhao"},{"key":"1324_CR22","doi-asserted-by":"publisher","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync hotstuff: Simple and practical synchronous state machine replication. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 106\u2013118 (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00044","DOI":"10.1109\/SP40000.2020.00044"},{"key":"1324_CR23","doi-asserted-by":"publisher","unstructured":"Abraham, I., Nayak, K., Shrestha, N.: Optimal good-case latency for rotating leader synchronous BFT. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 217, pp. 27\u201312719. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2021.27. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15802","DOI":"10.4230\/LIPIcs.OPODIS.2021.27"},{"key":"1324_CR24","doi-asserted-by":"publisher","unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Byzantine agreement, broadcast and state machine replication with near-optimal good-case latency. arXiv e-prints, pp. 2003\u201313155 (2020). arXiv:2003.13155. https:\/\/doi.org\/10.48550\/arXiv.2003.13155","DOI":"10.48550\/arXiv.2003.13155"},{"key":"1324_CR25","doi-asserted-by":"publisher","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2019, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18","DOI":"10.1007\/978-3-030-26948-7_18"},{"issue":"2","key":"1324_CR26","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988). https:\/\/doi.org\/10.1145\/42282.42283","journal-title":"J. ACM"},{"key":"1324_CR27","unstructured":"Buchman, E.: Tendermint: Byzantine fault tolerance in the age of blockchains. (2016). http:\/\/hdl.handle.net\/10214\/9769"},{"key":"1324_CR28","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 279\u2013296. USENIX Association, Austin, TX (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/kogias"},{"key":"1324_CR29","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. CoRR abs\/1710.09437 (2017). arXiv:1710.09437"},{"key":"1324_CR30","unstructured":"Stathakopoulou, C., David, T., Vukolic, M.: Mir-bft: High-throughput bft for blockchains. CoRR abs\/1906.05552 (2019). arXiv:1906.05552"},{"key":"1324_CR31","doi-asserted-by":"publisher","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: A dag-based mempool and efficient bft consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems. EuroSys \u201922, pp. 34\u201350. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3492321.3519594","DOI":"10.1145\/3492321.3519594"},{"key":"1324_CR32","doi-asserted-by":"publisher","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: Dag bft protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, pp. 2705\u20132718. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3559361","DOI":"10.1145\/3548606.3559361"},{"issue":"2","key":"1324_CR33","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"1324_CR34","doi-asserted-by":"publisher","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of bft protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916, pp. 31\u201342. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2976749.2978399","DOI":"10.1145\/2976749.2978399"},{"key":"1324_CR35","doi-asserted-by":"publisher","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC \u201919, pp. 337\u2013346. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3293611.3331612","DOI":"10.1145\/3293611.3331612"},{"key":"1324_CR36","doi-asserted-by":"publisher","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: Beat: Asynchronous bft made practical. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201918, pp. 2028\u20132041. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3243734.3243812","DOI":"10.1145\/3243734.3243812"},{"key":"1324_CR37","doi-asserted-by":"publisher","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: Faster asynchronous bft protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201920, pp. 803\u2013818. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3417262","DOI":"10.1145\/3372297.3417262"},{"key":"1324_CR38","doi-asserted-by":"publisher","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is dag. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC\u201921, pp. 165\u2013175. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3465084.3467905","DOI":"10.1145\/3465084.3467905"},{"issue":"2","key":"1324_CR39","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","journal-title":"J. ACM"},{"key":"1324_CR40","doi-asserted-by":"publisher","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) Advances in Cryptology \u2014 CRYPTO 2001, pp. 524\u2013541. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31","DOI":"10.1007\/3-540-44647-8_31"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01324-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T15:02:36Z","timestamp":1740236556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01324-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1324"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01324-w","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"28 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This declaration is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"17"}}