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 "man in the middle attacks against machine learning classifiers via malicious generative models"):
  Abstract: Deep Neural Networks (DNNs) are vulnerable to deliberately crafted adversarial examples. In the past few years, many efforts have been spent on exploring query-optimisation attacks to find adversarial examples of either black-box or white-box DNN models, as well as the defending countermeasures against those attacks. In this work, we explore vulnerabilities of DNN models under the umbrella of Man-in-the-Middle (MitM) attacks, which has not been investigated before. From the perspective of an MitM adversary, the aforementioned adversarial example attacks are not viable anymore. First, such attacks must acquire the outputs from the models by multiple times before actually launching attacks, which is difficult for the MitM adversary in practice. Second, such attacks are one-off and cannot be directly generalised onto new data examples, which decreases the rate of return for the attacker. In contrast, using generative models to craft adversarial examples on the fly can mitigate the drawbacks. However, the adversarial capability of the generative models, such as Variational Auto-Encoder (VAE), has not been extensively studied. Therefore, given a classifier, we investigate using a VAE decoder to either transform benign inputs to their adversarial counterparts or decode outputs from benign VAE encoders to be adversarial examples. The proposed method can endue more capability to MitM attackers. Based on our evaluation, the proposed attack can achieve above 95% success rate on both MNIST and CIFAR10 datasets, which is better or comparable with state-of-the-art query-optimisation attacks. At the meantime, the attack is 104 times faster than the query-optimisation attacks.

Includes members:
  Member "diagnosing and enhancing vae models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ae ot gan training gans from data specific latent distribution")
  Member "semantic adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "breaking certified defenses semantic adversarial examples with spoofed robustness certificates")
  Member "model reuse attacks on deep learning systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sentinet detecting localized universal attacks against deep learning systems")
  Member "zeroth order stochastic variance reduction for nonconvex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an efficient and general framework of robust training for graph neural networks")
  Member "genattack practical black box attacks with gradient free optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "one man s trash is another man s treasure resisting adversarial examples by adversarial examples")
  Member "generating adversarial examples with adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "category wise attack transferable adversarial examples for anchor free object detection")
  Member "black box adversarial attacks with limited queries and information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "universal adversarial attack on attention and the resulting dataset damagenet")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    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)