{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T11:10:18Z","timestamp":1789989018989,"version":"4.0.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2020YFC1523300"],"award-info":[{"award-number":["2020YFC1523300"]}]},{"name":"the Construction of Innovation Platform Program of Qinghai Province of China","award":["2022-ZJ-T02"],"award-info":[{"award-number":["2022-ZJ-T02"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graph neural networks (GNNs) have shown powerful capabilities in modeling and representing graph structural data across various graph learning tasks as an emerging deep learning approach. However, most existing GNNs focus on single-relational graphs and fail to fully utilize the rich and diverse relational information present in real-world graph data. In addition, deeper GNNs tend to suffer from overfitting and oversmoothing issues, leading to degraded model performance. To deeply excavate the multi-relational features in graph data and strengthen the modeling and representation abilities of GNNs, this paper proposes a multi-channel deep graph convolutional neural network method called DeepMCGCN. It constructs multiple relational subgraphs and adopts multiple GCN channels to learn the characteristics of different relational subgraphs separately. Cross-channel connections are utilized to obtain interactions between different relational subgraphs, which can learn node embeddings richer and more discriminative than single-channel GNNs. Meanwhile, it alleviates overfitting issues of deep models by optimizing convolution functions and adding residual connections between and within channels. The DeepMCGCN method is evaluated on three real-world datasets, and the experimental results show that its node classification performance outperforms that of single-channel GCN and other benchmark models, which improves the modeling and representation capabilities of the model.<\/jats:p>","DOI":"10.1007\/s44196-024-00432-9","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:02:01Z","timestamp":1709121721000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["DeepMCGCN: Multi-channel Deep Graph Neural Networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Lei","family":"Meng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhonglin","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanlin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0957-1603","authenticated-orcid":false,"given":"Haixing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"key":"432_CR1","volume-title":"The SAGE handbook of social network analysis","author":"J Scott","year":"2011","unstructured":"Scott, J., Carrington, P.J.: The SAGE handbook of social network analysis. SAGE publications, London (2011)"},{"issue":"22","key":"432_CR2","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1093\/bioinformatics\/bty440","volume":"34","author":"V Gligorijevi\u0107","year":"2018","unstructured":"Gligorijevi\u0107, V., Barot, M., Bonneau, R.: deepNF: deep network fusion for protein function prediction. Bioinformatics 34(22), 3873\u20133881 (2018). https:\/\/doi.org\/10.1093\/bioinformatics\/bty440","journal-title":"Bioinformatics"},{"issue":"1","key":"432_CR3","doi-asserted-by":"publisher","first-page":"016131","DOI":"10.1103\/PhysRevE.64.016131","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E 64(1), 016131 (2001). https:\/\/doi.org\/10.1103\/PhysRevE.64.016131","journal-title":"Phys. Rev. E"},{"issue":"2","key":"432_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2013.01.001","volume":"229","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Miandoabchi, E., Szeto, W.Y., Rashidi, H.: A review of urban transportation network design problems. Eur. J. Oper. Res.Oper. Res. 229(2), 281\u2013302 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2013.01.001","journal-title":"Eur. J. Oper. Res.Oper. Res."},{"key":"432_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00138-021-01251-0","volume":"33","author":"S Xiao","year":"2022","unstructured":"Xiao, S., Wang, S., Dai, Y., Guo, W.: Graph neural networks in node classification: survey and evaluation. Mach. Vis. Appl. 33, 1\u201319 (2022). https:\/\/doi.org\/10.1007\/s00138-021-01251-0","journal-title":"Mach. Vis. Appl."},{"key":"432_CR6","doi-asserted-by":"publisher","unstructured":"Luan, S., Hua, C., Xu, M., Lu, Q. C., Zhu, J. Q., Chang, X. W., Fu, J., Leskovec, J., Precup, D.: When do graph neural networks help with node classification: Investigating the homophily principle on node distinguishability (2023). arXiv preprint arXiv:2304.14274. https:\/\/doi.org\/10.48550\/arXiv.2304.14274","DOI":"10.48550\/arXiv.2304.14274"},{"key":"432_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108230","volume":"122","author":"C Wang","year":"2022","unstructured":"Wang, C., Pan, S., Yu, P.C., Hu, R.Q., Long, G.D., Zhang, C.Q.: Deep neighbor-aware embedding for node clustering in attributed graphs. Pattern Recognit. 122, 108230 (2022). https:\/\/doi.org\/10.1016\/j.patcog.2021.108230","journal-title":"Pattern Recognit."},{"issue":"13","key":"432_CR8","doi-asserted-by":"publisher","first-page":"4514","DOI":"10.3390\/s21134514","volume":"21","author":"MF Khan","year":"2021","unstructured":"Khan, M.F., Bibi, M., Aadil, F., Lee, J.W.: Adaptive node clustering for underwater sensor networks. Sensors. 21(13), 4514 (2021). https:\/\/doi.org\/10.3390\/s21134514","journal-title":"Sensors."},{"key":"432_CR9","volume-title":"NeurIPS 2018","author":"M Zhang","year":"2018","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: NeurIPS 2018. MIT Press, Oxford (2018)"},{"key":"432_CR10","unstructured":"Guo, Z., Shiao, W., Zhang, S., Liu, Y.Z., Chawla, N.V., Shah, N., Zhao, T.: Linkless link prediction via relational distillation. In: PMLR 2023, vol. 202, pp. 12012\u201312033 (2023)."},{"issue":"1","key":"432_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s44196-023-00329-z","volume":"16","author":"YL Yang","year":"2023","unstructured":"Yang, Y.L., Ye, Z.L., Zhao, H.X., Meng, L.: A graph representation learning framework predicting potential multivariate interactions. Int. J. Comput. Intell. Syst. 16(1), 1\u201316 (2023). https:\/\/doi.org\/10.1007\/s44196-023-00329-z","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"432_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112948","volume":"141","author":"X Chen","year":"2020","unstructured":"Chen, X., Jia, S., Xiang, Y.: A review: knowledge reasoning over knowledge graph. Expert Syst. Appl. 141, 112948 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2019.112948","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"432_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s44196-023-00271-0","volume":"16","author":"S Liu","year":"2023","unstructured":"Liu, S., Qin, Y.F., Xu, M., Kolmani\u010d, S.: Knowledge graph completion with triple structure and text representation. Int. J. Comput. Intell. Syst. 16(1), 95 (2023). https:\/\/doi.org\/10.1007\/s44196-023-00271-0","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"432_CR14","doi-asserted-by":"publisher","unstructured":"Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W., Leskovec, J.: Graph convolutional neural networks for web-scale recommender systems. In: ACM SIGKDD\u201924, pp. 974\u2013983 (2018). https:\/\/doi.org\/10.1145\/3219819.3219890","DOI":"10.1145\/3219819.3219890"},{"key":"432_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ins.2022.02.054","volume":"595","author":"C Wu","year":"2022","unstructured":"Wu, C., Liu, S., Zeng, Z., Chen, M., Alhudhaif, A., Tang, X.Y., Alenezi, F., Alnaim, N., Peng, X.C.: Knowledge graph-based multi-context-aware recommendation algorithm. Inf. Sci. 595, 179\u2013194 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.02.054","journal-title":"Inf. Sci."},{"issue":"1","key":"432_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3568022","volume":"1","author":"C Gao","year":"2023","unstructured":"Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., Li, Y.: A survey of graph neural networks for recommender systems: challenges, methods, and directions. ACM Trans. Web 1(1), 1\u201351 (2023). https:\/\/doi.org\/10.1145\/3568022","journal-title":"ACM Trans. Web"},{"issue":"1","key":"432_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s44196-022-00154-w","volume":"15","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Li, C., Cai, J., Liu, Y., Wang, H.: BKGNN-TI: a bilinear knowledge-aware graph neural network fusing text information for recommendation. Int. J. Comput. Intell. Syst. 15(1), 95 (2022). https:\/\/doi.org\/10.1007\/s44196-022-00154-w","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"432_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6054-2_3","volume-title":"Graph neural networks","author":"L Wu","year":"2022","unstructured":"Wu, L., Cui, P., Pei, J., Zhao, L.: Graph neural networks. Springer, Singapore (2022)"},{"issue":"1","key":"432_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4\u201324 (2020). https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"432_CR20","doi-asserted-by":"publisher","unstructured":"Kipf, T. N., Welling, M.: Semi-supervised classification with graph convolutional networks (2016). arXiv preprint arXiv:1609.02907. https:\/\/doi.org\/10.48550\/arXiv.1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"key":"432_CR21","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y. S.: Graph attention networks (2017). arXiv preprint arXiv:1710.10903. https:\/\/doi.org\/10.48550\/arXiv.1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"432_CR22","volume-title":"NeurIPS 2017","author":"W Hamilton","year":"2017","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS 2017. MIT Press, Oxford (2017)"},{"key":"432_CR23","unstructured":"Wu, F., Souza, A., Zhang, T. Y, Fifty, C., Yu, T., Weinberger, K.: Simplifying graph convolutional networks. In: PMLR 2019, vol. 97, pp. 6861\u20136871 (2019)."},{"key":"432_CR24","doi-asserted-by":"publisher","unstructured":"Zeng, D.Y., Liu, W. L., Chen, W.Y, Zhou, L., Zhang, M.L., Qu, H.: Substructure aware graph neural networks. In: AAAI\u20192023. AAAI Press. vol. 37(9), pp. 11129\u201311137 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i9.26318","DOI":"10.1609\/aaai.v37i9.26318"},{"key":"432_CR25","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ins.2022.12.086","volume":"625","author":"A Sriramulu","year":"2023","unstructured":"Sriramulu, A., Fourrier, N., Bergmeir, C.: Adaptive dependency learning graph neural networks. Inf. Sci. 625, 700\u2013714 (2023). https:\/\/doi.org\/10.1016\/j.ins.2022.12.086","journal-title":"Inf. Sci."},{"key":"432_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3161030","author":"L Peng","year":"2022","unstructured":"Peng, L., Hu, R., Kong, F., Gan, J.Z., Mo, Y.J., Shi, X.S., Zhu, X.F.: Reverse graph learning for graph neural network. IEEE Trans. Neural Netw. Learn. Syst. (2022). https:\/\/doi.org\/10.1109\/TNNLS.2022.3161030","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"432_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110040","volume":"135","author":"Z Liu","year":"2023","unstructured":"Liu, Z., Yang, D., Wang, Y.J., Lu, M.J., Li, R.R.: EGNN: graph structure learning based on evolutionary computation helps more in graph neural networks. Appl. Soft Comput.Comput. 135, 110040 (2023). https:\/\/doi.org\/10.1016\/j.asoc.2023.110040","journal-title":"Appl. Soft Comput.Comput."},{"key":"432_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2023.03.057","volume":"633","author":"MH Zou","year":"2023","unstructured":"Zou, M.H., Gan, Z.X., Cao, R.Z., Guan, C., Leng, S.Y.: Similarity-navigated graph neural networks for node classification. Inf. Sci. 633, 41\u201369 (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.03.057","journal-title":"Inf. Sci."},{"issue":"1","key":"432_CR29","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10618-022-00890-9","volume":"37","author":"Z Zhong","year":"2023","unstructured":"Zhong, Z., Li, C.T., Pang, J.: Hierarchical message-passing graph neural networks. Data. Min. Knowl. Discov. 37(1), 381\u2013408 (2023). https:\/\/doi.org\/10.1007\/s10618-022-00890-9","journal-title":"Data. Min. Knowl. Discov."},{"key":"432_CR30","unstructured":"Oskarsson, J., Sid\u00e9n, P., Lindsten, F.: Temporal graph neural networks for irregular data. In: PMLR 2023, pp. 4515\u20134531 (2023)."},{"key":"432_CR31","doi-asserted-by":"publisher","unstructured":"Islam, M.I.K., Khanov, M., Akbas, E.: MPool: motif-based graph pooling. In: PAKDD 2023. Springer Nature, Switzerland, pp. 105\u2013117 (2023). https:\/\/doi.org\/10.1007\/978-3-031-33377-4_9","DOI":"10.1007\/978-3-031-33377-4_9"},{"key":"432_CR32","unstructured":"Bo, D.Y., Shi, C., Wang, L.L., Liao, R.J.: Specformer: Spectral graph neural networks meet transformers. In: ICLR 2023. (2023). https:\/\/openreview.net\/forum?id=0pdSt3oyJa1"},{"key":"432_CR33","unstructured":"Dudzik, A.J., Veli\u010dkovi\u0107, P.: Graph neural networks are dynamic programmers. In: NeurIPS 2022, vol. 35, pp. 20635\u201320647 (2022)."},{"issue":"4","key":"432_CR34","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1109\/TNSE.2023.3244624","volume":"10","author":"RJ Lin","year":"2023","unstructured":"Lin, R.J., Du, S.D., Wang, S.P., Guo, W.Z.: Multi-channel augmented graph embedding convolutional network for multi-view clustering. IEEE Trans. Netw. Sci. Eng. 10(4), 2239\u20132249 (2023)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"432_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120178","volume":"226","author":"XF Zhu","year":"2023","unstructured":"Zhu, X.F., Li, C.H., Guo, J.F., Dietze, S.: CNIM-GCN: consensus neighbor interaction-based multi-channel graph convolutional networks. Expert Syst. Appl. 226, 120178 (2023). https:\/\/doi.org\/10.1016\/j.eswa.2023.120178","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"432_CR36","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1007\/s11227-022-04778-9","volume":"79","author":"R Zhai","year":"2023","unstructured":"Zhai, R., Zhang, L.B., Wang, Y.Q., Song, Y.L.: A multi-channel attention graph convolutional neural network for node classification. J. Supercomput.Supercomput. 79(4), 3561\u20133579 (2023). https:\/\/doi.org\/10.1007\/s11227-022-04778-9","journal-title":"J. Supercomput.Supercomput."},{"key":"432_CR37","doi-asserted-by":"publisher","first-page":"1135850","DOI":"10.3389\/fnins.2023.1135850","volume":"17","author":"H Chao","year":"2023","unstructured":"Chao, H., Cao, Y.M., Liu, Y.L.: Multi-channel EEG emotion recognition using Residual Graph Attention Neural Network. Front. Neurosci.Neurosci. 17, 1135850 (2023). https:\/\/doi.org\/10.3389\/fnins.2023.1135850","journal-title":"Front. Neurosci.Neurosci."},{"key":"432_CR38","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ins.2023.02.092","volume":"632","author":"JC Li","year":"2023","unstructured":"Li, J.C., Lu, G.G., Wu, Z.T., Ling, F.Q.: Multi-view representation model based on graph autoencoder. Inf. Sci. 632, 439\u2013453 (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.02.092","journal-title":"Inf. Sci."},{"key":"432_CR39","unstructured":"Xu, K., Li, C., Tian, Y., et al.: Representation learning on graphs with jumping knowledge networks. In: PMLR 2018, vol. 80, pp. 5453\u20135462 (2018)."},{"key":"432_CR40","doi-asserted-by":"publisher","unstructured":"Li, Q., Han, Z., Wu, X. M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: AAAI\u20192018, pp. 32(1) (2018). https:\/\/doi.org\/10.1609\/aaai.v32i1.11604.","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"432_CR41","doi-asserted-by":"publisher","unstructured":"Li, G. H., Xiong, C. X., Thabet, A., Ghanem, B.: Deepergcn: all you need to train deeper GCNS (2020). arXiv preprint arXiv:2006.07739. https:\/\/doi.org\/10.48550\/arXiv.2006.07739","DOI":"10.48550\/arXiv.2006.07739"},{"key":"432_CR42","doi-asserted-by":"publisher","unstructured":"Rong, Y., Huang, W., Xu, T., Huang, J. Z.: Dropedge: towards deep graph convolutional networks on node classification (2019). arXiv preprint arXiv:1907.10903. https:\/\/doi.org\/10.48550\/arXiv.1907.10903","DOI":"10.48550\/arXiv.1907.10903"},{"key":"432_CR43","unstructured":"Chen, M., Wei, Z.W., Huang, Z.F., Ding, B.L., Li, Y.L.: Simple and deep graph convolutional networks. In: PMLR 2020, pp. 1725\u20131735 (2020)."},{"key":"432_CR44","doi-asserted-by":"publisher","first-page":"3862","DOI":"10.1109\/TSP.2022.3192606","volume":"70","author":"Z Gao","year":"2022","unstructured":"Gao, Z., Gama, F., Ribeiro, A.: Wide and deep graph neural network with distributed online learning. IEEE Trans. Signal Process. 70, 3862\u20133877 (2022). https:\/\/doi.org\/10.1109\/TSP.2022.3192606","journal-title":"IEEE Trans. Signal Process."},{"key":"432_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119617","author":"GS Feng","year":"2023","unstructured":"Feng, G.S., Wang, H.Z., Wang, C.N.: Search for deep graph neural networks. Inf. Sci. (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.119617","journal-title":"Inf. Sci."},{"key":"432_CR46","doi-asserted-by":"publisher","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: ACM SIGKDD\u201914, pp. 701\u2013710 (2014). https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"432_CR47","doi-asserted-by":"publisher","unstructured":"Tang J, Qu M, Wang M, et al. Line: large-scale information network embedding. In: WWW\u201915, pp. 1067\u20131077 (2015). https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"432_CR48","doi-asserted-by":"publisher","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: ACM SIGKDD\u201916, pp. 855\u2013864 (2016). https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"432_CR49","doi-asserted-by":"publisher","unstructured":"Cao, S., Lu, W., Xu, Q.: Grarep: learning graph representations with global structural information. In: CIKM\u201915, pp. 891\u2013900 (2015). https:\/\/doi.org\/10.1145\/2806416.2806512","DOI":"10.1145\/2806416.2806512"}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00432-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-024-00432-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00432-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:14:17Z","timestamp":1709122457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-024-00432-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s44196-024-00432-9","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"19 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"41"}}