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 "semi supervised learning on graphs with generative adversarial nets"):
  Abstract: We investigate how generative adversarial nets (GANs) can help semi-supervised learning on graphs. We first provide insights on working principles of adversarial learning over graphs and then present GraphSGAN, a novel approach to semi-supervised learning on graphs. In GraphSGAN, generator and classifier networks play a novel competitive game. At equilibrium, generator generates fake samples in low-density areas between subgraphs. In order to discriminate fake samples from the real, classifier implicitly takes the density property of subgraph into consideration. An efficient adversarial learning algorithm has been developed to improve traditional normalized graph Laplacian regularization with a theoretical guarantee. Experimental results on several different genres of datasets show that the proposed GraphSGAN significantly outperforms several state-of-the-art methods. GraphSGAN can be also trained using mini-batch, thus enjoys the scalability advantage.

Includes members:
  Member "network embedding as matrix factorization unifying deepwalk line pte and node2vec":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "good semi supervised learning that requires a bad gan":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial code learning for image generation")
  Member "semi supervised learning with gans manifold invariance with improved inference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "end to end graph based deep semi supervised learning")
  Member "triple generative adversarial nets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local facial attribute transfer through inpainting")
  Member "learning graph topological features via gan":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploring the semantic content of unsupervised graph embeddings an empirical study")
  Member "graphgan graph representation learning with generative adversarial nets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mga momentum gradient attack on network")
  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 "energy based generative adversarial network":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")

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.SI(Social and Information Networks)