{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T21:50:00Z","timestamp":1769896200826,"version":"3.49.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003151","name":"Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies","doi-asserted-by":"crossref","award":["B2X-319955"],"award-info":[{"award-number":["B2X-319955"]}],"id":[{"id":"10.13039\/501100003151","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"crossref","award":["Accelerate IT30340"],"award-info":[{"award-number":["Accelerate IT30340"]}],"id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"crossref","award":["Accelerate IT30340"],"award-info":[{"award-number":["Accelerate IT30340"]}],"id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"crossref","award":["TKP2021-EGA-02"],"award-info":[{"award-number":["TKP2021-EGA-02"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"crossref","award":["TKP2021-EGA-02"],"award-info":[{"award-number":["TKP2021-EGA-02"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"crossref","award":["Autonomous Systems and Software Program"],"award-info":[{"award-number":["Autonomous Systems and Software Program"]}],"id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10618-025-01180-w","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:12:10Z","timestamp":1765530730000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Certifying robustness of graph convolutional networks for node perturbation with polyhedra abstract interpretation"],"prefix":"10.1007","volume":"40","author":[{"given":"Boqi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krist\u00f3f","family":"Marussy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oszk\u00e1r","family":"Semer\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunter","family":"Mussbacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Varr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"1180_CR1","unstructured":"Abbahaddou Y, Ennadir S, Lutzeyer JF, Vazirgiannis M, Bostr\u00f6m H (2024) Bounding the expected robustness of graph neural networks subject to node feature attacks. In: International Conference on Learning Representations (ICLR)"},{"issue":"1\u20132","key":"1180_CR2","first-page":"1","volume":"7","author":"A Albarghouthi","year":"2021","unstructured":"Albarghouthi A (2021) Introduction to neural network verification. Found Trends Program Lang 7(1\u20132):1\u2013157","journal-title":"Found Trends Program Lang"},{"key":"1180_CR3","unstructured":"Bastani O, Ioannou Y, Lampropoulos L, Vytiniotis D, Nori AV, Criminisi A (2016) Measuring neural net robustness with constraints. In: Proceedings of the 30th International Conference on Neural Information Processing Systems. NIPS\u201916, pp. 2621\u20132629"},{"key":"1180_CR4","unstructured":"Bojchevski A, Gasteiger J, G\u00fcnnemann S (2020) Efficient robustness certificates for discrete data: Sparsity-aware randomized smoothing for graphs, images and more. In: International Conference on Machine Learning, pp. 1003\u20131013. PMLR"},{"key":"1180_CR5","unstructured":"Bojchevski A, G\u00fcnnemann S (2019) Certifiable robustness to graph perturbations. Adv Neural Inf Process Syst. 32"},{"key":"1180_CR6","unstructured":"Bose AJ, Cianflone A, Hamilton WL (2019) Generalizable adversarial attacks with latent variable perturbation modelling. arXiv preprint arXiv:1905.10864"},{"key":"1180_CR7","doi-asserted-by":"crossref","unstructured":"Chen L, Li J, Peng Q, Liu Y, Zheng Z, Yang C (2021) Understanding structural vulnerability in graph convolutional networks. arXiv preprint arXiv:2108.06280","DOI":"10.24963\/ijcai.2021\/310"},{"key":"1180_CR8","unstructured":"Chen L, Li J, Peng J, Xie T, Cao Z, Xu K, He X, Zheng Z (2020) A survey of adversarial learning on graphs. arXiv preprint arXiv:2003.05730"},{"key":"1180_CR9","unstructured":"Cohen, J., Rosenfeld E, Kolter Z (2019) Certified adversarial robustness via randomized smoothing. In: International Conference on Machine Learning, pp. 1310\u20131320. PMLR"},{"key":"1180_CR10","doi-asserted-by":"publisher","DOI":"10.4324\/9780203771587","volume-title":"Statistical power analysis for the behavioral sciences","author":"J Cohen","year":"2013","unstructured":"Cohen J (2013) Statistical power analysis for the behavioral sciences. Routledge, Milton Park"},{"key":"1180_CR11","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 238\u2013252","DOI":"10.1145\/512950.512973"},{"key":"1180_CR12","doi-asserted-by":"crossref","unstructured":"Cousot P, Halbwachs N (1978) Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201396","DOI":"10.1145\/512760.512770"},{"key":"1180_CR13","unstructured":"Dai H, Li H, Tian T, Huang X, Wang L, Zhu J, Song L (2018) Adversarial attack on graph structured data. In: International Conference on Machine Learning, pp. 1115\u20131124. PMLR"},{"key":"1180_CR14","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, pp. 1811\u20131818","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"1180_CR15","unstructured":"Dvijotham KD, Hayes J, Balle B, Kolter Z, Qin C, Gyorgy A, Xiao K, Gowal S, Kohli P (2020) A framework for robustness certification of smoothed classifiers using f-divergences"},{"key":"1180_CR16","unstructured":"Ferrari C, Muller MN, Jovanovic N, Vechev M (2022) Complete verification via multi-neuron relaxation guided branch-and-bound. International Conference on Learning Representations"},{"key":"1180_CR17","doi-asserted-by":"crossref","unstructured":"Giles CL, Bollacker KD, Lawrence S (1998) Citeseer: An automatic citation indexing system. In: Proceedings of the Third ACM Conference on Digital Libraries, pp. 89\u201398","DOI":"10.1145\/276675.276685"},{"key":"1180_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-16-6054-2_8","volume-title":"Graph neural networks: foundations, frontiers, and applications","author":"S G\u00fcnnemann","year":"2022","unstructured":"G\u00fcnnemann S (2022) Graph neural networks: adversarial robustness. In: Wu L, Cui P, Pei J, Zhao L (eds) Graph neural networks: foundations, frontiers, and applications. Springer, Singapore, pp 149\u2013176"},{"issue":"02","key":"1180_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0218488598000094","volume":"6","author":"S Hochreiter","year":"1998","unstructured":"Hochreiter S (1998) The vanishing gradient problem during learning recurrent neural nets and problem solutions. Internat J Uncertain Fuzziness Knowl-Based Syst 6(02):107\u2013116","journal-title":"Internat J Uncertain Fuzziness Knowl-Based Syst"},{"key":"1180_CR20","unstructured":"Hojny C, Zhang S, Campos JS, Misener R (2024) Verifying message-passing neural networks via topology-based bounds tightening. arXiv preprint arXiv:2402.13937"},{"key":"1180_CR21","doi-asserted-by":"crossref","unstructured":"Jia J, Wang B, Cao X, Gong NZ (2020) Certified robustness of community detection against adversarial structural perturbation via randomized smoothing. In: Proceedings of The Web Conference 2020, pp. 2718\u20132724","DOI":"10.1145\/3366423.3380029"},{"key":"1180_CR22","first-page":"8463","volume":"33","author":"H Jin","year":"2020","unstructured":"Jin H, Shi Z, Peruri VJSA, Zhang X (2020) Certified robustness of graph convolution networks for graph classification under topological attacks. Adv Neural Inf Process Syst 33:8463\u20138474","journal-title":"Adv Neural Inf Process Syst"},{"key":"1180_CR23","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1180_CR24","unstructured":"Lee G-H, Yuan Y, Chang S, Jaakkola T (2019) Tight certificates of adversarial robustness for randomly smoothed classifiers. Adv Neural Inf Process Syst. 32"},{"key":"1180_CR25","first-page":"1309","volume":"2020","author":"Y Liu","year":"2020","unstructured":"Liu Y, Peng J, Chen L, Zheng Z (2020) Abstract interpretation based robustness certification for graph convolutional networks. Eur Conf Artif Intell 2020:1309\u20131315","journal-title":"Eur Conf Artif Intell"},{"issue":"3\u20134","key":"1180_CR26","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1561\/2400000035","volume":"4","author":"C Liu","year":"2021","unstructured":"Liu C, Arnon T, Lazarus C, Strong C, Barrett C, Kochenderfer MJ (2021) Algorithms for verifying deep neural networks. Found Trends Optim 4(3\u20134):244\u2013404","journal-title":"Found Trends Optim"},{"key":"1180_CR27","first-page":"4756","volume":"33","author":"J Ma","year":"2020","unstructured":"Ma J, Ding S, Mei Q (2020) Towards more practical adversarial attacks on graph neural networks. Adv Neural Inf Process Syst 33:4756\u20134766","journal-title":"Adv Neural Inf Process Syst"},{"key":"1180_CR28","unstructured":"Ma Y, Wang S, Derr T, Wu L, Tang J (2019) Attacking graph convolutional networks via rewiring. arXiv preprint arXiv:1906.03750"},{"key":"1180_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"AK McCallum","year":"2000","unstructured":"McCallum AK, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retrieval 3:127\u2013163","journal-title":"Inf Retrieval"},{"key":"1180_CR30","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1109\/LCSYS.2022.3182547","volume":"6","author":"P-J Meyer","year":"2022","unstructured":"Meyer P-J (2022) Reachability analysis of neural networks using mixed monotonicity. IEEE Control Syst Lett 6:3068\u20133073","journal-title":"IEEE Control Syst Lett"},{"issue":"1","key":"1180_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s41109-024-00611-9","volume":"9","author":"BA Miller","year":"2024","unstructured":"Miller BA, Chan K, Eliassi-Rad T (2024) Complex network effects on the robustness of graph convolutional networks. Appl Netw Sci 9(1):5","journal-title":"Appl Netw Sci"},{"key":"1180_CR32","unstructured":"Najafi M, Yu PS (2021) An introduction to robust graph convolutional networks. arXiv preprint arXiv:2103.14807"},{"key":"1180_CR33","unstructured":"Osselin P, Kenlay H, Dong X (2023) Structure-aware robustness certificates for graph classification. In: Uncertainty in Artificial Intelligence, pp. 1596\u20131605. PMLR"},{"key":"1180_CR34","unstructured":"Pei H, Wei B, Chang KC-C, Lei Y, Yang B (2020) Geom-gcn: Geometric graph convolutional networks. In: International Conference on Learning Representations"},{"issue":"2","key":"1180_CR35","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","journal-title":"J Complex Netw"},{"key":"1180_CR36","doi-asserted-by":"crossref","unstructured":"S\u00e4lzer M, Lange M (2021) Reachability is np-complete even for the simplest neural networks. In: Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 25\u201327, 2021, Proceedings 15, pp. 149\u2013164. Springer","DOI":"10.1007\/978-3-030-89716-1_10"},{"key":"1180_CR37","unstructured":"Scholten Y, Schuchardt J, Bojchevski A, G\u00fcnnemann S (2024) Hierarchical randomized smoothing. Adv Neural Inf Process Syst. 36"},{"key":"1180_CR38","unstructured":"Schuchardt J, Bojchevski A, Gasteiger J, G\u00fcnnemann S (2021) Collective robustness certificates: exploiting interdependence in graph neural networks. In: International Conference on Learning Representations"},{"issue":"3","key":"1180_CR39","first-page":"93","volume":"29","author":"P Sen","year":"2008","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","journal-title":"AI Mag"},{"key":"1180_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290354","volume":"3","author":"G Singh","year":"2019","unstructured":"Singh G, Gehr T, P\u00fcschel M, Vechev M (2019) An abstract domain for certifying neural networks. Proc ACM Program Lang 3:1\u201330","journal-title":"Proc ACM Program Lang"},{"key":"1180_CR41","unstructured":"Singh G, Gehr T, Mirman M, P\u00fcschel M, Vechev M (2018) Fast and effective robustness certification. Adv Neural Inf Process Syst. 31"},{"issue":"8","key":"1180_CR42","first-page":"7693","volume":"35","author":"L Sun","year":"2022","unstructured":"Sun L, Dou Y, Yang C, Zhang K, Wang J, Philip SY, He L, Li B (2022) Adversarial attack and defense on graph data: a survey. IEEE Trans Knowl Data Eng 35(8):7693\u20137711","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1180_CR43","doi-asserted-by":"crossref","unstructured":"Sun M, Jiang Y, Wang Y, Xie H, Wang Z (2020) Identification of critical nodes in dynamic systems based on graph convolutional networks. In: 2020 3rd International Conference on Unmanned Systems (ICUS), pp. 558\u2013563","DOI":"10.1109\/ICUS50048.2020.9274812"},{"key":"1180_CR44","doi-asserted-by":"crossref","unstructured":"Sun Y, Wang S, Tang X, Hsieh T-Y, Honavar V (2020) Adversarial attacks on graph neural networks via node injections: a hierarchical reinforcement learning approach. In: Proceedings of The Web Conference 2020. WWW\u201920, pp. 673\u2013683","DOI":"10.1145\/3366423.3380149"},{"key":"1180_CR45","unstructured":"Szegedy C, Zaremba W, Sutskever I, Bruna J, Erhan D, Goodfellow I, Fergus R (2013) Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199"},{"key":"1180_CR46","doi-asserted-by":"crossref","unstructured":"Takahashi T (2019) Indirect adversarial attacks via poisoning neighbors for graph convolutional networks. In: 2019 IEEE International Conference on Big Data (Big Data), pp. 1395\u20131400. IEEE","DOI":"10.1109\/BigData47090.2019.9006004"},{"key":"1180_CR47","doi-asserted-by":"crossref","unstructured":"Tao S, Cao Q, Shen H, Huang J, Wu Y Cheng X (2021) Single node injection attack against graph neural networks. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 1794\u20131803","DOI":"10.1145\/3459637.3482393"},{"key":"1180_CR48","doi-asserted-by":"crossref","unstructured":"Tao S, Cao Q, Shen H, Wu Y, Hou L, Cheng, X (2023) Graph adversarial immunization for certifiable robustness. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2023.3311105"},{"key":"1180_CR49","unstructured":"Tjeng V, Xiao K, Tedrake R (2019) Evaluating robustness of neural networks with mixed integer programming. International Conference on Learning Representations"},{"key":"1180_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3428253","volume":"4","author":"C Urban","year":"2020","unstructured":"Urban C, Christakis M, W\u00fcstholz V, Zhang F (2020) Perfectly parallel fairness certification of neural networks. Proc ACM Program Lang 4:1\u201330","journal-title":"Proc ACM Program Lang"},{"key":"1180_CR51","first-page":"6369","volume":"31","author":"S Wang","year":"2018","unstructured":"Wang S, Pei K, Whitehouse J, Yang J, Jana S (2018) Efficient formal safety analysis of neural networks. Adv Neural Inf Process Syst 31:6369\u20136379","journal-title":"Adv Neural Inf Process Syst"},{"key":"1180_CR52","unstructured":"Wang X, Cheng M, Eaton J, Hsieh C-J, Wu F (2018) Attack graph convolutional networks by adding fake nodes. arXiv preprint arXiv:1810.10751"},{"key":"1180_CR53","doi-asserted-by":"crossref","unstructured":"Wang B, Gong NZ (2019) Attacking graph-based classification via manipulating the graph structure. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2023\u20132040","DOI":"10.1145\/3319535.3354206"},{"key":"1180_CR54","doi-asserted-by":"crossref","unstructured":"Wang B, Jia J, Cao X, Gong NZ (2021) Certified robustness of graph neural networks against adversarial structural perturbation. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 1645\u20131653","DOI":"10.1145\/3447548.3467295"},{"key":"1180_CR55","unstructured":"Wang S, Pei K, Whitehouse J, Yang J, Jana S (2018) Formal security analysis of neural networks using symbolic intervals. In: 27th USENIX Security Symposium (USENIX Security 18), pp. 1599\u20131614"},{"key":"1180_CR56","unstructured":"Wang S, Zhang H, Xu K, Lin X, Jana S, Hsieh C-J, Kolter JZ (2021) Beta-CROWN: Efficient bound propagation with per-neuron split constraints for complete and incomplete neural network verification. Adv Neural Inf Process Syst. 34"},{"key":"1180_CR57","doi-asserted-by":"crossref","unstructured":"Xu K, Chen H, Liu S, Chen P-Y, Weng T-W, Hong, M, Lin X (2019) Topology attack and defense for graph neural networks: an optimization perspective. International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2019\/550"},{"key":"1180_CR58","unstructured":"Xu K, Zhang H, Wang S, Wang Y, Jana S, Lin X, Hsieh C-J (2021) Fast and Complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers. In: International Conference on Learning Representations"},{"key":"1180_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105893","volume":"198","author":"E-Y Yu","year":"2020","unstructured":"Yu E-Y, Wang Y-P, Fu Y, Chen D-B, Xie M (2020) Identifying critical nodes in complex networks via graph convolutional networks. Knowl-Based Syst 198:105893","journal-title":"Knowl-Based Syst"},{"issue":"26","key":"1180_CR60","doi-asserted-by":"publisher","first-page":"18851","DOI":"10.1007\/s00521-023-08839-9","volume":"35","author":"Z Zhai","year":"2023","unstructured":"Zhai Z, Li P, Feng S (2023) State of the art on adversarial attacks and defenses in graphs. Neural Comput Appl 35(26):18851\u201318872","journal-title":"Neural Comput Appl"},{"key":"1180_CR61","first-page":"4939","volume":"31","author":"H Zhang","year":"2018","unstructured":"Zhang H, Weng T-W, Chen P-Y, Hsieh C-J, Daniel L (2018) Efficient neural network robustness certification with general activation functions. Adv Neural Inf Process Syst 31:4939\u20134948","journal-title":"Adv Neural Inf Process Syst"},{"key":"1180_CR62","doi-asserted-by":"crossref","unstructured":"Zou X, Zheng Q, Dong Y, Guan X, Kharlamov E, Lu J, Tang J (2021) Tdgia: Effective injection attacks on graph neural networks. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 2461\u20132471","DOI":"10.1145\/3447548.3467314"},{"key":"1180_CR63","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner D, Akbarnejad A, G\u00fcnnemann S (2018) Adversarial attacks on neural networks for graph data. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2847\u20132856","DOI":"10.1145\/3219819.3220078"},{"key":"1180_CR64","unstructured":"Z\u00fcgner D, G\u00fcnnemann S (2019) Adversarial attacks on graph neural networks via meta learning. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019"},{"key":"1180_CR65","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner D, G\u00fcnnemann S (2019) Certifiable robustness and robust training for graph convolutional networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 246\u2013256","DOI":"10.1145\/3292500.3330905"},{"key":"1180_CR66","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner D, G\u00fcnnemann S (2020) Certifiable robustness of graph convolutional networks under structure perturbations. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1656\u20131665","DOI":"10.1145\/3394486.3403217"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01180-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01180-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01180-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:54:14Z","timestamp":1769849654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01180-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01180-w","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"9 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"11"}}