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 "universal rules for fooling deep neural networks based text classification"):
  Abstract: Recently, deep learning based natural language processing techniques are being extensively used to deal with spam mail, censorship evaluation in social networks, among others. However, there is only a couple of works evaluating the vulnerabilities of such deep neural networks. Here, we go beyond attacks to investigate, for the first time, universal rules, i.e., rules that are sample agnostic and therefore could turn any text sample in an adversarial one. In fact, the universal rules do not use any information from the method itself (no information from the method, gradient information or training dataset information is used), making them black-box universal attacks. In other words, the universal rules are sample and method agnostic. By proposing a coevolutionary optimization algorithm we show that it is possible to create universal rules that can automatically craft imperceptible adversarial samples (only less than five perturbations which are close to misspelling are inserted in the text sample). A comparison with a random search algorithm further justifies the strength of the method. Thus, universal rules for fooling networks are here shown to exist. Hopefully, the results from this work will impact the development of yet more sample and model agnostic attacks as well as their defenses, culminating in perhaps a new age for artificial intelligence.

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 "black box generation of adversarial text sequences to evade deep learning classifiers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "humpty dumpty controlling word meanings via corpus poisoning")
  Member "deep text classification can be fooled":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "humpty dumpty controlling word meanings via corpus poisoning")
  Member "self organizing classifiers and niched fitness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "one pixel attack for fooling deep neural networks")
  Member "spectrum diverse neuroevolution with unified neural models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evolving robust neural architectures to defend from adversarial attacks")
  Member "practical black box attacks against machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial ranking attack and defense")
  Member "universal adversarial perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")
  Member "practical black box attacks against deep learning systems using adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vulnerabilities of connectionist ai applications evaluation and defence")

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)