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 "enhancing adversarial defense by k winners take all"):
  Abstract: We propose a simple change to existing neural network structures for better defending against gradient-based adversarial attacks. Instead of using popular activation functions (such as ReLU), we advocate the use of k-Winners-Take-All (k-WTA) activation, a C0 discontinuous function that purposely invalidates the neural network model's gradient at densely distributed input data points. The proposed k-WTA activation can be readily used in nearly all existing networks and training methods with no significant overhead. Our proposal is theoretically rationalized. We analyze why the discontinuities in k-WTA networks can largely prevent gradient-based search of adversarial examples and why they at the same time remain innocuous to the network training. This understanding is also empirically backed. We test k-WTA activation on various network structures optimized by a training method, be it adversarial training or not. In all cases, the robustness of k-WTA networks outperforms that of traditional networks under white-box attacks.

Includes members:
  Member "one pixel attack for fooling deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial ranking attack and defense")
  Member "certified adversarial robustness via randomized smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "quadratic suffices for over parametrization via matrix chernoff bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "over parameterized adversarial training an analysis overcoming the curse of dimensionality")
  Member "hopskipjumpattack a query efficient decision based attack":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial ranking attack and defense")
  Member "theoretically principled trade off between robustness and accuracy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "defensive quantization when efficiency meets robustness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "triple wins boosting accuracy robustness and efficiency together by enabling input adaptive inference")
  Member "benchmarking neural network robustness to common corruptions and perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "universal adversarial attack on attention and the resulting dataset damagenet")
  Member "adversarial training for free":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "overfitting in adversarially robust deep 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)