human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "adversarial attack and defense on graph data a survey"
  Abstract: Deep neural networks (DNNs) have been widely applied in various applications involving image, text, audio, and graph data. However, recent studies have shown that DNNs are vulnerable to adversarial attack. Though there are several works studying adversarial attack and defense on domains such as images and text processing, it is difficult to directly transfer the learned knowledge to graph data due to its representation challenge. Given the importance of graph analysis, increasing number of works start to analyze the robustness of machine learning models on graph. Nevertheless, current studies considering adversarial behaviors on graph data usually focus on specific types of attacks with certain assumptions. In addition, each work proposes its own mathematical formulation which makes the comparison among different methods difficult. Therefore, in this paper, we aim to survey existing adversarial attack strategies on graph data and provide an unified problem formulation which can cover all current adversarial learning studies on graph. We also compare different attacks on graph data and discuss their corresponding contributions and limitations. Finally, we discuss several future research directions in this area.

Connected through hyperedge HE-1 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study"):
  with members:
    - "certified robustness of community detection against adversarial structural perturbation via randomized smoothing"
    - "adversarial attack on community detection by hiding individuals"
    - "transferring robustness for graph neural network against poisoning attacks"
    - "graph universal adversarial attacks a few bad actors ruin graph learning models"
    - "adversarial training methods for network embedding"
    - "adversarial examples on graph data deep insights into attack and defense"
    - "topology attack and defense for graph neural networks an optimization perspective"
    - "the general black box attack method for graph neural networks"

Connected through hyperedge HE-2 (induced by source paper "a survey of adversarial learning on graphs"):
  with members:
    - "heterogeneous graph neural networks for malicious account detection"
    - "dynamic graph convolutional networks"
    - "multiscale evolutionary perturbation attack on community detection"
    - "power up robust graph convolutional network against evasion attacks based on graph powering"
    - "topology attack and defense for graph neural networks an optimization perspective"
    - "time aware gradient attack on dynamic network link prediction"
    - "a restricted black box adversarial framework towards attacking graph embedding models"
    - "adversarial robustness of similarity based link prediction"

Connected through hyperedge HE-3 (induced by source paper "gradient based adversarial attacks on categorical sequence models via traversing an embedded world"):
  with members:
    - "towards a human like open domain chatbot"
    - "cyclical stochastic gradient mcmc for bayesian deep learning"
    - "mass masked sequence to sequence pre training for language generation"
    - "sequence embeddings help to identify fraudulent cases in healthcare insurance"
    - "soft edit distance for differentiable comparison of symbolic sequences"
    - "is bert really robust a strong baseline for natural language attack on text classification and entailment"
    - "adversarial attacks on deep learning models in natural language processing a survey"
    - "black box generation of adversarial text sequences to evade deep learning classifiers"

Connected through hyperedge HE-4 (induced by source paper "generalizable adversarial attacks with latent variable perturbation modelling"):
  with members:
    - "nattack learning the distributions of adversarial examples for an improved black box attack on deep neural networks"
    - "adversarial attack on graph structured data"
    - "textbugger generating adversarial text against real world applications"
    - "black box generation of adversarial text sequences to evade deep learning classifiers"
    - "generating natural language adversarial examples"
    - "neural nearest neighbors networks"
    - "generating adversarial examples with adversarial networks"
    - "adversarial texts with gradient methods"

Connected through hyperedge HE-5 (induced by source paper "adversarial attack on community detection by hiding individuals"):
  with members:
    - "gap generalizable approximate graph partitioning framework"
    - "semi supervised graph classification a hierarchical graph perspective"
    - "a comprehensive survey on graph neural networks"
    - "adversarial attack on graph structured data"
    - "predict then propagate graph neural networks meet personalized pagerank"
    - "constrained graph variational autoencoders for molecule design"
    - "ga based q attack on community detection"
    - "normalized cut loss for weakly supervised cnn segmentation"

Connected through hyperedge HE-6 (induced by source paper "adversarial attack on skeleton based human action recognition"):
  with members:
    - "centrality graph convolutional networks for skeleton based action recognition"
    - "one pixel attack for fooling deep neural networks"
    - "label universal targeted attack"
    - "openpose realtime multi person 2d pose estimation using part affinity fields"
    - "spatially transformed adversarial examples"
    - "adversarial attack on graph structured data"
    - "spatial temporal graph convolutional networks for skeleton based action recognition"
    - "two stream adaptive graph convolutional networks for skeleton based action recognition"

Connected through hyperedge HE-7 (induced by source paper "power up robust graph convolutional network against evasion attacks based on graph powering"):
  with members:
    - "mixhop higher order graph convolutional architectures via sparsified neighborhood mixing"
    - "adversarial attacks on graph neural networks via meta learning"
    - "a comprehensive survey on graph neural networks"
    - "can adversarial network attack be defended"
    - "graph powering and spectral robustness"
    - "graph neural networks a review of methods and applications"
    - "zero shot recognition via semantic embeddings and knowledge graphs"
    - "adversarial attack on graph structured data"

Connected through hyperedge HE-8 (induced by source paper "generalizable adversarial attacks using generative models"):
  with members:
    - "nattack learning the distributions of adversarial examples for an improved black box attack on deep neural networks"
    - "adversarial attack on graph structured data"
    - "textbugger generating adversarial text against real world applications"
    - "black box generation of adversarial text sequences to evade deep learning classifiers"
    - "generating natural language adversarial examples"
    - "neural nearest neighbors networks"
    - "generating adversarial examples with adversarial networks"
    - "adversarial texts with gradient methods"

Question: Please tell me which class the center node 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)