{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:47:07Z","timestamp":1777178827435,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T00:00:00Z","timestamp":1767744000000},"content-version":"vor","delay-in-days":40,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Illinois-Insper Collaborative"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2402559"],"award-info":[{"award-number":["2402559"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2402559"],"award-info":[{"award-number":["2402559"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2402559"],"award-info":[{"award-number":["2402559"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A recent study reported by Park et al. (Improved community detection using stochastic block models, Springer, Heidelberg, 2025) in Complex Networks and their Applications 2024 showed that clusterings from three Stochastic Block Models (SBMs) in graph-tool, a popular software package, often had internally disconnected clusters when used on large real-world or synthetic networks. To address this issue, Park et al.\u00a0(Improved community detection using stochastic block models, Springer, Heidelberg, 2025) presented a simple technique, Well-Connected Clusters (WCC), that repeatedly finds and removes small edge cuts of size at most\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\log _{10}n$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    in clusters, where\n                    <jats:italic>n<\/jats:italic>\n                    is the number of nodes in the cluster, and showed that treatment of graph-tool SBM clusterings with WCC improves accuracy. Here we examine the question of cluster connectivity for clusterings computed using other SBM software or nested SBMs within graph-tool. Our study, using a wide range of real-world and synthetic networks ranging up to more than a million nodes, shows that all tested SBM clustering methods frequently produce communities that are disconnected, and that graph-tool improves on PySBM. We provide insight into why graph-tool degree-corrected SBM clustering produces disconnected clusters by examining the description length formula it uses, and explore the impact of modifications to the description length formula. Finally, we show that WCC generally provides an improvement in accuracy for both flat and nested SBMs, except for cases where nearly all nodes in the network are in very sparse ground-truth clusters. We also demonstrate that WCC scales to networks with millions of nodes.\n                  <\/jats:p>","DOI":"10.1007\/s41109-025-00747-2","type":"journal-article","created":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T18:34:46Z","timestamp":1764354886000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using stochastic block models for community detection"],"prefix":"10.1007","volume":"11","author":[{"given":"The-Anh","family":"Vu-Le","sequence":"first","affiliation":[]},{"given":"Minhyuk","family":"Park","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,28]]},"reference":[{"issue":"177","key":"747_CR1","first-page":"1","volume":"18","author":"E Abbe","year":"2018","unstructured":"Abbe E (2018) Community detection and stochastic block models: recent developments. J Mach Learn Res 18(177):1\u201386","journal-title":"J Mach Learn Res"},{"key":"747_CR2","doi-asserted-by":"publisher","DOI":"10.1142\/s0219525925400041","author":"L Anne","year":"2025","unstructured":"Anne L, Vu-Le T-A, Park M, Warnow T, Chacko G (2025) RECCS: realistic cluster connectivity simulator for synthetic network generation. Adv Complex Syst. https:\/\/doi.org\/10.1142\/s0219525925400041","journal-title":"Adv Complex Syst"},{"issue":"50","key":"747_CR3","doi-asserted-by":"publisher","first-page":"21068","DOI":"10.1073\/pnas.0907096106","volume":"106","author":"PJ Bickel","year":"2009","unstructured":"Bickel PJ, Chen A (2009) A nonparametric view of network models and Newman-Girvan and other modularities. Proc Natl Acad Sci 106(50):21068\u201321073","journal-title":"Proc Natl Acad Sci"},{"issue":"10","key":"747_CR4","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"747_CR5","unstructured":"Chen I, Vu-Le T-A, Park M Analysis scripts for \u201cUsing Stochastic Block Models for Community Detection\u201d. https:\/\/github.com\/illinois-or-research-analytics\/network-analysis-code"},{"issue":"1","key":"747_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0238-9","volume":"4","author":"H Cherifi","year":"2019","unstructured":"Cherifi H, Palla G, Szymanski BK, Lu X (2019) On community structure in complex networks: challenges and opportunities. Appl Netw Sci 4(1):1\u201335","journal-title":"Appl Netw Sci"},{"issue":"1","key":"747_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/040608635","volume":"30","author":"SV Dongen","year":"2008","unstructured":"Dongen SV (2008) Graph clustering via a discrete uncoupling process. SIAM J Matrix Anal Appl 30(1):121\u2013141","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3\u20135","key":"747_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"747_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344. https:\/\/doi.org\/10.1016\/j.physrep.2016.09.002","journal-title":"Phys Rep"},{"issue":"4","key":"747_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0215296","volume":"14","author":"T Funke","year":"2019","unstructured":"Funke T, Becker T (2019a) Stochastic block models: a comparison of variants and inference methods. PLoS One 14(4):1\u201340. https:\/\/doi.org\/10.1371\/journal.pone.0215296","journal-title":"PLoS One"},{"key":"747_CR12","unstructured":"Funke T, Becker T (2019b) PySBM. https:\/\/github.com\/funket\/pysbm"},{"issue":"6","key":"747_CR13","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1002\/wics.1319","volume":"6","author":"S Harenberg","year":"2014","unstructured":"Harenberg S, Bello G, Gjeltema L, Ranshous S, Harlalka J, Seay R, Padmanabhan K, Samatova N (2014) Community detection in large-scale networks: a survey and empirical evaluation. Wiley Interdisciplinary Rev Comput Stat 6(6):426\u2013439","journal-title":"Wiley Interdisciplinary Rev Comput Stat"},{"key":"747_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274662","volume":"23","author":"M Henzinger","year":"2018","unstructured":"Henzinger M, Noe A, Schulz C, Strash D (2018) Practical minimum cut algorithms. ACM J Exp Algorithmics 23:1\u201322","journal-title":"ACM J Exp Algorithmics"},{"issue":"2","key":"747_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Social Netw 5(2):109\u2013137","journal-title":"Social Netw"},{"key":"747_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2:193\u2013218","journal-title":"J Classif"},{"key":"747_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","volume":"108","author":"MA Javed","year":"2018","unstructured":"Javed MA, Younis MS, Latif S, Qadir J, Baig A (2018) Community detection in networks: a multidisciplinary review. J Netw Comput Appl 108:87\u2013111","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"747_CR18","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1109\/TKDE.2021.3104155","volume":"35","author":"D Jin","year":"2023","unstructured":"Jin D, Yu Z, Jiao P, Pan S, He D, Wu J, Yu PS, Zhang W (2023) A survey of community detection approaches: from statistical modeling to deep learning. IEEE Trans Knowl Data Eng 35(2):1149\u20131170. https:\/\/doi.org\/10.1109\/TKDE.2021.3104155","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"747_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s41109-023-00552-9","volume":"8","author":"B Kami\u0144ski","year":"2023","unstructured":"Kami\u0144ski B, Pra\u0142at P, Th\u00e9berge F (2023) Artificial benchmark for community detection with outliers (ABCD+o). Appl Netw Sci 8(1):25","journal-title":"Appl Netw Sci"},{"issue":"3","key":"747_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On clusterings: good, bad and spectral. J ACM (JACM) 51(3):497\u2013515","journal-title":"J ACM (JACM)"},{"issue":"1","key":"747_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E: Stat, Nonlin, Soft Matter Phys 83(1):016107","journal-title":"Phys Rev E: Stat, Nonlin, Soft Matter Phys"},{"issue":"1","key":"747_CR22","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"747_CR23","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 BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Techn J 49(2):291\u2013307. https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x","journal-title":"Bell Syst Techn J"},{"issue":"4","key":"747_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"issue":"1","key":"747_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s41109-019-0232-2","volume":"4","author":"C Lee","year":"2019","unstructured":"Lee C, Wilkinson DJ (2019) A review of stochastic block models and extensions for graph clustering. Appl Netw Sci 4(1):122. https:\/\/doi.org\/10.1007\/s41109-019-0232-2","journal-title":"Appl Netw Sci"},{"key":"747_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Mahoney M (2010) Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International Conference on World Wide Web, pp. 631\u2013640","DOI":"10.1145\/1772690.1772755"},{"issue":"3","key":"747_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3715963","volume":"19","author":"X Liu","year":"2025","unstructured":"Liu X, Song W, Musial K, Li Y, Zhao X, Yang B (2025) Stochastic block models for complex network analysis: a survey. ACM Trans Knowl Discov Data 19(3):1\u201335","journal-title":"ACM Trans Knowl Discov Data"},{"key":"747_CR43","unstructured":"Luxburg Von\u00a0 U, Williamson RC, Guyon I (2012) Clustering: Science or art? In: Proceedings of ICML Workshop on Unsupervised and Transfer Learning, pp. 65\u201379. JMLR Workshop and Conference Proceedings"},{"issue":"5","key":"747_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.94.052315","volume":"94","author":"ME Newman","year":"2016","unstructured":"Newman ME (2016) Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys Rev E 94(5):052315","journal-title":"Phys Rev E"},{"issue":"3","key":"747_CR29","doi-asserted-by":"publisher","first-page":"0000009","DOI":"10.1371\/journal.pcsy.0000009","volume":"1","author":"M Park","year":"2024","unstructured":"Park M, Tabatabaee Y, Ramavarapu V, Liu B, Pailodi VK, Ramachandran R, Korobskiy D, Ayres F, Chacko G, Warnow T (2024) Well-connectedness and community detection. PLOS Complex Syst 1(3):0000009","journal-title":"PLOS Complex Syst"},{"key":"747_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-031-82435-7_9","volume-title":"Complex Netw Their Appl XIII","author":"M Park","year":"2025","unstructured":"Park M, Feng DW, Digra S, Vu-Le T-A, Chacko G, Warnow T (2025) Improved community detection using stochastic block models. In: Cherifi H, Donduran M, Rocha LM, Cherifi C, Varol O (eds) Complex Netw Their Appl XIII. Springer, Cham, pp 103\u2013114"},{"key":"747_CR32","unstructured":"Peixoto TP (2014) The graph-tool python library. figshare, http:\/\/figshare.com\/articles\/graph_tool\/1164194"},{"key":"747_CR33","doi-asserted-by":"publisher","unstructured":"Peixoto TP (2019) In: Doreian, P., Batagelj, V., Ferligoj, A. (eds.) Bayesian Stochastic Blockmodeling, pp. 289\u2013332. John Wiley & Sons, Ltd, Hoboken, NJ. Chap. 11. https:\/\/doi.org\/10.1002\/9781119483298.ch11","DOI":"10.1002\/9781119483298.ch11"},{"key":"747_CR34","unstructured":"Peixoto TP (2020) The Netzschleuder network catalogue and repository. https:\/\/networks.skewed.de"},{"key":"747_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.148701","volume":"110","author":"TP Peixoto","year":"2013","unstructured":"Peixoto TP (2013) Parsimonious module inference in large networks. Phys Rev Lett 110:148701. https:\/\/doi.org\/10.1103\/PhysRevLett.110.148701","journal-title":"Phys Rev Lett"},{"issue":"1","key":"747_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.012804","volume":"89","author":"TP Peixoto","year":"2014","unstructured":"Peixoto TP (2014) Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Phys Rev E 89(1):012804","journal-title":"Phys Rev E"},{"issue":"1","key":"747_CR37","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Special Topics 178(1):13\u201323","journal-title":"Eur Phys J Special Topics"},{"key":"747_CR38","volume-title":"Elements of Information Theory","author":"M Thomas","year":"2006","unstructured":"Thomas M, Joy AT (2006) Elements of Information Theory. Wiley-Interscience, Hoboken, NJ"},{"key":"747_CR39","unstructured":"Traag V (2019) leidenalg. https:\/\/github.com\/vtraag\/leidenalg"},{"issue":"1","key":"747_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, Van Eck NJ (2019) From Louvain to Leiden: guaranteeing well-connected communities. Sci Rep 9(1):1\u201312","journal-title":"Sci Rep"},{"key":"747_CR42","doi-asserted-by":"crossref","unstructured":"Vinh NX, Epps J, Bailey J (2009) Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 1073\u20131080","DOI":"10.1145\/1553374.1553511"},{"key":"747_CR44","unstructured":"Vu-Le T-A, Chacko G, Warnow T. EC-SBM Benchmark Networks. https:\/\/doi.org\/10.13012\/B2IDB-3284069_V1"},{"key":"747_CR45","doi-asserted-by":"publisher","unstructured":"Vu-Le T-A, Park M, Chen I, Warnow T (2025) Data for \u201cUsing Stochastic Block Models for Community Detection\u201d. University of Illinois Urbana-Champaign. https:\/\/doi.org\/10.13012\/B2IDB-3421614_V1","DOI":"10.13012\/B2IDB-3421614_V1"},{"issue":"1","key":"747_CR46","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s41109-025-00701-2","volume":"10","author":"T-A Vu-Le","year":"2025","unstructured":"Vu-Le T-A, Anne L, Chacko G, Warnow T (2025) EC-SBM synthetic network generator. Appl Netw Sci 10(1):15","journal-title":"Appl Netw Sci"},{"issue":"1","key":"747_CR47","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1162\/qss_a_00184","volume":"3","author":"E Wedell","year":"2022","unstructured":"Wedell E, Park M, Korobskiy D, Warnow T, Chacko G (2022) Center-periphery structure in research communities. Quantitative Sci Stud 3(1):289\u2013314","journal-title":"Quantitative Sci Stud"},{"issue":"1","key":"747_CR48","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2013","unstructured":"Yang J, Leskovec J (2013) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"747_CR49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.95.062304","volume":"95","author":"J-G Young","year":"2017","unstructured":"Young J-G, Desrosiers P, H\u00e9bert-Dufresne L, Laurence E, Dub\u00e9 LJ (2017) Finite-size analysis of the detectability limit of the stochastic block model. Phys Rev E 95(6):062304","journal-title":"Phys Rev E"},{"key":"747_CR50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3425581","author":"AY Zhang","year":"2024","unstructured":"Zhang AY (2024) Fundamental limits of spectral clustering in stochastic block models. IEEE Transactions on Information Theory. https:\/\/doi.org\/10.1109\/TIT.2024.3425581","journal-title":"IEEE Transactions on Information Theory"},{"key":"747_CR51","unstructured":"Zhang L (2023) Realistic constraints, model selection, and detectability of modular network structures. PhD thesis, University of Bath"},{"issue":"4","key":"747_CR53","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.043271","volume":"2","author":"L Zhang","year":"2020","unstructured":"Zhang L, Peixoto TP (2020) Statistical inference of assortative community structures. Phys Rev Res 2(4):043271","journal-title":"Phys Rev Res"},{"issue":"5","key":"747_CR55","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1002\/wics.1403","volume":"9","author":"Y Zhao","year":"2017","unstructured":"Zhao Y (2017) A survey on theoretical advances of community detection in networks. Wiley Interdisciplinary Rev Comput Stat 9(5):1403","journal-title":"Wiley Interdisciplinary Rev Comput Stat"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00747-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00747-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00747-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T13:35:49Z","timestamp":1767792949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41109-025-00747-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,28]]},"references-count":50,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["747"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00747-2","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,28]]},"assertion":[{"value":"5 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2025","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 that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2"}}