{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T21:07:39Z","timestamp":1767042459349,"version":"3.48.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"vor","delay-in-days":7,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100006465","name":"Korea Creative Content Agency","doi-asserted-by":"publisher","award":["RS-2023-00270043"],"award-info":[{"award-number":["RS-2023-00270043"]}],"id":[{"id":"10.13039\/501100006465","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00245361"],"award-info":[{"award-number":["RS-2023-00245361"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"DOI":"10.1140\/epjds\/s13688-025-00615-0","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T08:52:56Z","timestamp":1766393576000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Layered community-aware layout method for complex statute network visualization"],"prefix":"10.1140","volume":"14","author":[{"given":"Maryam","family":"Shakeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juyong","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pilsung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"issue":"6332","key":"615_CR1","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1126\/science.aag3013","volume":"355","author":"J Ruhl","year":"2017","unstructured":"Ruhl J, Katz DM, Bommarito MJ (2017) Harnessing legal complexity. Science 355(6332):1377\u20131378","journal-title":"Science"},{"issue":"1","key":"615_CR2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-73623-x","volume":"10","author":"DM Katz","year":"2020","unstructured":"Katz DM, Coupette C, Beckedorf J, Hartung D (2020) Complex societies and the growth of the law. Sci Rep 10(1):18737","journal-title":"Sci Rep"},{"key":"615_CR3","first-page":"443","volume":"67","author":"RL Sandefur","year":"2015","unstructured":"Sandefur RL (2015) What we know and need to know about the legal needs of the public. South Carolina Law Rev 67:443","journal-title":"South Carolina Law Rev"},{"issue":"1","key":"615_CR4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0209844","volume":"14","author":"B Lee","year":"2019","unstructured":"Lee B, Lee K-M, Yang J-S (2019) Network structure reveals patterns of legal complexity in human society: the case of the constitutional legal network. PLoS ONE 14(1):0209844","journal-title":"PLoS ONE"},{"key":"615_CR5","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.2307\/795210","volume":"79","author":"ES Cahn","year":"1969","unstructured":"Cahn ES, Cahn JC (1969) Power to the people or the profession\u2013the public interest in public law. Yale Law J 79:1005","journal-title":"Yale Law J"},{"key":"615_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10506-011-9116-1","volume":"19","author":"R Boulet","year":"2011","unstructured":"Boulet R, Mazzega P, Bourcier D (2011) A network approach to the French system of legal codes\u2014part I: analysis of a dense network. Artif Intell Law 19:333\u2013355","journal-title":"Artif Intell Law"},{"key":"615_CR7","volume-title":"NetSci 2024","author":"D Park","year":"2024","unstructured":"Park D, Wang S, Park TJ, Jon WJ, Park J (2024) Understanding consistent\u2013contrary relationships in legal citations through signed network analysis. In: NetSci 2024"},{"key":"615_CR8","doi-asserted-by":"publisher","first-page":"3693","DOI":"10.1109\/TVCG.2023.3238909","volume":"30","author":"L Shen","year":"2024","unstructured":"Shen L, Tai Z, Shen E, Wang J (2024) Graph exploration with embedding-guided layouts. IEEE Trans Vis Comput Graph 30:3693\u20133708","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"615_CR9","first-page":"1","volume-title":"SIGGRAPH Asia 2015 visualization in high performance computing","author":"C Li","year":"2015","unstructured":"Li C, Baciu G, Wang Y (2015) Modulgraph: modularity-based visualization of massive graphs. In: SIGGRAPH Asia 2015 visualization in high performance computing, pp\u00a01\u20134"},{"key":"615_CR10","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1109\/TVCG.2023.3238821","volume":"30","author":"F Zhong","year":"2024","unstructured":"Zhong F, Xue M, Zhang J, Zhang F, Ban R, Deussen O, Wang Y (2024) Force-directed graph layouts revisited: a new force based on the t-distribution. IEEE Trans Vis Comput Graph 30:3650\u20133663","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"2","key":"615_CR11","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1109\/TVCG.2020.3030447","volume":"27","author":"M Zhu","year":"2020","unstructured":"Zhu M, Chen W, Hu Y, Hou Y, Liu L, Zhang K (2020) Drgraph: an efficient graph layout algorithm for large-scale graphs by dimensionality reduction. IEEE Trans Vis Comput Graph 27(2):1666\u20131676","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"9","key":"615_CR12","doi-asserted-by":"publisher","first-page":"4561","DOI":"10.3390\/app12094561","volume":"12","author":"Z Xu","year":"2022","unstructured":"Xu Z, Mao T, Xu G, Wang Y, Lin D (2022) Multivariate network layout using force-directed method with attribute constraints. Appl Sci 12(9):4561. https:\/\/doi.org\/10.3390\/app12094561","journal-title":"Appl Sci"},{"key":"615_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.visinf.2023.07.003","volume":"7","author":"R Pan","year":"2023","unstructured":"Pan R, Wang Y, Sun J, Liu H, Zhao Y, Xia J, Chen W (2023) Simplifying social networks via triangle-based cohesive subgraphs. Vis Inform 7:84\u201394. https:\/\/doi.org\/10.1016\/j.visinf.2023.07.003","journal-title":"Vis Inform"},{"issue":"1","key":"615_CR14","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/TVCG.2021.3114756","volume":"28","author":"S Di Bartolomeo","year":"2022","unstructured":"Di Bartolomeo S, Riedewald M, Gatterbauer W, Dunne C (2022) Stratisfimal layout: a modular optimization model for laying out layered node-link network visualizations. IEEE Trans Vis Comput Graph 28(1):324\u2013334. https:\/\/doi.org\/10.1109\/TVCG.2021.3114756","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"615_CR15","unstructured":"The World Factbook. https:\/\/www.cia.gov\/the-world-factbook\/field\/legal-system\/. Accessed 28 May 2025"},{"key":"615_CR16","unstructured":"National Assembly Law Information. https:\/\/likms.assembly.go.kr\/law\/. Accessed 27 Sep 2023"},{"key":"615_CR17","first-page":"265","volume-title":"Computational legal studies","author":"D Van Kuppevelt","year":"2020","unstructured":"Van Kuppevelt D, Dijck G, Schaper M (2020) Purposes and challenges of legal citation network analysis on case law. In: Computational legal studies. Edward Elgar, Cheltenham, pp\u00a0265\u2013292"},{"issue":"1\u20132","key":"615_CR18","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1163\/15718190-20220004","volume":"90","author":"H De Jong","year":"2022","unstructured":"De Jong H, Van Dijck G (2022) Network analysis in legal history: an example from the court of friesland: remarks on the benefits. Tijdschr. Rechtsgeschied. 90(1\u20132):250\u2013262","journal-title":"Tijdschr. Rechtsgeschied."},{"key":"615_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0365-6","volume":"6","author":"N Lettieri","year":"2016","unstructured":"Lettieri N, Altamura A, Faggiano A, Malandrino D (2016) A computational approach for the experimental study of eu case law: analysis and implementation. Soc Netw Anal Min 6:1\u201317","journal-title":"Soc Netw Anal Min"},{"key":"615_CR20","first-page":"479","volume-title":"International multidisciplinary scientific GeoConference: SGEM 19(2.1)","author":"V Martsenyuk","year":"2019","unstructured":"Martsenyuk V, Rajba S, Jancarczyk D, Mayhruk Z, Milyan N (2019) On big graph data visualization of complex infrustructure networks. In: International multidisciplinary scientific GeoConference: SGEM 19(2.1), pp\u00a0479\u2013484"},{"key":"615_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s12650-024-01018-5","volume":"28","author":"A Murakami","year":"2025","unstructured":"Murakami A, Itoh T (2025) Flexible optimization of hierarchical graph layout by genetic algorithm with various conditions. J Vis 28:181\u2013204","journal-title":"J Vis"},{"key":"615_CR22","first-page":"561","volume-title":"International conference on medical imaging and computer-aided diagnosis","author":"L Han","year":"2022","unstructured":"Han L, Wang B, Wang S (2022) Force-directed graph layout based on community discovery and clustering optimization. In: International conference on medical imaging and computer-aided diagnosis. Springer, Berlin, pp\u00a0561\u2013571"},{"key":"615_CR23","doi-asserted-by":"crossref","unstructured":"Zhuo Z, Lu Y, Zhang W, Zhou L, Zhao K (2025) Graph layout by synchronization for visualizing communities in large-scale network. In: Proceedings (IEEE Venue Unspecified in PDF). Conference manuscript; venue not specified in the PDF","DOI":"10.1109\/ICEICT66683.2025.11160070"},{"key":"615_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/PACIFICVIS.2010.5429590","volume-title":"2010 IEEE Pacific visualization symposium (PacificVis)","author":"ER Gansner","year":"2010","unstructured":"Gansner ER, Hu Y, Kobourov S (2010) Gmap: visualizing graphs and clusters as maps. In: 2010 IEEE Pacific visualization symposium (PacificVis). IEEE, pp\u00a0201\u2013208"},{"key":"615_CR25","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/PASSAT\/SocialCom.2011.139","volume-title":"2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing","author":"EM Rodrigues","year":"2011","unstructured":"Rodrigues EM, Milic-Frayling N, Smith M, Shneiderman B, Hansen D (2011) Group-in-a-box layout for multi-faceted analysis of communities. In: 2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing. IEEE, pp\u00a0354\u2013361"},{"issue":"6","key":"615_CR26","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry N, Fekete J-D, McGuffin MJ (2007) Nodetrix: a hybrid visualization of social networks. IEEE Trans Vis Comput Graph 13(6):1302\u20131309","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"2","key":"615_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.026102","volume":"79","author":"A Noack","year":"2009","unstructured":"Noack A (2009) Modularity clustering is force-directed layout. Phys Rev E, Stat Nonlinear Soft Matter Phys 79(2):026102","journal-title":"Phys Rev E, Stat Nonlinear Soft Matter Phys"},{"key":"615_CR28","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s12650-024-00991-1","volume":"27","author":"S Zhang","year":"2024","unstructured":"Zhang S, Xu R, Zhang Q, Quan Y, Liu Q (2024) Deepfd: a deep learning approach to fast generate force-directed layout for large graphs. J Vis 27:925\u2013940","journal-title":"J Vis"},{"issue":"1","key":"615_CR29","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-37189-2","volume":"14","author":"C Both","year":"2023","unstructured":"Both C, Dehmamy N, Yu R, Barab\u00e1si A-L (2023) Accelerating network layouts using graph neural networks. Nat Commun 14(1):1560","journal-title":"Nat Commun"},{"issue":"2","key":"615_CR30","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10115-020-01521-9","volume":"63","author":"J Wang","year":"2021","unstructured":"Wang J, Jiannong C, Li W, Senzhang W (2021) Cane: community-aware network embedding via adversarial training. Knowl Inf Syst 63(2):411\u2013438","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"615_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/eng2.12517","volume":"4","author":"M Zhao","year":"2022","unstructured":"Zhao M, Zhang Y (2022) Gan-based deep neural networks for graph representation learning. Eng Rep 4(11):12517","journal-title":"Eng Rep"},{"issue":"2","key":"615_CR32","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Syst Man Cybern 11(2):109\u2013125","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"11","key":"615_CR33","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman TM, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129\u20131164","journal-title":"Softw Pract Exp"},{"issue":"10","key":"615_CR34","doi-asserted-by":"publisher","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":"615_CR35","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/ISDA.2011.6121636","volume-title":"2011 11th international conference on intelligent systems design and applications","author":"P De Meo","year":"2011","unstructured":"De Meo P, Ferrara E, Fiumara G, Provetti A (2011) Generalized Louvain method for community detection in large networks. In: 2011 11th international conference on intelligent systems design and applications. IEEE, pp\u00a088\u201393"},{"key":"615_CR36","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/CLUSTER.2018.00044","volume-title":"2018 IEEE international conference on cluster computing (CLUSTER)","author":"J Zeng","year":"2018","unstructured":"Zeng J, Yu H (2018) A scalable distributed Louvain algorithm for large-scale graph community detection. In: 2018 IEEE international conference on cluster computing (CLUSTER). IEEE, pp\u00a0268\u2013278"},{"issue":"1","key":"615_CR37","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"},{"issue":"1","key":"615_CR38","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-024-01635-4","volume":"7","author":"D Shi","year":"2024","unstructured":"Shi D, Shang F, Chen B, Expert P, L\u00fc L, Stanley HE, Lambiotte R, Evans TS, Li R (2024) Local dominance unveils clusters in networks. Commun Phys 7(1):170","journal-title":"Commun Phys"},{"issue":"1","key":"615_CR39","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/TNSE.2016.2634322","volume":"4","author":"V Lyzinski","year":"2016","unstructured":"Lyzinski V, Tang M, Athreya A, Park Y, Priebe CE (2016) Community detection and classification in hierarchical stochastic blockmodels. IEEE Trans Netw Sci Eng 4(1):13\u201326","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"2","key":"615_CR40","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"issue":"6","key":"615_CR41","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft J, Tarjan R (1973) Algorithm 447: efficient algorithms for graph manipulation. Commun ACM 16(6):372\u2013378","journal-title":"Commun ACM"},{"issue":"2","key":"615_CR42","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s11750-021-00605-1","volume":"29","author":"F Glover","year":"2021","unstructured":"Glover F, Campos V, Mart\u00ed R (2021) Tabu search tutorial. A graph drawing application. Top 29(2):319\u2013350","journal-title":"Top"},{"key":"615_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121477","volume":"237","author":"B Peng","year":"2024","unstructured":"Peng B, Wang S, Liu D, Su Z, L\u00fc Z, Glover F (2024) Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm. Expert Syst Appl 237:121477","journal-title":"Expert Syst Appl"},{"key":"615_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104830","volume":"114","author":"T Pastore","year":"2020","unstructured":"Pastore T, Mart\u00ednez-Gavara A, Napoletano A, Festa P, Mart\u00ed R (2020) Tabu search for min-max edge crossing in graphs. Comput Oper Res 114:104830","journal-title":"Comput Oper Res"},{"key":"615_CR45","unstructured":"Kobourov SG (2012) Spring embedders and force directed graph drawing algorithms. arXiv preprint. arXiv:1201.3011"},{"key":"615_CR46","first-page":"1071","volume-title":"Computer graphics forum","author":"P Simonetto","year":"2011","unstructured":"Simonetto P, Archambault D, Auber D, Bourqui R (2011) Impred: an improved force-directed algorithm that prevents nodes from crossing edges. In: Computer graphics forum, vol\u00a030. Wiley Online Library, pp\u00a01071\u20131080"},{"issue":"12","key":"615_CR47","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TVCG.2012.238","volume":"18","author":"M Zinsmaier","year":"2012","unstructured":"Zinsmaier M, Brandes U, Deussen O, Strobelt H (2012) Interactive level-of-detail rendering of large graphs. IEEE Trans Vis Comput Graph 18(12):2486\u20132495","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"615_CR48","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"615_CR49","unstructured":"Hinton GE, Roweis S (2002) Stochastic neighbor embedding. Adv Neural Inf Process Syst 15"},{"key":"615_CR50","first-page":"15073","volume-title":"Computer graphics forum","author":"S Di Bartolomeo","year":"2024","unstructured":"Di Bartolomeo S, Crnovrsanin T, Saffo D, Puerta E, Wilson C, Dunne C (2024) Evaluating graph layout algorithms: a systematic review of methods and best practices. In: Computer graphics forum. Wiley Online Library, p\u00a015073"},{"key":"615_CR51","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-1-4899-1962-5_7","volume-title":"Neighborhood and community environments","author":"DR Goldfield","year":"1987","unstructured":"Goldfield DR (1987) Neighborhood preservation and community values in historical perspective. In: Neighborhood and community environments. Springer, Berlin, pp\u00a0223\u2013256"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-025-00615-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-025-00615-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-025-00615-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T21:03:20Z","timestamp":1767042200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1140\/epjds\/s13688-025-00615-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,22]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-025-00615-0","relation":{},"ISSN":["2193-1127"],"issn-type":[{"type":"electronic","value":"2193-1127"}],"subject":[],"published":{"date-parts":[[2025,12,22]]},"assertion":[{"value":"5 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 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 user study was approved by the Institutional Review Board (IRB) of KAIST. All participants provided informed consent before participating in the study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"84"}}