{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:20:24Z","timestamp":1774419624570,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,6]]},"DOI":"10.1109\/icassp49660.2025.10889569","type":"proceedings-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:52:43Z","timestamp":1741787563000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["GRACED: A Plug-and-Play Solution for Certifiable Graph Classification"],"prefix":"10.1109","author":[{"given":"Xiaoyu","family":"Liang","sequence":"first","affiliation":[{"name":"Beihang University,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haohua","family":"Du","sequence":"additional","affiliation":[{"name":"Beihang University,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Lu","sequence":"additional","affiliation":[{"name":"Beihang University,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Shang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-020-00479-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-12201-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3394520"},{"key":"ref4","first-page":"58088","article-title":"Adversarial training for graph neural networks: Pitfalls, solutions, and new directions","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Gosch"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371789"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2957786"},{"key":"ref7","first-page":"8317","article-title":"Certifiable robustness to graph perturbations","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Bojchevski"},{"key":"ref8","first-page":"17981","article-title":"Structured denoising diffusion models in discrete state-spaces","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Austin"},{"key":"ref9","first-page":"4474","article-title":"Permutation invariant graph generation via score-based generative modeling","volume-title":"Proc. 23th Int. Conf. Artif. Intell. and Statist","author":"Niu"},{"key":"ref10","first-page":"10362","article-title":"Score-based generative modeling of graphs via the system of stochastic differential equations","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Jo"},{"key":"ref11","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Wang"},{"key":"ref12","first-page":"1123","article-title":"Adversarial attack on graph structured data","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Dai"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484796"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482161"},{"key":"ref15","first-page":"1003","article-title":"Efficient robustness certificates for discrete data: Sparsity-aware ran-domized smoothing for graphs, images and more","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Bojchevski"},{"key":"ref16","first-page":"1310","article-title":"Certified adversarial robustness via randomized smoothing","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Cohen"},{"key":"ref17","first-page":"4911","article-title":"Tight certificates of adversarial robustness for randomly smoothed classifiers","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Lee"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467295"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref24","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Hamilton"},{"key":"ref25","article-title":"Hierarchical randomized smoothing","volume-title":"Proc. Adv. Neural Informat. Process. Syst","author":"Scholten"}],"event":{"name":"ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Hyderabad, India","start":{"date-parts":[[2025,4,6]]},"end":{"date-parts":[[2025,4,11]]}},"container-title":["ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10887540\/10887541\/10889569.pdf?arnumber=10889569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:23:48Z","timestamp":1774416228000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10889569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp49660.2025.10889569","relation":{},"subject":[],"published":{"date-parts":[[2025,4,6]]}}}