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 "there are no bit parts for sign bits in black box attacks"):
  Abstract: We present a black-box adversarial attack algorithm which sets new state-of-the-art model evasion rates for query efficiency in the $\ell_\infty$ and $\ell_2$ metrics, where only loss-oracle access to the model is available. On two public black-box attack challenges, the algorithm achieves the highest evasion rate, surpassing all of the submitted attacks. Similar performance is observed on a model that is secure against substitute-model attacks. For standard models trained on the MNIST, CIFAR10, and IMAGENET datasets, averaged over the datasets and metrics, the algorithm is 3.8x less failure-prone, and spends in total 2.5x fewer queries than the current state-of-the-art attacks combined given a budget of 10, 000 queries per attack attempt. Notably, it requires no hyperparameter tuning or any data/time-dependent prior. The algorithm exploits a new approach, namely sign-based rather than magnitude-based gradient estimation. This shifts the estimation from continuous to binary black-box optimization. With three properties of the directional derivative, we examine three approaches to adversarial attacks. This yields a superior algorithm breaking a standard MNIST model using just 12 queries on average!

Includes members:
  Member "certified adversarial robustness via randomized smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "explaining vulnerabilities of deep learning to adversarial malware binaries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automatic generation of adversarial examples for interpreting malware classifiers")
  Member "a simple explanation for the existence of adversarial examples with small hamming distance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the security of randomized defenses against adversarial samples")
  Member "autozoom autoencoder based zeroth order optimization method for attacking black box neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey of black box adversarial attacks on computer vision models")
  Member "wild patterns ten years after the rise of adversarial machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vulnerabilities of connectionist ai applications evaluation and defence")
  Member "back to basics benchmarking canonical evolution strategies for playing atari":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "assuring the machine learning lifecycle desiderata methods and challenges")
  Member "adversarial deep learning for robust detection of binary encoded malware":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effectiveness of adversarial examples and defenses for malware classification")
  Member "exploring the space of black box attacks on deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "at gan an adversarial generator model for non constrained adversarial examples")

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)