{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T12:18:11Z","timestamp":1771935491470,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T00:00:00Z","timestamp":1712448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T00:00:00Z","timestamp":1712448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20473"],"award-info":[{"award-number":["U21A20473"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176244"],"award-info":[{"award-number":["62176244"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172370"],"award-info":[{"award-number":["62172370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s13042-024-02117-3","type":"journal-article","created":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T11:01:25Z","timestamp":1712487685000},"page":"3733-3743","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust graph neural networks with Dirichlet regularization and residual connection"],"prefix":"10.1007","volume":"15","author":[{"given":"Kaixuan","family":"Yao","sequence":"first","affiliation":[]},{"given":"Zijin","family":"Du","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Feilong","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Jiye","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,7]]},"reference":[{"key":"2117_CR1","doi-asserted-by":"crossref","unstructured":"Xia J, Wang S, Wang X, Xia M, Xie K, Cao J (2022) Multi-view bayesian spatio-temporal graph neural networks for reliable traffic flow prediction. Int J Mach Learn Cybern 1\u201314","DOI":"10.1007\/s13042-022-01689-2"},{"key":"2117_CR2","doi-asserted-by":"crossref","unstructured":"Yi Z, Song R, Li J, Xu H (2022) Neighbor-enhanced graph transition network for session-based recommendation. Int J Mach Learn Cybern 1\u201315","DOI":"10.1007\/s13042-022-01702-8"},{"key":"2117_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.artint.2018.03.004","volume":"259","author":"L Sless","year":"2018","unstructured":"Sless L, Hazon N, Kraus S, Wooldridge M (2018) Forming k coalitions and facilitating relationships in social networks. Artif Intell 259:217\u2013245","journal-title":"Artif Intell"},{"issue":"3","key":"2117_CR4","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s13042-021-01328-2","volume":"13","author":"Z Xin","year":"2022","unstructured":"Xin Z, Chen G, Chen J, Zhao S, Wang Z, Fang A, Pan Z, Cui L (2022) Mgpool: multi-granular graph pooling convolutional networks representation learning. Int J Mach Learn Cybern 13(3):783\u2013796","journal-title":"Int J Mach Learn Cybern"},{"key":"2117_CR5","doi-asserted-by":"publisher","first-page":"3115","DOI":"10.1007\/s13042-019-01003-7","volume":"10","author":"S Yu","year":"2019","unstructured":"Yu S, Yang X, Zhang W (2019) Pkgcn: prior knowledge enhanced graph convolutional network for graph-based semi-supervised learning. Int J Mach Learn Cybern 10:3115\u20133127","journal-title":"Int J Mach Learn Cybern"},{"key":"2117_CR6","unstructured":"Kipf T.N, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations"},{"key":"2117_CR7","unstructured":"Gilmer J, Schoenholz S.S, Riley P.F, Vinyals O, Dahl G.E (2017) Neural message passing for quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning, pp 1263\u20131272"},{"key":"2117_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2117_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Cui P, Zhu W (2020) Deep learning on graphs: a survey. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2020.2981333","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2117_CR10","unstructured":"Hasanzadeh A, Hajiramezanali E, Boluki S, Zhou M, Duffield N, Narayanan K, Qian X (2020) Bayesian graph neural networks with adaptive connection sampling. In: Proceedings of the International Conference on Machine Learning, pp 4094\u20134104"},{"key":"2117_CR11","first-page":"4751","volume":"34","author":"L Yang","year":"2021","unstructured":"Yang L, Li M, Liu L, Wang C, Cao X, Guo Y et al (2021) Diverse message passing for attribute with heterophily. Adv Neural Inf Process Syst 34:4751\u20134763","journal-title":"Adv Neural Inf Process Syst"},{"key":"2117_CR12","doi-asserted-by":"crossref","unstructured":"He K, Fan H, Wu Y, Xie S, Girshick R (2020) Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp 9729\u20139738","DOI":"10.1109\/CVPR42600.2020.00975"},{"issue":"9","key":"2117_CR13","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1007\/s13042-022-01533-7","volume":"13","author":"X Zhang","year":"2022","unstructured":"Zhang X, Wang S, Wu Z, Tan X (2022) Unsupervised image clustering algorithm based on contrastive learning and k-nearest neighbors. Int J Mach Learn Cybern 13(9):2415\u20132423","journal-title":"Int J Mach Learn Cybern"},{"key":"2117_CR14","doi-asserted-by":"crossref","unstructured":"Duan W, Xuan J, Qiao M, Lu J (2022) Learning from the dark: boosting graph convolutional neural networks with diverse negative samples. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 36, pp 6550\u20136558","DOI":"10.1609\/aaai.v36i6.20608"},{"key":"2117_CR15","unstructured":"Duan W, Xuan J, Qiao M, Lu J (2022) Graph convolutional neural networks with diverse negative samples via decomposed determinant point processes. arXiv preprint arXiv:2212.02055"},{"key":"2117_CR16","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y(2020) Graph contrastive learning with augmentations. In: Proceedings of Advances in Neural Information Processing Systems, pp 5812\u20135823"},{"key":"2117_CR17","doi-asserted-by":"crossref","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2021) Graph contrastive learning with adaptive augmentation. In: Proceedings of the Web Conference, pp 2069\u20132080","DOI":"10.1145\/3442381.3449802"},{"key":"2117_CR18","doi-asserted-by":"crossref","unstructured":"Lee N, Lee J, Park C (2022) Augmentation-free self-supervised learning on graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 36, pp 7372\u20137380","DOI":"10.1609\/aaai.v36i7.20700"},{"key":"2117_CR19","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Xia X, Chen T, Cui L, Nguyen Q.V.H (2022) Are graph augmentations necessary? simple graph contrastive learning for recommendation. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 1294\u20131303","DOI":"10.1145\/3477495.3531937"},{"key":"2117_CR20","unstructured":"Yang Y, Guan Z, Wang Z, Zhao W, Xu C, Lu W, Huang J (2022) Self-supervised heterogeneous graph pre-training based on structural clustering. In: Proceedings of the Advances in Neural Information Processing Systems, pp 16962\u201316974"},{"key":"2117_CR21","doi-asserted-by":"crossref","unstructured":"Hou Z, Liu X, Cen Y, Dong Y, Yang H, Wang C, Tang J (2022) Graphmae: Self-supervised masked graph autoencoders. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 594\u2013604","DOI":"10.1145\/3534678.3539321"},{"key":"2117_CR22","unstructured":"You Y, Chen T, Shen Y, Wang Z (2021) Graph contrastive learning automated. In: Proceedings of the 38th International Conference on Machine Learning, pp 12121\u201312132"},{"key":"2117_CR23","unstructured":"Tong Z, Liang Y, Ding H, Dai Y, Li X, Wang .C Directed graph contrastive learning. In: Proceedings of Advances in Neural Information Processing Systems"},{"key":"2117_CR24","unstructured":"Thakoor S, Tallec C, Azar M.G, Azabou M, Dyer E.L, Munos R, Veli\u010dkovi\u0107 P, Valko M (2021) Large-scale representation learning on graphs via bootstrapping. In: International Conference on Learning Representations"},{"key":"2117_CR25","doi-asserted-by":"crossref","unstructured":"Qiu J, Chen Q, Dong Y, Zhang J, Yang H, Ding M, Wang K, Tang J (2020) Gcc: Graph contrastive coding for graph neural network pre-training. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 1150\u20131160","DOI":"10.1145\/3394486.3403168"},{"issue":"10","key":"2117_CR26","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1109\/TMM.2016.2591508","volume":"18","author":"R Weng","year":"2016","unstructured":"Weng R, Lu J, Tan Y-P, Zhou J (2016) Learning cascaded deep auto-encoder networks for face alignment. IEEE Trans Multimed 18(10):2066\u20132078","journal-title":"IEEE Trans Multimed"},{"issue":"12","key":"2117_CR27","doi-asserted-by":"publisher","first-page":"3909","DOI":"10.1007\/s13042-022-01632-5","volume":"13","author":"H Wang","year":"2022","unstructured":"Wang H, Sun J, Gu X, Song W (2022) A novel multi-scale and sparsity auto-encoder for classification. Int J Mach Learn Cybern 13(12):3909\u20133925","journal-title":"Int J Mach Learn Cybern"},{"key":"2117_CR28","unstructured":"Kipf T.N, Welling M (2016) Variational graph auto-encoders. In: Proceedings of the NIPS 2016 Workshop on Bayesian Deep Learning"},{"key":"2117_CR29","unstructured":"Tang M, Li P, Yang C (2021) Graph auto-encoder via neighborhood wasserstein reconstruction. In: International Conference on Learning Representations"},{"key":"2117_CR30","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton W.L, Li\u00f2 P, Bengio Y, Hjelm R.D (2019) Deep graph infomax. In: International Conference on Learning Representations"},{"key":"2117_CR31","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.neunet.2022.10.010","volume":"157","author":"X Zhou","year":"2023","unstructured":"Zhou X, Hu K, Wang H (2023) Robustness meets accuracy in adversarial training for graph autoencoder. Neural Netw 157:114\u2013124","journal-title":"Neural Netw"},{"key":"2117_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103708","volume":"307","author":"K Yao","year":"2022","unstructured":"Yao K, Liang J, Liang J, Li M, Cao F (2022) Multi-view graph convolutional networks with attention mechanism. Artif Intell 307:103708","journal-title":"Artif Intell"},{"key":"2117_CR33","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Chang K.-W, Sun Y (2020) Gpt-gnn: Generative pre-training of graph neural networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 1857\u20131867","DOI":"10.1145\/3394486.3403237"},{"key":"2117_CR34","unstructured":"Zhou Y, Yang J, Zhang H, Liang Y, Tarokh V (2018) Sgd converges to global minimum in deep learning via star-convex path. In: International Conference on Learning Representations"},{"issue":"11","key":"2117_CR35","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1109\/TPAMI.2018.2865304","volume":"41","author":"W-S Lai","year":"2018","unstructured":"Lai W-S, Huang J-B, Ahuja N, Yang M-H (2018) Fast and accurate image super-resolution with deep laplacian pyramid networks. IEEE Trans Pattern Anal Mach Intell 41(11):2599\u20132613","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2117_CR36","doi-asserted-by":"crossref","unstructured":"Chung F.R (1997) Spectral graph theory","DOI":"10.1090\/cbms\/092"},{"issue":"3","key":"2117_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"DI Shuman","year":"2013","unstructured":"Shuman DI, Narang SK, Frossard P, Ortega A, Vandergheynst P (2013) The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process Mag 30(3):83\u201398","journal-title":"IEEE Signal Process Mag"},{"key":"2117_CR38","unstructured":"Estrach J.B, Zaremba W, Szlam A, LeCun Y (2014) Spectral networks and deep locally connected networks on graphs. In: International Conference on Learning Representations"},{"key":"2117_CR39","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of Advances in Neural Information Processing Systems, pp 1024\u20131034"},{"key":"2117_CR40","unstructured":"Monti F, Bronstein M, Bresson X (2017) Geometric matrix completion with recurrent multi-graph neural networks. In: Proceedings of Advances in Neural Information Processing Systems, pp 3697\u20133707"},{"key":"2117_CR41","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International Conference on Learning Representations"},{"key":"2117_CR42","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. In: Proceedings of Advances in Neural Information Processing Systems, pp 3844\u20133852"},{"key":"2117_CR43","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks. In: International Conference on Learning Representations"},{"key":"2117_CR44","doi-asserted-by":"crossref","unstructured":"Yang Y, Wang X, Song M, Yuan J, Tao D (2019) SPAGAN: Shortest path graph attention network. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp 4099\u20134105","DOI":"10.24963\/ijcai.2019\/569"},{"key":"2117_CR45","unstructured":"Chen J, Zhu J, Song L (2018) Stochastic training of graph convolutional networks with variance reduction. In: Proceedings of 35th International Conference on Machine Learning, pp 941\u2013949"},{"key":"2117_CR46","unstructured":"Chen J, Ma T, Xiao C (2018) FastGCN: fast learning with graph convolutional networks via importance sampling. In: International Conference on Learning Representations"},{"key":"2117_CR47","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.neunet.2020.04.028","volume":"128","author":"M Li","year":"2020","unstructured":"Li M, Ma Z, Wang YG, Zhuang X (2020) Fast Haar transforms for graph neural networks. Neural Netw 128:188\u2013198","journal-title":"Neural Netw"},{"key":"2117_CR48","unstructured":"Xu B, Shen H, Cao Q, Qiu Y, Cheng X (2019) Graph wavelet neural network. In: International Conference on Learning Representations"},{"key":"2117_CR49","unstructured":"Suresh S, Li P, Hao C, Neville J. Adversarial graph augmentation to improve graph contrastive learning. In: Proceedings of Advances in Neural Information Processing Systems"},{"key":"2117_CR50","unstructured":"Xu D, Cheng W, Luo D, Chen H, Zhang X. Infogcl: Information-aware graph contrastive learning. In: Proceedings of Advances in Neural Information Processing Systems"},{"key":"2117_CR51","unstructured":"Xia J, Wu L, Wang G, Chen J, Li S.Z (2022) Progcl: Rethinking hard negative mining in graph contrastive learning. In: Proceedings of the 39th International Conference on Machine Learning, pp 24332\u201324346"},{"key":"2117_CR52","doi-asserted-by":"crossref","unstructured":"Zhao H, Yang X, Wang Z, Yang E, Deng C (2021) Graph debiased contrastive learning with joint representation clustering. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, pp 3434\u20133440","DOI":"10.24963\/ijcai.2021\/473"},{"key":"2117_CR53","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton W.L, Li\u00f2 P, Bengio Y, Hjelm RD (2019) Deep graph infomax. In: International Conference on Learning Representations"},{"key":"2117_CR54","unstructured":"Hassani K, Khasahmadi AH (2020) Contrastive multi-view representation learning on graphs. In: Proceedings of the 37th International Conference on Machine Learning, pp 4116\u20134126"},{"key":"2117_CR55","doi-asserted-by":"crossref","unstructured":"Guo Z, Wang F, Yao K, Liang J, Wang Z (2022) Multi-scale variational graph autoencoder for link prediction. In: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, pp 334\u2013342","DOI":"10.1145\/3488560.3498531"},{"key":"2117_CR56","doi-asserted-by":"crossref","unstructured":"Park J, Lee M, Chang HJ, Lee K, Choi J (2019) Symmetric graph convolutional autoencoder for unsupervised graph representation learning. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp 6519\u20136528","DOI":"10.1109\/ICCV.2019.00662"},{"key":"2117_CR57","doi-asserted-by":"crossref","unstructured":"Wang C, Pan S, Long G, Zhu X, Jiang J (2017) Mgae: Marginalized graph autoencoder for graph clustering. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp 889\u2013898","DOI":"10.1145\/3132847.3132967"},{"key":"2117_CR58","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":"2117_CR59","unstructured":"Yang Z, Cohen W, Salakhudinov R (2016) Revisiting semi-supervised learning with graph embeddings. In: Proceedings of the 33nd International Conference on Machine Learning, pp 40\u201348"},{"key":"2117_CR60","unstructured":"Zhang H, Wu Q, Yan J, Wipf D, Yu PS (2021) From canonical correlation analysis to self-supervised graph neural networks. In: Proceedings of the Advances in Neural Information Processing Systems, pp 76\u201389"},{"key":"2117_CR61","doi-asserted-by":"crossref","unstructured":"Pan S, Hu R, Long G, Jiang J, Yao L, Zhang C (2018) Adversarially regularized graph autoencoder for graph embedding. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp 2609\u20132615","DOI":"10.24963\/ijcai.2018\/362"},{"key":"2117_CR62","unstructured":"Tang M, Li P, Yang C (2022) Graph auto-encoder via neighborhood wasserstein reconstruction. In: International Conference on Learning Representations"},{"key":"2117_CR63","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X-M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 3538\u20133545","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"2117_CR64","doi-asserted-by":"crossref","unstructured":"Sun K, Lin Z, Zhu Z (2020) Multi-stage self-supervised learning for graph convolutional networks on graphs with few labeled nodes. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 5892\u20135899","DOI":"10.1609\/aaai.v34i04.6048"},{"key":"2117_CR65","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2020) Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131"},{"key":"2117_CR66","unstructured":"Yang Z, Cohen W.W, Salakhutdinov R (2016) Revisiting semi-supervised learning with graph embeddings. In: Proceedings of the 33nd International Conference on Machine Learning, pp 40\u201348"},{"key":"2117_CR67","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: International Conference on Learning Representations"},{"key":"2117_CR68","unstructured":"Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp 249\u2013256"},{"issue":"1","key":"2117_CR69","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava N, Hinton G, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929\u20131958","journal-title":"J Mach Learn Res"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02117-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02117-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02117-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T08:23:16Z","timestamp":1723882996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02117-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,7]]},"references-count":69,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2117"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02117-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,7]]},"assertion":[{"value":"8 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}