Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
The paper presents a framework to certify the robustness of graph neural networks where the adversary has a limited budget for changing edges in the network. All three reviewers found the work interesting, significant, and of high quality. The author response was highly responsive to reviewer comments and included a sketch of a requested NP-completeness proof. The AC recommends accept.