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 "magnet a two pronged defense against adversarial examples"):
  Abstract: Deep learning has shown promising results on hard perceptual problems in recent years. However, deep learning systems are found to be vulnerable to small adversarial perturbations that are nearly imperceptible to human. Such specially crafted perturbations cause deep learning systems to output incorrect decisions, with potentially disastrous consequences. These vulnerabilities hinder the deployment of deep learning systems where safety or security is important. Attempts to secure deep learning systems either target specific attacks or have been shown to be ineffective. #R##N#In this paper, we propose MagNet, a framework for defending neural network classifiers against adversarial examples. MagNet does not modify the protected classifier or know the process for generating adversarial examples. MagNet includes one or more separate detector networks and a reformer network. Different from previous work, MagNet learns to differentiate between normal and adversarial examples by approximating the manifold of normal examples. Since it does not rely on any process for generating adversarial examples, it has substantial generalization power. Moreover, MagNet reconstructs adversarial examples by moving them towards the manifold, which is effective for helping classify adversarial examples with small perturbation correctly. We discuss the intrinsic difficulty in defending against whitebox attack and propose a mechanism to defend against graybox attack. Inspired by the use of randomness in cryptography, we propose to use diversity to strengthen MagNet. We show empirically that MagNet is effective against most advanced state-of-the-art attacks in blackbox and graybox scenarios while keeping false positive rate on normal examples very low.

Includes members:
  Member "analysis of universal adversarial perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "uncertainty aware reinforcement learning for collision avoidance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planet of the bayesians reconsidering and improving deep planning network by incorporating bayesian inference")
  Member "adversarial examples for semantic segmentation and object detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "category wise attack transferable adversarial examples for anchor free object detection")
  Member "on the statistical detection of adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "anomalous instance detection in deep learning a survey")
  Member "adversarial perturbations against deep neural networks for malware classification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the security of randomized defenses against adversarial samples")
  Member "deep visual foresight for planning robot motion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transformation based adversarial video prediction on large scale data")
  Member "crafting adversarial input sequences for recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robustness verification for transformers")
  Member "practical black box attacks against machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adversarial ranking attack and defense")

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.CR(Cryptography and Security)