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 "one bit matters understanding adversarial examples as the abuse of redundancy"):
  Abstract: Despite the great success achieved in machine learning (ML), adversarial examples have caused concerns with regards to its trustworthiness: A small perturbation of an input results in an arbitrary failure of an otherwise seemingly well-trained ML model. While studies are being conducted to discover the intrinsic properties of adversarial examples, such as their transferability and universality, there is insufficient theoretic analysis to help understand the phenomenon in a way that can influence the design process of ML experiments. In this paper, we deduce an information-theoretic model which explains adversarial attacks as the abuse of feature redundancies in ML algorithms. We prove that feature redundancy is a necessary condition for the existence of adversarial examples. Our model helps to explain some major questions raised in many anecdotal studies on adversarial examples. Our theory is backed up by empirical measurements of the information content of benign and adversarial examples on both image and text datasets. Our measurements show that typical adversarial examples introduce just enough redundancy to overflow the decision making of an ML model trained on corresponding benign examples. We conclude with actionable recommendations to improve the robustness of machine learners against adversarial examples.

Includes members:
  Member "characterizing adversarial subspaces using local intrinsic dimensionality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "anomalous instance detection in deep learning a survey")
  Member "adversarial spheres":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "utilizing network properties to detect erroneous inputs")
  Member "a practical approach to sizing neural networks":
    also connected through other hyperedges:
      (none)
  Member "the helmholtz method using perceptual compression to reduce machine learning complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a practical approach to sizing neural networks")
  Member "feature distillation dnn oriented jpeg compression against adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an empirical evaluation of perturbation based defenses")
  Member "audio adversarial examples targeted attacks on speech to text":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "advbox a toolbox to generate adversarial examples that fool neural networks")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial ranking attack and defense")
  Member "adversarial attacks on neural network policies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")

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)