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 "deep graph translation"):
  Abstract: Inspired by the tremendous success of deep generative models on generating continuous data like image and audio, in the most recent year, few deep graph generative models have been proposed to generate discrete data such as graphs. They are typically unconditioned generative models which has no control on modes of the graphs being generated. Differently, in this paper, we are interested in a new problem named \emph{Deep Graph Translation}: given an input graph, we want to infer a target graph based on their underlying (both global and local) translation mapping. Graph translation could be highly desirable in many applications such as disaster management and rare event forecasting, where the rare and abnormal graph patterns (e.g., traffic congestions and terrorism events) will be inferred prior to their occurrence even without historical data on the abnormal patterns for this graph (e.g., a road network or human contact network). To achieve this, we propose a novel Graph-Translation-Generative Adversarial Networks (GT-GAN) which will generate a graph translator from input to target graphs. GT-GAN consists of a graph translator where we propose new graph convolution and deconvolution layers to learn the global and local translation mapping. A new conditional graph discriminator has also been proposed to classify target graphs by conditioning on input graphs. Extensive experiments on multiple synthetic and real-world datasets demonstrate the effectiveness and scalability of the proposed GT-GAN.

Includes members:
  Member "graphvae towards generation of small graphs using variational autoencoders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "learning deep generative models of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "graph2seq graph to sequence learning with attention based neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards graph representation learning in emergent communication")
  Member "junction tree variational autoencoder for molecular graph generation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "benchmarking graph neural networks")
  Member "syntax directed variational autoencoder for structured data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "designing random graph models using variational autoencoders with applications to chemical design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "progressive growing of gans for improved quality stability and variation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "kernel graph convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a kernel of truth determining rumor veracity on twitter by diffusion pattern alone")

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)