{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T06:51:10Z","timestamp":1792824670412,"version":"4.5.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100013317","name":"Shanxi Provincial Key Research and Development Project","doi-asserted-by":"publisher","award":["202102090301006"],"award-info":[{"award-number":["202102090301006"]}],"id":[{"id":"10.13039\/501100013317","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No. 2024ZKPYZN01"],"award-info":[{"award-number":["No. 2024ZKPYZN01"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s44443-025-00222-z","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T08:35:46Z","timestamp":1755765346000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["AFMF: adaptive fusion of multi-hop neighborhood features in graph convolutional network"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8413-123X","authenticated-orcid":false,"given":"Kang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2764-4278","authenticated-orcid":false,"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4345-3054","authenticated-orcid":false,"given":"Lian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3896-9265","authenticated-orcid":false,"given":"Zhihao","family":"Xv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4845-4052","authenticated-orcid":false,"given":"Aohang","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9912-3311","authenticated-orcid":false,"given":"Runshi","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,21]]},"reference":[{"key":"222_CR1","doi-asserted-by":"publisher","unstructured":"Abu-El-Haija S, Perozzi B, Kapoor A, Alipourfard N, Lerman K, Harutyunyan H, Ver\u00a0Steeg G, Galstyan A (2019) Mixhop: higher-order graph convolutional architectures via sparsified neighborhood mixing. In: International conference on machine learning. PMLR, pp 21\u201329. https:\/\/doi.org\/10.48550\/arXiv.1905.00067","DOI":"10.48550\/arXiv.1905.00067"},{"key":"222_CR2","doi-asserted-by":"publisher","unstructured":"Awasthi A, Garov AK, Sharma M, Sinha M (2023) Gnn model based on node classification forecasting in social network. In: 2023 international conference on Artificial Intelligence and Smart Communication (AISC). IEEE, pp 1039\u20131043. https:\/\/doi.org\/10.1109\/AISC56616.2023.10085118","DOI":"10.1109\/AISC56616.2023.10085118"},{"issue":"5","key":"222_CR3","doi-asserted-by":"publisher","first-page":"3950","DOI":"10.1609\/aaai.v35i5.16514","volume":"35","author":"D Bo","year":"2021","unstructured":"Bo D, Wang X, Shi C, Shen H (2021) Beyond low-frequency information in graph convolutional networks. Proc AAAI Conf Artif Intell 35(5):3950\u20133957. https:\/\/doi.org\/10.1609\/aaai.v35i5.16514","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"222_CR4","doi-asserted-by":"publisher","unstructured":"Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv:1312.6203. https:\/\/doi.org\/10.48550\/arXiv.1312.6203","DOI":"10.48550\/arXiv.1312.6203"},{"key":"222_CR5","doi-asserted-by":"publisher","unstructured":"Cavallo A, Grohnfeldt C, Russo M, Lovisotto G, Vassio L (2023) Gcnh: a simple method for representation learning on heterophilous graphs. In: 2023 International Joint Conference on Neural Networks (IJCNN). IEEE, pp 1\u20138. https:\/\/doi.org\/10.1109\/IJCNN54540.2023.10191196","DOI":"10.1109\/IJCNN54540.2023.10191196"},{"key":"222_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3267902","author":"J Chen","year":"2023","unstructured":"Chen J, Chen S, Gao J, Huang Z, Zhang J, Pu J (2023) Exploiting neighbor effect: conv-agnostic gnn framework for graphs with heterophily. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2023.3267902","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"222_CR7","doi-asserted-by":"publisher","unstructured":"Chien E, Peng J, Li P, Milenkovic O (2020) Adaptive universal generalized pagerank graph neural network. Int Conf Learn Representations. https:\/\/doi.org\/10.48550\/arXiv.2006.07988","DOI":"10.48550\/arXiv.2006.07988"},{"key":"222_CR8","doi-asserted-by":"publisher","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. Adv Neural Inf Process Syst 29. https:\/\/doi.org\/10.48550\/arXiv.1606.09375","DOI":"10.48550\/arXiv.1606.09375"},{"key":"222_CR9","first-page":"93540","volume":"37","author":"R Duan","year":"2024","unstructured":"Duan R, Guang M, Wang J, Yan C, Qi H, Su W, Tian C, Yang H (2024) Unifying homophily and heterophily for spectral graph neural networks via triple filter ensembles. Adv Neural Inf Process Syst 37:93540\u201393567","journal-title":"Adv Neural Inf Process Syst"},{"key":"222_CR10","doi-asserted-by":"publisher","unstructured":"Gong S, Zhou J, Xie C, Xuan Q (2023) Neighborhood homophily-based graph convolutional network. In: Proceedings of the 32nd ACM international conference on information and knowledge management, pp 3908\u20133912 . https:\/\/doi.org\/10.1145\/3583780.3615195","DOI":"10.1145\/3583780.3615195"},{"key":"222_CR11","doi-asserted-by":"publisher","first-page":"119463","DOI":"10.1016\/j.ins.2023.119463","volume":"647","author":"K Guo","year":"2023","unstructured":"Guo K, Cao X, Liu Z, Chang Y (2023) Taming over-smoothing representation on heterophilic graphs. Inf Sci 647:119463. https:\/\/doi.org\/10.1016\/j.ins.2023.119463","journal-title":"Inf Sci"},{"key":"222_CR12","doi-asserted-by":"publisher","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30. https:\/\/doi.org\/10.48550\/arXiv.1706.02216","DOI":"10.48550\/arXiv.1706.02216"},{"key":"222_CR13","doi-asserted-by":"publisher","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. https:\/\/doi.org\/10.48550\/arXiv.1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"key":"222_CR14","doi-asserted-by":"publisher","unstructured":"Li X, Zhu R, Cheng Y, Shan C, Luo S, Li D, Qian W (2022) Finding global homophily in graph neural networks when meeting heterophily. In: International conference on machine learning. PMLR, pp 13242\u201313256. https:\/\/doi.org\/10.48550\/arXiv.2205.07308","DOI":"10.48550\/arXiv.2205.07308"},{"issue":"7","key":"222_CR15","doi-asserted-by":"publisher","first-page":"8622","DOI":"10.1609\/aaai.v37i7.26038","volume":"37","author":"S Li","year":"2023","unstructured":"Li S, Kim D, Wang Q (2023) Restructuring graph for higher homophily via adaptive spectral clustering. Proc AAAI Conf Artif Intell 37(7):8622\u20138630. https:\/\/doi.org\/10.1609\/aaai.v37i7.26038","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"222_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918","author":"J Li","year":"2024","unstructured":"Li J, Zheng R, Feng H, Li M, Zhuang X (2024) Permutation equivariant graph framelets for heterophilous graph learning. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2024.3370918","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"222_CR17","doi-asserted-by":"publisher","first-page":"20887","DOI":"10.48550\/arXiv.2110.14446","volume":"34","author":"D Lim","year":"2021","unstructured":"Lim D, Hohne F, Li X, Huang SL, Gupta V, Bhalerao O, Lim SN (2021) Large scale learning on non-homophilous graphs: new benchmarks and strong simple methods. Adv Neural Inf Process Syst 34:20887\u201320902. https:\/\/doi.org\/10.48550\/arXiv.2110.14446","journal-title":"Adv Neural Inf Process Syst"},{"key":"222_CR18","doi-asserted-by":"publisher","unstructured":"Lingam V, Ragesh R, Iyer A, Sellamanickam S (2021) Simple truncated svd based model for node classification on heterophilic graphs. arXiv:2106.12807. https:\/\/doi.org\/10.48550\/arXiv.2106.12807","DOI":"10.48550\/arXiv.2106.12807"},{"issue":"4","key":"222_CR19","doi-asserted-by":"publisher","first-page":"4516","DOI":"10.1609\/aaai.v37i4.25573","volume":"37","author":"Y Liu","year":"2023","unstructured":"Liu Y, Zheng Y, Zhang D, Lee VC, Pan S (2023) Beyond smoothing: unsupervised graph representation learning with edge heterophily discriminating. Proc AAAI Conf Artif Intell 37(4):4516\u20134524. https:\/\/doi.org\/10.1609\/aaai.v37i4.25573","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"222_CR20","doi-asserted-by":"publisher","unstructured":"Lu K, Yu Y, Huang Z, Li J, Wang Y, Liang M, Qin X, Ren Y, Chua T-S, Wang X (2024) Addressing heterogeneity and heterophily in graphs: a heterogeneous heterophilic spectral graph neural network. arXiv:2410.13373. https:\/\/doi.org\/10.48550\/arXiv.2410.13373","DOI":"10.48550\/arXiv.2410.13373"},{"key":"222_CR21","doi-asserted-by":"publisher","unstructured":"Luan S, Hua C, Lu Q, Zhu J, Zhao M, Zhang S, Chang X-W, Precup D (2021) Is heterophily a real nightmare for graph neural networks to do node classification? arXiv:2109.05641. https:\/\/doi.org\/10.48550\/arXiv.2109.05641","DOI":"10.48550\/arXiv.2109.05641"},{"key":"222_CR22","doi-asserted-by":"publisher","unstructured":"Pei H, Wei B, Chang KCC, Lei Y, Yang B (2020) Geom-gcn: geometric graph convolutional networks. In: 8th International Conference on Learning Representations, ICLR 2020. https:\/\/doi.org\/10.48550\/arXiv.2002.05287","DOI":"10.48550\/arXiv.2002.05287"},{"issue":"8","key":"222_CR23","doi-asserted-by":"publisher","first-page":"8930","DOI":"10.1609\/aaai.v38i8.28741","volume":"38","author":"C Qiu","year":"2024","unstructured":"Qiu C, Nan G, Xiong T, Deng W, Wang D, Teng Z, Sun L, Cui Q, Tao X (2024) Refining latent homophilic structures over heterophilic graphs for robust graph convolution networks. Proc AAAI Conf Artif Intell 38(8):8930\u20138938. https:\/\/doi.org\/10.1609\/aaai.v38i8.28741","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"2","key":"222_CR24","doi-asserted-by":"publisher","first-page":"cnab014","DOI":"10.1093\/comnet\/cnab014","volume":"9","author":"B Rozemberczki","year":"2021","unstructured":"Rozemberczki B, Allen C, Sarkar R (2021) Multi-scale attributed node embedding. J Complex Netw 9(2):cnab014. https:\/\/doi.org\/10.1093\/comnet\/cnab014","journal-title":"J Complex Netw"},{"key":"222_CR25","doi-asserted-by":"publisher","unstructured":"Rusch TK, Chamberlain BP, Mahoney MW, Bronstein MM, Mishra S (2022) Gradient gating for deep multi-rate learning on graphs. Eleventh Int Conf Learn Representations. https:\/\/doi.org\/10.48550\/arXiv.2210.00513","DOI":"10.48550\/arXiv.2210.00513"},{"key":"222_CR26","doi-asserted-by":"publisher","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u201393. https:\/\/doi.org\/10.1609\/aimag.v29i3.2157","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"222_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2024.3380481","author":"RD Shetty","year":"2024","unstructured":"Shetty RD, Bhattacharjee S, Thanmai K (2024) Node classification in weighted complex networks using neighborhood feature similarity. IEEE Trans Emerg Topics Comput Intell. https:\/\/doi.org\/10.1109\/TETCI.2024.3380481","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"222_CR28","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s44443-025-00072-9","volume":"37","author":"X Shi","year":"2025","unstructured":"Shi X, Li B, Chen L et al (2025) Rrdgnn: relational reflective disentangled graph neural network for entity alignment. J King Saud Univ - Comput Inf Sci 37:48. https:\/\/doi.org\/10.1007\/s44443-025-00072-9","journal-title":"J King Saud Univ - Comput Inf Sci"},{"key":"222_CR29","doi-asserted-by":"publisher","unstructured":"Suresh S, Budde V, Neville J, Li P, Ma J (2021) Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp 1541\u20131551. https:\/\/doi.org\/10.1145\/3447548.3467373","DOI":"10.1145\/3447548.3467373"},{"key":"222_CR30","doi-asserted-by":"publisher","unstructured":"Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 807\u2013816. https:\/\/doi.org\/10.1145\/1557019.155710","DOI":"10.1145\/1557019.155710"},{"key":"222_CR31","doi-asserted-by":"publisher","first-page":"124979","DOI":"10.1016\/j.eswa.2024.124979","volume":"256","author":"Y Tang","year":"2024","unstructured":"Tang Y, Liang Y (2024) Credit card fraud detection based on federated graph learning. Expert Syst Appl 256:124979. https:\/\/doi.org\/10.1016\/j.eswa.2024.124979","journal-title":"Expert Syst Appl"},{"key":"222_CR32","doi-asserted-by":"publisher","unstructured":"Taud H, Mas J-F (2017) Multilayer perceptron (mlp), pp 451\u2013455. https:\/\/doi.org\/10.1007\/978-3-319-60801-3_27","DOI":"10.1007\/978-3-319-60801-3_27"},{"key":"222_CR33","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. Int Conf Learn Representations. https:\/\/doi.org\/10.48550\/arXiv.1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"222_CR34","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s44443-025-00087-2","volume":"37","author":"Q Wang","year":"2025","unstructured":"Wang Q, Wang J, Ibrahim NF (2025b) Sentientityrec: entity-level sentiment perception graph neural network for news recommendation. J King Saud Univ - Comput Inf Sci 37:80. https:\/\/doi.org\/10.1007\/s44443-025-00087-2","journal-title":"J King Saud Univ - Comput Inf Sci"},{"key":"222_CR35","doi-asserted-by":"publisher","first-page":"103166","DOI":"10.1016\/j.aei.2025.103166","volume":"65","author":"H Wang","year":"2025","unstructured":"Wang H, Zhang S, Tian Q, Wang L, Luo B, Han X (2025a) Multi-scale graph convolutional network for understanding human action in videos. Adv Eng Inform 65:103166. https:\/\/doi.org\/10.1016\/j.aei.2025.103166","journal-title":"Adv Eng Inform"},{"key":"222_CR36","doi-asserted-by":"publisher","unstructured":"Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K (2019) Simplifying graph convolutional networks. In: International conference on machine learning. Pmlr, pp 6861\u20136871. https:\/\/doi.org\/10.48550\/arXiv.1902.07153","DOI":"10.48550\/arXiv.1902.07153"},{"key":"222_CR37","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3257325","author":"L Wu","year":"2023","unstructured":"Wu L, Lin H, Liu Z, Liu Z, Huang Y, Li SZ (2023) Homophily-enhanced self-supervision for graph structure learning: insights and directions. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2023.3257325","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"222_CR38","doi-asserted-by":"publisher","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv:1810.00826. https:\/\/doi.org\/10.48550\/arXiv.1810.00826","DOI":"10.48550\/arXiv.1810.00826"},{"key":"222_CR39","doi-asserted-by":"publisher","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi K-i, Jegelka S (2018) Representation learning on graphs with jumping knowledge networks. In: International conference on machine learning. PMLR, pp 5453\u20135462. https:\/\/doi.org\/10.48550\/arXiv.1806.03536","DOI":"10.48550\/arXiv.1806.03536"},{"key":"222_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128812","volume":"616","author":"H Yan","year":"2025","unstructured":"Yan H, Ai G, Li X (2025) Selective-hop graph neural networks for semi-supervised node classification. Neurocomputing 616:128812. https:\/\/doi.org\/10.1016\/j.neucom.2024.128812","journal-title":"Neurocomputing"},{"issue":"1","key":"222_CR41","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/TNNLS.2022.3179306","volume":"35","author":"R Yang","year":"2022","unstructured":"Yang R, Dai W, Li C, Zou J, Xiong H (2022) Ncgnn: node-level capsule graph neural network for semisupervised classification. IEEE Trans Neural Netw Learn Syst 35(1):1025\u20131039. https:\/\/doi.org\/10.1109\/TNNLS.2022.3179306","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"222_CR42","doi-asserted-by":"publisher","first-page":"107014","DOI":"10.1016\/j.neunet.2024.107014","volume":"184","author":"Z Zheng","year":"2025","unstructured":"Zheng Z, Zhou S, Xu H, Gu M, Xu Y, Li A, Li Y, Gu J, Bu J (2025) Heterophilous distribution propagation for graph neural networks. Neural Netw 184:107014. https:\/\/doi.org\/10.1016\/j.neunet.2024.107014","journal-title":"Neural Netw"},{"key":"222_CR43","doi-asserted-by":"publisher","unstructured":"Zhu J, Yan Y, Zhao L, Heimann M, Akoglu L, Koutra D (2020) Beyond homophily in graph neural networks: current limitations and effective designs. Adv Neural Inf Process Syst 33:7793\u20137804. https:\/\/doi.org\/10.48550\/arXiv.2006.11468","DOI":"10.48550\/arXiv.2006.11468"},{"key":"222_CR44","doi-asserted-by":"publisher","unstructured":"Zou M, Gan Z, Cao R, Guan C, Leng S (2023) Similarity-navigated graph neural networks for node classification. Inf Sci 633:41\u201369. https:\/\/doi.org\/10.1016\/j.ins.2023.03.057","DOI":"10.1016\/j.ins.2023.03.057"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00222-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00222-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00222-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T12:44:13Z","timestamp":1758113053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00222-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,21]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["222"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00222-z","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,21]]},"assertion":[{"value":"2 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 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":"All authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"191"}}