{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T00:21:01Z","timestamp":1770250861659,"version":"3.49.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:00:00Z","timestamp":1770163200000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJSP2108"],"award-info":[{"award-number":["JPMJSP2108"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP24KJ0764"],"award-info":[{"award-number":["JP24KJ0764"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TechnoPro Holdings, Inc."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"DOI":"10.1007\/s41109-025-00771-2","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:52:57Z","timestamp":1767639177000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hypers2v: a framework for structural representation of nodes in hypergraphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Shu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Cameron","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Masaki","family":"Chujyo","sequence":"additional","affiliation":[]},{"given":"Fujio","family":"Toriumi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"771_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed N, Rossi RA, Lee J, Willke T, Zhou R, Kong X, Eldardiry H (2020) Role-based graph embeddings. IEEE Transact Knowl Data Eng 34(5):2401\u20132415","DOI":"10.1109\/TKDE.2020.3006475"},{"key":"771_CR2","doi-asserted-by":"publisher","unstructured":"Antelmi A, Cordasco G, Polato M, Scarano V, Spagnuolo C, Yang D (2023) A survey on hypergraph representation learning. ACM Comput Surv 56(1) https:\/\/doi.org\/10.1145\/3605776","DOI":"10.1145\/3605776"},{"issue":"1","key":"771_CR3","first-page":"1","volume":"33","author":"R Atkinson","year":"2001","unstructured":"Atkinson R, Flint J (2001) Accessing hidden and hard-to-reach populations: snowball research strategies. Soc Res Update 33(1):1\u20134","journal-title":"Social research update"},{"key":"771_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston F, Cencetti G, Iacopini I, Latora V, Lucas M, Patania A, Young J-G, Petri G (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep 874:1\u201392","journal-title":"Phys Rep"},{"issue":"6295","key":"771_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"key":"771_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/270991","volume":"22","author":"SP Borgatti","year":"1992","unstructured":"Borgatti SP, Everett MG (1992) Notions of position in social network analysis. Sociol Method 22:1\u201335","journal-title":"Sociological Methodology"},{"issue":"2","key":"771_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti T, Battiston F, Cencetti G, Fanelli D (2020) Random walks on hypergraphs. Phys Rev E 101(2):022308","journal-title":"Phys Rev E"},{"issue":"6","key":"771_CR8","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1086\/283885","volume":"118","author":"TJ Case","year":"1981","unstructured":"Case TJ, Bender EA (1981) Testing for higher order interactions. Am Nat 118(6):920\u2013929","journal-title":"Am Nat"},{"key":"771_CR9","doi-asserted-by":"crossref","unstructured":"Chen Y, Ding C, Hu J, Chen R, Hui P, Fu X (2017) Building and analyzing a global co-authorship network using google scholar data. In: Proc. of 26th International World Wide Web Conference (WWW 2017) Companion","DOI":"10.1145\/3041021.3053056"},{"key":"771_CR10","unstructured":"Chien E, Pan C, Peng J, Milenkovic O (2021) You are allset: a multiset function framework for hypergraph neural networks. arXiv preprint arXiv:2106.13264"},{"key":"771_CR11","doi-asserted-by":"crossref","unstructured":"Chodrow PS, Veldt N, Benson AR (2021) Hypergraph clustering: from blockmodels to modularity. arXiv e-prints, 2101","DOI":"10.1126\/sciadv.abh1303"},{"issue":"28","key":"771_CR12","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1126\/sciadv.abh1303","volume":"7","author":"PS Chodrow","year":"2021","unstructured":"Chodrow PS, Veldt N, Benson AR (2021) Generative hypergraph clustering: from blockmodels to modularity. Sci Adv 7(28):1303","journal-title":"Sci Adv"},{"issue":"5","key":"771_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui P, Wang X, Pei J, Zhu W (2018) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"771_CR14","unstructured":"Dong Y, Sawin W, Bengio Y (2020) HNHN: hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278"},{"key":"771_CR15","doi-asserted-by":"crossref","unstructured":"Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1320\u20131329","DOI":"10.1145\/3219819.3220025"},{"key":"771_CR16","doi-asserted-by":"publisher","first-page":"3558","DOI":"10.1609\/aaai.v33i01.33013558","volume":"33","author":"Y Feng","year":"2019","unstructured":"Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence 33:3558\u20133565","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"771_CR17","unstructured":"Forsyth R (1990) Zoo. UCI machine learning repository.Accessed June 1, 2023, from https:\/\/archive.ics.uci.edu\/dataset\/111\/zoo"},{"key":"771_CR18","doi-asserted-by":"publisher","unstructured":"Ganmor E, Segev R, Schneidman E (2011) Sparse low-order interaction network underlies a highly correlated and learnable neural population code. In: Proceedings of the National Academy of Sciences 108(23), 9679\u20139684 https:\/\/doi.org\/10.1073\/pnas.1019641108https:\/\/www.pnas.org\/doi\/pdf\/10.1073\/pnas.1019641108","DOI":"10.1073\/pnas.1019641108"},{"issue":"3","key":"771_CR19","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","volume":"45","author":"Y Gao","year":"2023","unstructured":"Gao Y, Feng Y, Ji S, Ji R (2023) HGNN+: general hypergraph neural networks. IEEE Trans Pattern Anal Mach Intell 45(3):3181\u20133199. https:\/\/doi.org\/10.1109\/TPAMI.2022.3182052","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"771_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl-Based Syst 151:78\u201394","journal-title":"Knowl-Based Syst"},{"key":"771_CR21","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"771_CR22","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Sys 30:1024\u20131034"},{"key":"771_CR23","doi-asserted-by":"crossref","unstructured":"Huang J, Yang J (2021) UniGNN: a unified framework for graph and hypergraph neural networks. arXiv preprint arXiv:2105.00956","DOI":"10.24963\/ijcai.2021\/353"},{"key":"771_CR24","unstructured":"Kim S, Kang S, Bu F, Lee SY, Yoo J, Shin K (2024) HypeBoy: generative self-supervised representation learning on hypergraphs. In: The Twelfth International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=DZUzOKE6og"},{"key":"771_CR25","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"771_CR26","unstructured":"Knuth DE (1993) The stanford graphbase: a platform for combinatorial computing, vol 1. ACM Press, New York"},{"key":"771_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Physica A 553:124289","journal-title":"Physica A"},{"key":"771_CR28","doi-asserted-by":"crossref","unstructured":"Landry NW, Young JG, Eikmeier N (2023) The simpliciality of higher-order networks. arXiv preprint arXiv:2308.13918","DOI":"10.1140\/epjds\/s13688-024-00458-1"},{"key":"771_CR29","doi-asserted-by":"crossref","unstructured":"LaRock T, Lambiotte R (2023) Encapsulation structure and dynamics in hypergraphs. arXiv preprint arXiv:2307.04613","DOI":"10.1088\/2632-072X\/ad0b39"},{"key":"771_CR30","doi-asserted-by":"crossref","unstructured":"Lee D, Shin K (2023) I\u2019m Me, We\u2019re Us, and I\u2019m Us: tri-directional contrastive learning on hypergraphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, 37:8456\u20138464","DOI":"10.1609\/aaai.v37i7.26019"},{"issue":"1","key":"771_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-022-00509-4","volume":"7","author":"S Liu","year":"2022","unstructured":"Liu S, Toriumi F, Nishiguchi M, Usui S (2022) A flexible framework for multiple-role discovery in real networks. Appl Netw Sci 7(1):1\u201323","journal-title":"Applied Network Science"},{"key":"771_CR32","doi-asserted-by":"crossref","unstructured":"Liu S, Toriumi F, Nishiguchi M, Usui S (2021) Multiple role discovery in complex networks. In: International Conference on Complex Networks and Their Applications, pp. 415\u2013427 . Springer","DOI":"10.1007\/978-3-030-93413-2_35"},{"key":"771_CR33","doi-asserted-by":"crossref","unstructured":"Liu S, Toriumi F, Zeng X, Nishiguchi M, Nakai K (2023) SignedS2V: structural embedding method for signed networks. In: Complex Networks and Their Applications XI: Proceedings of The Eleventh International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022\u2014Vol 1. pp. 337\u2013349 . Springer","DOI":"10.1007\/978-3-031-21127-0_28"},{"issue":"9","key":"771_CR34","doi-asserted-by":"publisher","first-page":"0136497","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A (2015) Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9):0136497","journal-title":"PLoS ONE"},{"key":"771_CR35","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"key":"771_CR36","doi-asserted-by":"publisher","unstructured":"Min S, Park J (2016) Narrative as a Complex Network: A Study of Victor Hugo\u2019s Les Mis\u00e9rables. In: Proceedings of HCI Korea. HCIK \u201916, pp. 100\u2013107. Hanbit Media, Inc., Seoul, KOR . https:\/\/doi.org\/10.17210\/hcik.2016.01.100","DOI":"10.17210\/hcik.2016.01.100"},{"key":"771_CR37","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford. https:\/\/doi.org\/10.1093\/acprof:oso\/9780199206650.001.0001","journal-title":"Oxford University Press, Oxford."},{"key":"771_CR38","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"771_CR39","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) Struc2vec: Learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"issue":"4","key":"771_CR40","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TKDE.2014.2349913","volume":"27","author":"RA Rossi","year":"2014","unstructured":"Rossi RA, Ahmed NK (2014) Role discovery in networks. IEEE Trans Knowl Data Eng 27(4):1112\u20131131","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"771_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397191","volume":"14","author":"RA Rossi","year":"2020","unstructured":"Rossi RA, Jin D, Kim S, Ahmed NK, Koutra D, Lee JB (2020) On proximity and structural role-based embeddings in networks: misconceptions, techniques, and applications. ACM Transact Knowl Discov Data (TKDD) 14(5):1\u201337","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"5","key":"771_CR42","doi-asserted-by":"publisher","first-page":"561","DOI":"10.3233\/IDA-2007-11508","volume":"11","author":"S Salvador","year":"2007","unstructured":"Salvador S, Chan P (2007) Toward accurate dynamic time warping in linear time and space. Intell Data Anal 11(5):561\u2013580","journal-title":"Intelligent Data Analysis"},{"issue":"3","key":"771_CR43","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata GM, Bilgic M, Getoor L, Gallagher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u2013106","journal-title":"AI Mag"},{"key":"771_CR44","doi-asserted-by":"crossref","unstructured":"Shi Y, Huang Z, Feng S, Zhong H, Wang W, Sun Y (2020) Masked label prediction: unified message passing model for semi-supervised classification. arXiv preprint arXiv:2009.03509","DOI":"10.24963\/ijcai.2021\/214"},{"key":"771_CR45","unstructured":"Skiena SS (2009) The algorithm design manual. Springer, London . https:\/\/books.google.co.jp\/books?id=7XUSn0IKQEgC"},{"key":"771_CR46","unstructured":"Stewart C, Woon J (2021) Congressional committee assignments, 1993\u20132017"},{"key":"771_CR47","doi-asserted-by":"publisher","unstructured":"Sun L, Ji S, Ye J (2008) Hypergraph Spectral Learning for Multi-Label Classification. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201908, pp. 668\u2013676. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/1401890.1401971","DOI":"10.1145\/1401890.1401971"},{"key":"771_CR48","doi-asserted-by":"crossref","unstructured":"Tang J, Aggarwal C, Liu H (2016) Node classification in signed social networks. In: Proceedings of the 2016 SIAM International Conference on Data Mining, pp. 54\u201362 . SIAM","DOI":"10.1137\/1.9781611974348.7"},{"key":"771_CR49","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: Large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"771_CR50","doi-asserted-by":"crossref","unstructured":"Tu K, Cui P, Wang X, Wang F, Zhu W (2018) Structural deep embedding for hyper-networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11266"},{"issue":"1","key":"771_CR51","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1038\/s42005-021-00704-2","volume":"4","author":"F Tudisco","year":"2021","unstructured":"Tudisco F, Higham DJ (2021) Node and edge nonlinear eigenvector centrality for hypergraphs. Communicat Phys 4(1):201","journal-title":"Communications Physics"},{"key":"771_CR52","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph Attention Networks. In: International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=rJXMpikCZ"},{"key":"771_CR53","doi-asserted-by":"publisher","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Structural analysis in the social sciences. Cambridge University Press, Cambridge . https:\/\/doi.org\/10.1017\/CBO9780511815478","DOI":"10.1017\/CBO9780511815478"},{"key":"771_CR54","first-page":"1909","volume":"35","author":"T Wei","year":"2022","unstructured":"Wei T, You Y, Chen T, Shen Y, He J, Wang Z (2022) Augmentations in hypergraph contrastive learning: fabricated and generative. Adv Neural Inf Process Syst 35:1909\u20131922","journal-title":"Adv Neural Inf Process Syst"},{"key":"771_CR55","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How Powerful are Graph Neural Networks? In: International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"771_CR56","unstructured":"Yadati N, Nimishakavi M, Yadav P, Nitin V, Louis A, Talukdar P (2019) HyperGCN: a new method for training graph convolutional networks on hypergraphs. Adv Neural Info Process Sys 32:1511-1522"},{"key":"771_CR57","first-page":"28877","volume":"34","author":"C Ying","year":"2021","unstructured":"Ying C, Cai T, Luo S, Zheng S, Ke G, He D, Shen Y, Liu T-Y (2021) Do transformers really perform badly for graph representation? Adv Neural Inf Process Syst 34:28877\u201328888","journal-title":"Adv Neural Inf Process Syst"},{"key":"771_CR58","doi-asserted-by":"publisher","unstructured":"Yu CA, Tai CL, Chan TS, Yang YH (2018) Modeling Multi-Way Relations with Hypergraph Embedding. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management. CIKM \u201918, pp. 1707\u20131710. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3269206.3269274","DOI":"10.1145\/3269206.3269274"},{"issue":"2","key":"771_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3491206","volume":"55","author":"J Zhou","year":"2022","unstructured":"Zhou J, Liu L, Wei W, Fan J (2022) Network representation learning: from preprocessing, feature extraction to node embedding. ACM Comput Surveys (CSUR) 55(2):1\u201335","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"771_CR60","doi-asserted-by":"publisher","unstructured":"Zhu Y, Guan Z, Tan S, Liu H, Cai D, He X (2016) Heterogeneous hypergraph embedding for document recommendation. Neurocomputing 216, 150\u2013162.https:\/\/doi.org\/10.1016\/j.neucom.2016.07.030","DOI":"10.1016\/j.neucom.2016.07.030"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00771-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00771-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00771-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T11:41:25Z","timestamp":1770205285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41109-025-00771-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":60,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["771"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00771-2","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"12 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 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":"Ethical approval and consent to participate"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no Conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"14"}}