{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T09:20:35Z","timestamp":1778145635922,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["2021-0-01341-003"],"award-info":[{"award-number":["2021-0-01341-003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hypernym discovery is challenging because it aims to find suitable instances for a given hyponym from a predefined hypernym vocabulary. Existing hypernym discovery methods used supervised learning with word embedding from word2vec. However, word2vec embedding suffers from low embedding quality regarding unseen or rare noun phrases because entire noun phrases are embedded into a single vector. Recently, prompting methods have attempted to find hypernyms using pretrained language models with masked prompts. Although language models alleviate the problem of w embeddings, general-purpose language models are ineffective for capturing hypernym relationships. Considering the hypernym relationship to be a linguistic domain, we introduce , which is further pretrained using masked language modeling with Hearst pattern sentences. To the best of our knowledge, this is the first attempt in the hypernym relationship discovery field. We also present a fine-tuning strategy for training  with special input prompts for the hypernym discovery task. The proposed method outperformed the comparison methods and achieved statistically significant results in three subtasks of hypernym discovery. Additionally, we demonstrate the effectiveness of the several proposed components through an in-depth analysis. The code is available at: <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Gun1Yun\/Hypert\">https:\/\/github.com\/Gun1Yun\/Hypert<\/jats:ext-link>.<\/jats:p>","DOI":"10.1186\/s40537-023-00818-0","type":"journal-article","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T17:01:39Z","timestamp":1694538099000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Hypert: hypernymy-aware BERT with Hearst pattern exploitation for hypernym discovery"],"prefix":"10.1186","volume":"10","author":[{"given":"Geonil","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjae","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A-Seong","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaesung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,12]]},"reference":[{"key":"818_CR1","doi-asserted-by":"crossref","unstructured":"Hearst MA. Automatic acquisition of hyponyms from large text corpora. In: COLING 1992 Volume 2: The 14th International Conference on Computational Linguistics; 1992","DOI":"10.3115\/992133.992154"},{"key":"818_CR2","unstructured":"Yamane J, Takatani T, Yamada H, Miwa M, Sasaki Y. Distributional hypernym generation by jointly learning clusters and projections. In: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, The COLING 2016 Organizing Committee, Osaka, Japan; 2016, pp. 2016:1871\u20131879. https:\/\/aclanthology.org\/C16-1176"},{"key":"818_CR3","doi-asserted-by":"publisher","unstructured":"Roller S, Erk K. Relations such as hypernymy: Identifying and exploiting hearst patterns in distributional vectors for lexical entailment. In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Austin, Texas, 2016, pp. 2016:2163\u20132172. https:\/\/doi.org\/10.18653\/v1\/D16-1234.","DOI":"10.18653\/v1\/D16-1234"},{"key":"818_CR4","doi-asserted-by":"publisher","unstructured":"Caraballo SA. Automatic construction of a hypernym-labeled noun hierarchy from text. In: Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, College Park, Maryland, USA; pp. 1999:120\u2013126. https:\/\/doi.org\/10.3115\/1034678.1034705.","DOI":"10.3115\/1034678.1034705"},{"key":"818_CR5","doi-asserted-by":"crossref","unstructured":"Cederberg S, Widdows D. Using LSA and noun coordination information to improve the recall and precision of automatic hyponymy extraction. In: Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL 2003, pp. 111\u2013118","DOI":"10.3115\/1119176.1119191"},{"key":"818_CR6","unstructured":"Sabirova K, Lukanin A. Automatic extraction of hypernyms and hyponyms from russian texts. In: AIST (supplement), Citeseer 2014; pp. 35\u201340."},{"key":"818_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.procs.2016.07.269","volume":"93","author":"N Sheena","year":"2016","unstructured":"Sheena N, Jasmine SM, Joseph S. Automatic extraction of hypernym & meronym relations in English sentences using dependency parser. Procedia Comput Sci. 2016;93:539\u201346.","journal-title":"Procedia Comput Sci"},{"key":"818_CR8","doi-asserted-by":"publisher","unstructured":"Camacho-Collados J, Delli Bovi C, Espinosa-Anke L, Oramas S, Pasini T, Santus E, Shwartz V, Navigli R, Saggion H. SemEval-2018 task 9: Hypernym discovery. In: Proceedings of The 12th International Workshop on Semantic Evaluation, Association for Computational Linguistics, New Orleans, Louisiana, 2018, pp. 712\u2013724. https:\/\/doi.org\/10.18653\/v1\/S18-1115.","DOI":"10.18653\/v1\/S18-1115"},{"key":"818_CR9","doi-asserted-by":"crossref","unstructured":"Fu R, Guo J, Qin B, Che W, Wang H, Liu T. Learning semantic hierarchies via word embeddings. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2014, pp. 1199\u20131209","DOI":"10.3115\/v1\/P14-1113"},{"key":"818_CR10","doi-asserted-by":"publisher","unstructured":"Bernier-Colborne G, Barri\u00e8re C. CRIM at SemEval-2018 task 9: a hybrid approach to hypernym discovery. In: Proceedings of The 12th International Workshop on Semantic Evaluation, Association for Computational Linguistics, New Orleans, Louisiana, 2018, pp. 725\u2013731. https:\/\/doi.org\/10.18653\/v1\/S18-1116.","DOI":"10.18653\/v1\/S18-1116"},{"key":"818_CR11","doi-asserted-by":"crossref","unstructured":"Bai Y, Zhang R, Kong F, Chen J, Mao Y. Hypernym discovery via a recurrent mapping model. In: Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021, 2021, pp. 2912\u20132921","DOI":"10.18653\/v1\/2021.findings-acl.257"},{"key":"818_CR12","doi-asserted-by":"crossref","unstructured":"Dash S, Chowdhury MFM, Gliozzo A, Mihindukulasooriya N, Fauceglia NR. Hypernym detection using strict partial order networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, 2020;34, pp. 7626\u20137633","DOI":"10.1609\/aaai.v34i05.6263"},{"key":"818_CR13","unstructured":"Peng B, Chersoni E, Hsu Y-Y, Huang C-R. Discovering financial hypernyms by prompting masked language models. In: Proceedings of the 4th Financial Narrative Processing Workshop@ LREC2022, 2022, pp. 10\u201316"},{"key":"818_CR14","doi-asserted-by":"crossref","unstructured":"Hanna M, Mare\u010dek D. Analyzing bert\u2019s knowledge of hypernymy via prompting. In: Proceedings of the Fourth BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, 2021, pp. 275\u2013282","DOI":"10.18653\/v1\/2021.blackboxnlp-1.20"},{"key":"818_CR15","unstructured":"Ravichander A, Hovy E, Suleman K, Trischler A, Cheung JCK. On the systematicity of probing contextualized word representations: the case of hypernymy in BERT. In: Proceedings of the Ninth Joint Conference on Lexical and Computational Semantics, Association for Computational Linguistics, Barcelona, Spain (Online), 2020, pp. 88\u2013102. https:\/\/aclanthology.org\/2020.starsem-1.10"},{"key":"818_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1162\/tacl_a_00298","volume":"8","author":"A Ettinger","year":"2020","unstructured":"Ettinger A. What bert is not: lessons from a new suite of psycholinguistic diagnostics for language models. Trans Assoc Comput Linguist. 2020;8:34\u201348.","journal-title":"Trans Assoc Comput Linguist"},{"key":"818_CR17","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1310.4546","author":"T Mikolov","year":"2013","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J. Distributed representations of words and phrases and their compositionality. Adv Neural Inf Process Syst. 2013. https:\/\/doi.org\/10.48550\/arXiv.1310.4546.","journal-title":"Adv Neural Inf Process Syst"},{"key":"818_CR18","doi-asserted-by":"crossref","unstructured":"Song X, Salcianu A, Song Y, Dopson D, Zhou D. Fast wordpiece tokenization. arXiv preprint. 2020 http:\/\/arxiv.org\/abs\/2012.15524","DOI":"10.18653\/v1\/2021.emnlp-main.160"},{"key":"818_CR19","unstructured":"Araci D. Finbert: financial sentiment analysis with pre-trained language models. arXiv preprint. 2019. http:\/\/arxiv.org\/abs\/1908.10063"},{"issue":"4","key":"818_CR20","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1093\/bioinformatics\/btz682","volume":"36","author":"J Lee","year":"2020","unstructured":"Lee J, Yoon W, Kim S, Kim D, Kim S, So CH, Kang J. Biobert: a pre-trained biomedical language representation model for biomedical text mining. Bioinformatics. 2020;36(4):1234\u201340.","journal-title":"Bioinformatics"},{"key":"818_CR21","doi-asserted-by":"publisher","unstructured":"Roller S, Kiela D, Nickel M. Hearst patterns revisited: Automatic hypernym detection from large text corpora. In: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), Association for Computational Linguistics, Melbourne, Australia,2 018, pp. 358\u2013363. https:\/\/doi.org\/10.18653\/v1\/P18-2057.","DOI":"10.18653\/v1\/P18-2057"},{"key":"818_CR22","doi-asserted-by":"publisher","unstructured":"Devlin J, Chang M-W, Lee K, Toutanova K. BERT: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), Association for Computational Linguistics, Minneapolis, Minnesota, 2019, pp. 4171\u20134186. https:\/\/doi.org\/10.18653\/v1\/N19-1423.","DOI":"10.18653\/v1\/N19-1423"},{"key":"818_CR23","doi-asserted-by":"crossref","unstructured":"Weeds J, Weir D. A general framework for distributional similarity. In: Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing, 2003, pp. 81\u201388","DOI":"10.3115\/1119355.1119366"},{"key":"818_CR24","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.1648","volume":"24","author":"P Cimiano","year":"2005","unstructured":"Cimiano P, Hotho A, Staab S. Learning concept hierarchies from text corpora using formal concept analysis. J Artif Intell Res. 2005;24:305\u201339.","journal-title":"J Artif Intell Res"},{"key":"818_CR25","doi-asserted-by":"crossref","unstructured":"Geffet M, Dagan I. The distributional inclusion hypotheses and lexical entailment. In: Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL\u201905), 2005, pp. 107\u2013114","DOI":"10.3115\/1219840.1219854"},{"key":"818_CR26","doi-asserted-by":"crossref","unstructured":"Weeds J, Weir D, McCarthy D. Characterising measures of lexical distributional similarity. In: COLING 2004: Proceedings of the 20th International Conference on Computational Linguistics, 2004, pp. 1015\u20131021","DOI":"10.3115\/1220355.1220501"},{"key":"818_CR27","unstructured":"Lenci A, Benotto G. Identifying hypernyms in distributional semantic spaces. In: * SEM 2012: The First Joint Conference on Lexical and Computational Semantics\u2013Volume 1: Proceedings of the Main Conference and the Shared Task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation (SemEval 2012), 2012, pp. 75\u201379"},{"key":"818_CR28","doi-asserted-by":"crossref","unstructured":"Clarke D. Context-theoretic semantics for natural language: an overview. In: Proceedings of the Workshop on Geometrical Models of Natural Language Semantics, 2009, pp. 112\u2013119","DOI":"10.3115\/1705415.1705430"},{"key":"818_CR29","unstructured":"Bahdanau D, Cho K, Bengio Y. Neural machine translation by jointly learning to align and translate. arXiv preprint. 2014 http:\/\/arxiv.org\/abs\/1409.0473"},{"key":"818_CR30","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J. Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"818_CR31","doi-asserted-by":"publisher","unstructured":"Kamel M, Trojahn C, Ghamnia A, Aussenac-Gilles N, Fabre C. A distant learning approach for extracting hypernym relations from wikipedia disambiguation pages. Procedia Computer Science, Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 21st International Conference, KES-20176-8 September 2017, Marseille, France, vol. 112 2017, pp. 1764\u20131773 https:\/\/doi.org\/10.1016\/j.procs.2017.08.208.","DOI":"10.1016\/j.procs.2017.08.208"},{"key":"818_CR32","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.artint.2012.07.001","volume":"193","author":"R Navigli","year":"2012","unstructured":"Navigli R, Ponzetto SP. Babelnet: the automatic construction, evaluation and application of a wide-coverage multilingual semantic network. Artif Intell. 2012;193:217\u201350. https:\/\/doi.org\/10.1016\/j.artint.2012.07.001.","journal-title":"Artif Intell"},{"key":"818_CR33","doi-asserted-by":"publisher","unstructured":"Espinosa-Anke L, Camacho-Collados J, Delli Bovi C, Saggion H. Supervised distributional hypernym discovery via domain adaptation. In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Austin, Texas, 2016, pp. 424\u2013435. https:\/\/doi.org\/10.18653\/v1\/D16-1041.","DOI":"10.18653\/v1\/D16-1041"},{"key":"818_CR34","doi-asserted-by":"publisher","unstructured":"Iacobacci I, Pilehvar MT, Navigli R. SensEmbed: Learning sense embeddings for word and relational similarity. In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), Association for Computational Linguistics, Beijing, China, 2015, pp. 95\u2013105. https:\/\/doi.org\/10.3115\/v1\/P15-1010.","DOI":"10.3115\/v1\/P15-1010"},{"key":"818_CR35","doi-asserted-by":"publisher","unstructured":"Shwartz V, Goldberg Y, Dagan I. Improving hypernymy detection with an integrated path-based and distributional method. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, Berlin, Germany, 2016, pp. 2389\u20132398. https:\/\/doi.org\/10.18653\/v1\/P16-1226.","DOI":"10.18653\/v1\/P16-1226"},{"key":"818_CR36","doi-asserted-by":"publisher","unstructured":"Yu C, Han J, Wang P, Song Y, Zhang H, Ng W, Shi S. When hearst is not enough: Improving hypernymy detection from corpus with distributional models. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), Association for Computational Linguistics, Online, 2020, pp. 6208\u20136217. https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.502.","DOI":"10.18653\/v1\/2020.emnlp-main.502"},{"key":"818_CR37","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1706.03762","author":"A Vaswani","year":"2017","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I. Attention is all you need. Adv Neural Inf Process Syst. 2017. https:\/\/doi.org\/10.48550\/arXiv.1706.03762.","journal-title":"Adv Neural Inf Process Syst"},{"key":"818_CR38","unstructured":"Liu Y, Ott M, Goyal N, Du J, Joshi M, Chen D, Levy O, Lewis M, Zettlemoyer L, Stoyanov V. Roberta: a robustly optimized bert pretraining approach. arXiv preprint. 2019. http:\/\/arxiv.org\/abs\/1907.11692"},{"key":"818_CR39","unstructured":"Lan Z, Chen M, Goodman S, Gimpel K, Sharma P, Soricut R. Albert: a lite bert for self-supervised learning of language representations. arXiv preprint. 2019. http:\/\/arxiv.org\/abs\/1909.11942"},{"key":"818_CR40","unstructured":"Sanh V, Debut L, Chaumond J, Wolf T. Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv preprint. 2019. http:\/\/arxiv.org\/abs\/1910.01108"},{"key":"818_CR41","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1162\/tacl_a_00342","volume":"8","author":"A Talmor","year":"2020","unstructured":"Talmor A, Elazar Y, Goldberg Y, Berant J. Olmpics-on what language model pre-training captures. Trans Assoc Comput Linguist. 2020;8:743\u201358.","journal-title":"Trans Assoc Comput Linguist"},{"key":"818_CR42","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1162\/tacl_a_00324","volume":"8","author":"Z Jiang","year":"2020","unstructured":"Jiang Z, Xu FF, Araki J, Neubig G. How can we know what language models know? Trans Assoc Comput Linguist. 2020;8:423\u201338.","journal-title":"Trans Assoc Comput Linguist"},{"key":"818_CR43","doi-asserted-by":"publisher","unstructured":"Petroni F, Rockt\u00e4schel T, Riedel S, Lewis P, Bakhtin A, Wu Y, Miller A. Language models as knowledge bases? In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), for Computational Linguistics, Hong Kong, China, 2019, pp. 2463\u20132473. Association https:\/\/doi.org\/10.18653\/v1\/D19-1250.","DOI":"10.18653\/v1\/D19-1250"},{"key":"818_CR44","doi-asserted-by":"publisher","unstructured":"Held W, Habash N. The effectiveness of simple hybrid systems for hypernym discovery. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, Florence, Italy, 2019, pp. 3362\u20133367. https:\/\/doi.org\/10.18653\/v1\/P19-1327.","DOI":"10.18653\/v1\/P19-1327"},{"key":"818_CR45","doi-asserted-by":"crossref","unstructured":"Jin Y, Jang E, Cui J, Chung J-W, Lee Y, Shin S. DarkBERT: A language model for the dark side of the Internet. In: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, Toronto, Canada, 2023, pp. 7515\u20137533. https:\/\/aclanthology.org\/2023.acl-long.415","DOI":"10.18653\/v1\/2023.acl-long.415"},{"key":"818_CR46","doi-asserted-by":"crossref","unstructured":"Wolf T, Debut L, Sanh V, Chaumond J, Delangue C, Moi A, Cistac P, Rault T, Louf R, Funtowicz M, et al.: Huggingface\u2019s transformers: State-of-the-art natural language processing. arXiv preprint. 2019. http:\/\/arxiv.org\/abs\/1910.03771","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"818_CR47","unstructured":"Loshchilov I, Hutter F. Decoupled weight decay regularization. arXiv preprint. 2017. http:\/\/arxiv.org\/abs\/1711.05101"},{"key":"818_CR48","unstructured":"Wu J-C, Chang Y-C, Mitamura T, Chang JS. Automatic collocation suggestion in academic writing. In: Proceedings of the ACL 2010 Conference Short Papers, 2010, pp. 115\u2013119"},{"key":"818_CR49","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fern\u00e1ndez S, Anke LE, Carlini R, Wanner L. Semantics-driven recognition of collocations using word embeddings. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2016, pp. 499\u2013505","DOI":"10.18653\/v1\/P16-2081"},{"key":"818_CR50","doi-asserted-by":"publisher","unstructured":"Wilcoxon F. In: Kotz S, Johnson NL. (eds.) Individual comparisons by ranking methods, New York: Springer, 1992, pp. 196\u2013202. https:\/\/doi.org\/10.1007\/978-1-4612-4380-9_16.","DOI":"10.1007\/978-1-4612-4380-9_16"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00818-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-023-00818-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00818-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T09:16:31Z","timestamp":1700558191000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-023-00818-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,12]]},"references-count":50,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1186\/s40537-023-00818-0","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,12]]},"assertion":[{"value":"6 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2023","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":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"141"}}