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 "parsimonious black box adversarial attacks via efficient combinatorial optimization"):
  Abstract: Solving for adversarial examples with projected gradient descent has been demonstrated to be highly effective in fooling the neural network based classifiers. However, in the black-box setting, the attacker is limited only to the query access to the network and solving for a successful adversarial example becomes much more difficult. To this end, recent methods aim at estimating the true gradient signal based on the input queries but at the cost of excessive queries. We propose an efficient discrete surrogate to the optimization problem which does not require estimating the gradient and consequently becomes free of the first order update hyperparameters to tune. Our experiments on Cifar-10 and ImageNet show the state of the art black-box attack performance with significant reduction in the required queries compared to a number of recently proposed methods. The source code is available at this https URL.

Includes members:
  Member "autozoom autoencoder based zeroth order optimization method for attacking black box neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of black box adversarial attacks on computer vision models")
  Member "black box adversarial attacks with limited queries and information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal adversarial attack on attention and the resulting dataset damagenet")
  Member "query efficient hard label black box attack an optimization based approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial ranking attack and defense")
  Member "practical black box attacks against machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adversarial ranking attack and defense")
  Member "transferability in machine learning from phenomena to black box attacks using adversarial samples":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial ranking attack and defense")
  Member "delving into transferable adversarial examples and black box attacks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")
  Member "wide residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning representations by predicting bags of visual words")

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)