{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:08:12Z","timestamp":1779365292174,"version":"3.53.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Tianjin Special Fund for Guiding Technological Innovation","award":["23YDTPJC00910"],"award-info":[{"award-number":["23YDTPJC00910"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s00371-026-04508-9","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:34:36Z","timestamp":1777732476000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing link prediction accuracy with VG-GIN: a fusion of variational graph auto-encoders and graph isomorphism networks"],"prefix":"10.1007","volume":"42","author":[{"given":"Wentao","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijuan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yutong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,2]]},"reference":[{"key":"4508_CR1","doi-asserted-by":"publisher","first-page":"60588","DOI":"10.1109\/ACCESS.2021.3071274","volume":"9","author":"NA Asif","year":"2021","unstructured":"Asif, N.A., Sarker, Y., Chakrabortty, R.K., Ryan, M.J., Tasneem, Z.: Graph neural network: a comprehensive review on non-Euclidean space. IEEE Access 9, 60588\u201360606 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3071274","journal-title":"IEEE Access"},{"key":"4508_CR2","doi-asserted-by":"publisher","first-page":"28668","DOI":"10.1109\/ACCESS.2020.2972072","volume":"8","author":"J Li","year":"2020","unstructured":"Li, J., Peng, J., Liu, S., Ji, X., Li, X., Hu, X.: Link prediction in directed networks utilizing the role of reciprocal links. IEEE Access 8, 28668\u201328680 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2972072","journal-title":"IEEE Access"},{"issue":"5","key":"4508_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.48550\/arXiv.2011.02260","volume":"55","author":"S Wu","year":"2022","unstructured":"Wu, S., Sun, F., Zhang, W., Xie, X., Cui, B.: Graph neural networks in recommender systems: a survey. ACM Comput. Surv. 55(5), 1\u201337 (2022). https:\/\/doi.org\/10.48550\/arXiv.2011.02260","journal-title":"ACM Comput. Surv."},{"key":"4508_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-025-06325-4","volume":"55","author":"AA Yusuf","year":"2025","unstructured":"Yusuf, A.A., Feng, C., Mao, X., Li, X., Haruna, Y., Duma, R.A.: Multi-scale dual-stream visual feature extraction and graph reasoning for visual question answering. Appl. Intell. 55, 544 (2025). https:\/\/doi.org\/10.1007\/s10489-025-06325-4","journal-title":"Appl. Intell."},{"key":"4508_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-025-03981-y","author":"L Zhu","year":"2025","unstructured":"Zhu, L., Han, D., Shen, X., Chen, C., Li, K.: Enhancing image\u2013text matching through multi-level semantic consistency alignment. Vis. Comput. (2025). https:\/\/doi.org\/10.1007\/s00371-025-03981-y","journal-title":"Vis. Comput."},{"key":"4508_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.024","volume":"187","author":"P Goyal","year":"2020","unstructured":"Goyal, P., Chhetri, S.R., Canedo, A.: dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl.-Based Syst. 187, 104816 (2020). https:\/\/doi.org\/10.1016\/j.knosys.2019.06.024","journal-title":"Knowl.-Based Syst."},{"issue":"3","key":"4508_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the Web. Social Netw 25(3), 211\u2013230 (2003). https:\/\/doi.org\/10.1016\/S0378-8733(03)00009-1","journal-title":"Social Netw"},{"key":"4508_CR8","doi-asserted-by":"publisher","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 855\u2013864 (2016). https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"4508_CR9","doi-asserted-by":"publisher","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 701\u2013710 (2014). https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"4508_CR10","doi-asserted-by":"publisher","unstructured":"Gilmer, J., Schoenholz, S., Riley, P., Vinyals, O., Dahl, G.: Neural message passing for Quantum chemistry. In: Proceedings of the 34th international conference on machine learning, pp. 1263\u20131272 (2017). https:\/\/doi.org\/10.5555\/3305381.3305512","DOI":"10.5555\/3305381.3305512"},{"key":"4508_CR11","doi-asserted-by":"publisher","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the twelfth international conference on Information and knowledge management, pp. 556\u2013559 (2003). https:\/\/doi.org\/10.1145\/956863.956972","DOI":"10.1145\/956863.956972"},{"key":"4508_CR12","doi-asserted-by":"publisher","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: Proceedings of the 32nd international conference on neural information processing systems, pp. 5171\u20135181 (2018). https:\/\/doi.org\/10.48550\/arXiv.1802.09691","DOI":"10.48550\/arXiv.1802.09691"},{"key":"4508_CR13","doi-asserted-by":"publisher","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016). https:\/\/doi.org\/10.48550\/arXiv.1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"key":"4508_CR14","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017). https:\/\/doi.org\/10.48550\/arXiv.1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"4508_CR15","doi-asserted-by":"publisher","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016). https:\/\/doi.org\/10.48550\/arXiv.1611.07308","DOI":"10.48550\/arXiv.1611.07308"},{"key":"4508_CR16","doi-asserted-by":"publisher","unstructured":"Li, Q., Han, Z., Wu, X.M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI conference on artificial intelligence, vol 32 (2018). https:\/\/doi.org\/10.48550\/arXiv.1801.07606","DOI":"10.48550\/arXiv.1801.07606"},{"key":"4508_CR17","doi-asserted-by":"publisher","unstructured":"Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., Sun, X.: Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In: National conference on artificial intelligence association for the advancement of artificial intelligence, vol 34, pp 3438\u20133445 (2020). https:\/\/doi.org\/10.1609\/AAAI.V34I04.5747","DOI":"10.1609\/AAAI.V34I04.5747"},{"key":"4508_CR18","doi-asserted-by":"publisher","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks?. arXiv preprint arXiv:1810.00826 (2018). https:\/\/doi.org\/10.48550\/arXiv.1810.00826","DOI":"10.48550\/arXiv.1810.00826"},{"key":"4508_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00371-023-02780-7","volume":"40","author":"Z Cai","year":"2024","unstructured":"Cai, Z., Zhang, S., Guo, P., Zhang, J., Hu, L.: AM-RP stacking PILers: random projection stacking pseudoinverse learning algorithm based on attention mechanism. Vis. Comput. 40, 273\u2013285 (2024). https:\/\/doi.org\/10.1007\/s00371-023-02780-7","journal-title":"Vis. Comput."},{"key":"4508_CR20","doi-asserted-by":"publisher","unstructured":"Li, G., Xiong, C., Thabet, A., Ghanem, B.: DeeperGCN: All you need to train deeper gcns. arXiv preprint arXiv:2006.07739 (2020). https:\/\/doi.org\/10.48550\/arXiv.2006.07739","DOI":"10.48550\/arXiv.2006.07739"},{"key":"4508_CR21","doi-asserted-by":"publisher","unstructured":"Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: Proceedings of the 30th international conference on neural information processing systems, pp. 3844\u20133852 (2016). https:\/\/doi.org\/10.5555\/3157382.3157527","DOI":"10.5555\/3157382.3157527"},{"key":"4508_CR22","doi-asserted-by":"publisher","unstructured":"Oono, K., Suzuki, T.: Graph neural networks exponentially lose expressive power for node classification. arXiv preprint arXiv:1905.10947 (2019). https:\/\/doi.org\/10.48550\/arXiv.1905.10947","DOI":"10.48550\/arXiv.1905.10947"},{"key":"4508_CR23","unstructured":"Ma, J., Cui, P., Kuang, K., Wang, X., Zhu, W.: Disentangled graph convolutional networks. In: International conference on machine learning, PMLR, pp. 4212\u20134221 (2019). https:\/\/proceedings.mlr.press\/v97\/ma19a"},{"key":"4508_CR24","doi-asserted-by":"publisher","unstructured":"Grover, A., Zweig, A., Ermon, S.: Graphite: Iterative generative modeling of graphs. In: International conference on machine learning, PMLR, pp. 2434\u20132444 (2019). https:\/\/doi.org\/10.48550\/arXiv.1803.10459","DOI":"10.48550\/arXiv.1803.10459"},{"key":"4508_CR25","doi-asserted-by":"publisher","unstructured":"Seong, J., MyoungHo, K.: Variational graph normalized AutoEncoders. In: Proceedings of the 30th ACM international conference on information and knowledge management (CIKM \u201921), pp. 2827\u20132831 (2021). https:\/\/doi.org\/10.1145\/3459637.3482215","DOI":"10.1145\/3459637.3482215"},{"key":"4508_CR26","doi-asserted-by":"publisher","unstructured":"Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph autoencoder for graph embedding. In: Proceedings of the 27th international joint conference on artificial intelligence, pp. 2609\u20132615 (2018). https:\/\/doi.org\/10.5555\/3304889.3305023","DOI":"10.5555\/3304889.3305023"},{"key":"4508_CR27","doi-asserted-by":"publisher","first-page":"55204","DOI":"10.1109\/ACCESS.2023.3278271","volume":"11","author":"C Xie","year":"2023","unstructured":"Xie, C., Wen, X., Meng, F., Pang, H.: Random walk graph auto-encoders with ensemble networks in graph embedding. IEEE Access 11, 55204\u201355211 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3278271","journal-title":"IEEE Access"},{"key":"4508_CR28","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.2648","author":"C Xie","year":"2025","unstructured":"Xie, C., Huang, J., Shi, Y., Pang, H., Gao, L., Wen, X.: Ensemble graph auto-encoders for clustering and link prediction. PeerJ Comput. Sci. (2025). https:\/\/doi.org\/10.7717\/peerj-cs.2648","journal-title":"PeerJ Comput. Sci."},{"issue":"1","key":"4508_CR29","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/TPAMI.2022.3154319","volume":"45","author":"G Bouritsas","year":"2022","unstructured":"Bouritsas, G., Frasca, F., Zafeiriou, S., Bronstein, M.: Improving graph neural network expressivity via subgraph isomorphism counting. IEEE Trans. Pattern Anal. Mach. Intell. 45(1), 657\u2013668 (2022). https:\/\/doi.org\/10.1109\/TPAMI.2022.3154319","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"4508_CR30","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1111\/tgis.13201","volume":"28","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Liu, J., Wang, Y., Cao, Y., Xu, S., Luo, A.: Graph isomorphism network with weighted multi-aggregators for building shape classification. Trans. GIS 28(6), 1883\u20131904 (2024). https:\/\/doi.org\/10.1111\/tgis.13201","journal-title":"Trans. GIS"},{"key":"4508_CR31","doi-asserted-by":"publisher","first-page":"168344","DOI":"10.1109\/ACCESS.2020.3022850","volume":"8","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Lin, Y., Jing, X., Zhang, H., Huang, Y., Luo, G.: Enhanced graph isomorphism network for molecular ADMET properties prediction. IEEE Access 8, 168344\u2013168360 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3022850","journal-title":"IEEE Access"},{"issue":"9","key":"4508_CR32","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.3390\/math12091315","volume":"12","author":"L Yin","year":"2024","unstructured":"Yin, L., Chen, W., Luo, X.: Efficient large-scale IoT botnet detection through GraphSAINT-based subgraph sampling and graph isomorphism network. Mathematics 12(9), 1315 (2024). https:\/\/doi.org\/10.3390\/math12091315","journal-title":"Mathematics"},{"key":"4508_CR33","doi-asserted-by":"publisher","unstructured":"Wang, X., Ji, H., Shi, C., Wang, B., Cui, P., Yu, P.S., Ye, Y.: Heterogeneous graph attention network. In: The world wide web conference, pp. 2022\u20132032 (2019). https:\/\/doi.org\/10.1145\/3308558.3313562","DOI":"10.1145\/3308558.3313562"},{"key":"4508_CR34","doi-asserted-by":"publisher","unstructured":"Huang, B., Carley, K.: Residual or gate? Towards deeper graph neural networks for inductive graph representation learning. arXiv preprint arXiv:1904.08035 (2019). https:\/\/doi.org\/10.48550\/arXiv.1904.08035","DOI":"10.48550\/arXiv.1904.08035"},{"key":"4508_CR35","doi-asserted-by":"publisher","unstructured":"Beck, D., Haffari, G., Cohn, T.: Graph-to-sequence learning using gated graph neural networks. arXiv preprint arXiv:1806.09835 (2018). https:\/\/doi.org\/10.48550\/arXiv.1806.09835","DOI":"10.48550\/arXiv.1806.09835"},{"key":"4508_CR36","doi-asserted-by":"publisher","unstructured":"Li, Y., Tarlow, D., Brockschmidt, M., Zemel, R.: Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493 (2015). https:\/\/doi.org\/10.48550\/arXiv.1511.05493","DOI":"10.48550\/arXiv.1511.05493"},{"key":"4508_CR37","unstructured":"Ma, G., Vo, V., Willke, T., Ahmed, N.: Cache-memory gated graph neural networks. In: Proceedings of 36th Conference on Neural Information Processing Systems (2022)."},{"key":"4508_CR38","doi-asserted-by":"publisher","unstructured":"Jin, W., Derr, T., Wang, Y., Ma, Y., Liu, Z., Tang, J.: Node similarity preserving graph convolutional networks. In: WSDM\u201921: the fourteenth ACM international conference on web search and data mining, pp. 148\u2013156 (2021). https:\/\/doi.org\/10.1145\/3437963.3441735","DOI":"10.1145\/3437963.3441735"},{"key":"4508_CR39","doi-asserted-by":"publisher","unstructured":"Zhu, D., Zhang, Z., Cui, P., Zhu, W.: Robust graph convolutional networks against adversarial attacks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1399\u20131407 (2019). https:\/\/doi.org\/10.1145\/3292500.333085","DOI":"10.1145\/3292500.333085"},{"key":"4508_CR40","doi-asserted-by":"publisher","unstructured":"Jovanovi\u0107, N., Meng, Z., Faber, L., Wattenhofer, R.: Towards robust graph contrastive learning. arXiv preprint arXiv:2102.13085 (2021). https:\/\/doi.org\/10.48550\/arXiv.2102.13085","DOI":"10.48550\/arXiv.2102.13085"},{"key":"4508_CR41","doi-asserted-by":"publisher","unstructured":"Zhang, X., Zitnik, M.: GNNGuard: Defending graph neural networks against adversarial attacks. In: Advances in neural information processing systems, vol 33, pp 9263\u20139275 (2020). https:\/\/doi.org\/10.48550\/arXiv.2006.08149","DOI":"10.48550\/arXiv.2006.08149"},{"issue":"1","key":"4508_CR42","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/TKDE.2021.3088844","volume":"35","author":"J Zhou","year":"2023","unstructured":"Zhou, J., Chen, Z., Du, M., Chen, L., Yu, S., Chen, G., Xuan, Q.: RobustECD: enhancement of network structure for robust community detection. IEEE Trans. Autom. Control 35(1), 842\u2013856 (2023). https:\/\/doi.org\/10.1109\/TKDE.2021.3088844","journal-title":"IEEE Trans. Autom. Control"},{"key":"4508_CR43","doi-asserted-by":"publisher","unstructured":"Tang, X., Li, Y., Sun, Y., Yao, H., Wang, S.: Transferring robustness for graph neural network against poisoning attacks. In: WSDM\u201920: the thirteenth ACM international conference on web search and data mining, pp. 600\u2013608 (2020). https:\/\/doi.org\/10.1145\/3336191.3371851","DOI":"10.1145\/3336191.3371851"},{"key":"4508_CR44","doi-asserted-by":"publisher","unstructured":"Geisler, S., Schmidt, T., Irin, H., Z\u00fcgner, D., Bojchevski, A., G\u00fcnnemann, S.: Robustness of graph neural networks at scale. In: Advances in neural information processing systems, pp 7637\u20137649 (2021). https:\/\/doi.org\/10.48550\/arXiv.2110.14038","DOI":"10.48550\/arXiv.2110.14038"},{"issue":"1","key":"4508_CR45","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"4508_CR46","doi-asserted-by":"publisher","unstructured":"Shi, S., Qiao, K., Yang, J., Song, B., Chen, J., Yan, B.: RF-GNN: random forest boosted graph neural network for social bot detection. arXiv preprint arXiv:2304.08239 (2023). https:\/\/doi.org\/10.48550\/arXiv.2304.08239","DOI":"10.48550\/arXiv.2304.08239"},{"issue":"5","key":"4508_CR47","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbaa391","volume":"22","author":"Q Wu","year":"2021","unstructured":"Wu, Q., Xia, J., Ni, J., Zheng, C.: GAERF: predicting lncRNA-disease associations by graph auto-encoder and random forest. Brief. Bioinform. 22(5), bbaa391 (2021). https:\/\/doi.org\/10.1093\/bib\/bbaa391","journal-title":"Brief. Bioinform."},{"issue":"1","key":"4508_CR48","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1186\/s12859-024-05687-9","volume":"25","author":"H Kuang","year":"2024","unstructured":"Kuang, H., Zhang, Z., Zeng, B., Liu, X., Zuo, H., Xu, X., Wang, L.: A novel microbe-drug association prediction model based on graph attention networks and bilayer random forest. BMC Bioinformatics 25(1), 78 (2024). https:\/\/doi.org\/10.1186\/s12859-024-05687-9","journal-title":"BMC Bioinformatics"},{"key":"4508_CR49","doi-asserted-by":"publisher","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018). https:\/\/doi.org\/10.48550\/arXiv.1811.05868","DOI":"10.48550\/arXiv.1811.05868"},{"key":"4508_CR50","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"4508_CR51","doi-asserted-by":"publisher","unstructured":"Liang, H. , Gao, J.: How neural processes improve graph link prediction. In: ICASSP 2022-2022 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp. 3543\u20133547 (2022). https:\/\/doi.org\/10.1109\/ICASSP43922.2022.9746010","DOI":"10.1109\/ICASSP43922.2022.9746010"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-026-04508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-026-04508-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-026-04508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T11:42:32Z","timestamp":1779363752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-026-04508-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":51,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["4508"],"URL":"https:\/\/doi.org\/10.1007\/s00371-026-04508-9","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"20 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"This paper does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"278"}}