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 "indirect adversarial attacks via poisoning neighbors for graph convolutional networks"):
  Abstract: Graph convolutional neural networks, which learn aggregations over neighbor nodes, have achieved great performance in node classification tasks. However, recent studies reported that such graph convolutional node classifier can be deceived by adversarial perturbations on graphs. Abusing graph convolutions, a node's classification result can be influenced by poisoning its neighbors. Given an attributed graph and a node classifier, how can we evaluate robustness against such indirect adversarial attacks? Can we generate strong adversarial perturbations which are effective on not only one-hop neighbors, but more far from the target? In this paper, we demonstrate that the node classifier can be deceived with high-confidence by poisoning just a single node even two-hops or more far from the target. Towards achieving the attack, we propose a new approach which searches smaller perturbations on just a single node far from the target. In our experiments, our proposed method shows 99% attack success rate within two-hops from the target in two datasets. We also demonstrate that m-layer graph convolutional neural networks have chance to be deceived by our indirect attack within m-hop neighbors. The proposed attack can be used as a benchmark in future defense attempts to develop graph convolutional neural networks with having adversary robustness.

Includes members:
  Member "robust audio adversarial example for a physical attack":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "advbox a toolbox to generate adversarial examples that fool neural networks")
  Member "adversarial attacks on graph neural networks via meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "adversarial attack on graph structured data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "graph convolutional neural networks for web scale recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "lipschitz margin training scalable certification of perturbation invariance for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "varmixup exploiting the latent space for robust training and inference")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial ranking attack and defense")
  Member "robust physical world attacks on deep learning models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")
  Member "toeplitz inverse covariance based clustering of multivariate time series data":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scalable hybrid hmm with gaussian process emission for sequential time series data clustering")

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)