human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a game based approximate verification of deep neural networks with provable guarantees"):
  Abstract: Despite the improved accuracy of deep neural networks, the discovery of adversarial examples has raised serious safety concerns. In this paper, we study two variants of pointwise robustness, the maximum safe radius problem, which for a given input sample computes the minimum distance to an adversarial example, and the feature robustness problem, which aims to quantify the robustness of individual features to adversarial perturbations. We demonstrate that, under the assumption of Lipschitz continuity, both problems can be approximated using finite optimisation by discretising the input space, and the approximation has provable guarantees, i.e., the error is bounded. We then show that the resulting optimisation problems can be reduced to the solution of two-player turn-based games, where the first player selects features and the second perturbs the image within the feature. While the second player aims to minimise the distance to an adversarial example, depending on the optimisation objective the first player can be cooperative or competitive. We employ an anytime approach to solve the games, in the sense of approximating the value of a game by monotonically improving its upper and lower bounds. The Monte Carlo tree search algorithm is applied to compute upper bounds for both games, and the Admissible A* and the Alpha-Beta Pruning algorithms are, respectively, used to compute lower bounds for the maximum safety radius and feature robustness games. When working on the upper bound of the maximum safe radius problem, our tool demonstrates competitive performance against existing adversarial example crafting algorithms. Furthermore, we show how our framework can be deployed to evaluate pointwise robustness of neural networks in safety-critical applications such as traffic sign recognition in self-driving cars.

Includes members:
  Member "scaling provable adversarial defenses":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "concolic testing for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "importance driven deep learning system testing")
  Member "global robustness evaluation of deep neural networks with provable guarantees for l0 norm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generating realistic unrestricted adversarial inputs using dual objective gan training")
  Member "reachability analysis of deep neural networks with provable guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "metrics and methods for robustness evaluation of neural networks with generative models")
  Member "efficient neural network robustness certification with general activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust deep reinforcement learning against adversarial perturbations on observations")
  Member "evaluating robustness of neural networks with mixed integer programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossless compression of deep neural networks")
  Member "provable defenses against adversarial examples via the convex outer adversarial polytope":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "feature guided black box safety testing of deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "importance driven deep learning system testing")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)