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 "distribution induced bidirectional generative adversarial network for graph representation learning"):
  Abstract: Graph representation learning aims to encode all nodes of a graph into low-dimensional vectors that will serve as input of many compute vision tasks. However, most existing algorithms ignore the existence of inherent data distribution and even noises. This may significantly increase the phenomenon of over-fitting and deteriorate the testing accuracy. In this paper, we propose a Distribution-induced Bidirectional Generative Adversarial Network (named DBGAN) for graph representation learning. Instead of the widely used normal distribution assumption, the prior distribution of latent representation in our DBGAN is estimated in a structure-aware way, which implicitly bridges the graph and feature spaces by prototype learning. Thus discriminative and robust representations are generated for all nodes. Furthermore, to improve their generalization ability while preserving representation ability, the sample-level and distribution-level consistency is well balanced via a bidirectional adversarial learning framework. An extensive group of experiments are then carefully designed and presented, demonstrating that our DBGAN obtains remarkably more favorable trade-off between representation and robustness, and meanwhile is dimension-efficient, over currently available alternatives in various tasks.

Includes members:
  Member "large scale adversarial representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transformation based adversarial video prediction on large scale data")
  Member "symmetric graph convolutional autoencoder for unsupervised graph representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple and effective graph autoencoders with one hop linear models")
  Member "network embedding as matrix factorization unifying deepwalk line pte and node2vec":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "adversarially regularized graph autoencoder for graph embedding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")
  Member "semi supervised learning on graphs with generative adversarial nets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "graph representation learning via graphical mutual information maximization")
  Member "improved training of wasserstein gans":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "adversarial network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "node2vec scalable feature learning for networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep graph matching consensus")

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)