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 "exem expert embedding using dominating set theory with deep learning approaches"):
  Abstract: A collaborative network is a social network that is comprised of experts who cooperate with each other to fulfill a special goal. Analyzing the graph of this network yields meaningful information about the expertise of these experts and their subject areas. To perform the analysis, graph embedding techniques have emerged as a promising tool. Graph embedding attempts to represent graph nodes as low-dimensional vectors. In this paper, we propose a graph embedding method, called ExEm, which using dominating-set theory and deep learning approaches. In the proposed method, the dominating set theory is applied to the collaborative network and dominating nodes of this network are found. After that, a set of random walks is created which starts from dominating nodes (experts). The main condition for constricting these random walks is the existence of another dominating node. After making the walks that satisfy the stated conditions, they are stored as a sequence in a corpus. In the next step, the corpus is fed to the SKIP-GRAM neural network model. Word2vec, fastText and their combination are employed to train the neural network of the SKIP-GRAM model. Finally, the result is the low dimensional vectors of experts, called expert embeddings. Expert embeddings can be used for various purposes including accurately modeling experts' expertise or computing experts' scores in expert recommendation systems. Hence, we also introduce a novel strategy to calculate experts' scores by using the extracted expert embedding vectors. The effectiveness of ExEm is validated through assessing its performance on multi-label classification, link prediction, and recommendation tasks. We conduct extensive experiments on common datasets. Moreover in this study, we present data related to a co-author network formed by crawling the vast author profiles from Scopus.

Includes members:
  Member "dyngraph2vec capturing network dynamics using dynamic graph representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "relational representation learning for dynamic knowledge graphs a survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "time2vec learning a vector representation of time")
  Member "community aware random walk for network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "investigating extensions to random walk based graph embedding")
  Member "dynnode2vec scalable dynamic network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic joint variational graph autoencoders")
  Member "graph embedding techniques applications and performance a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "dynamic graph representation learning via self attention networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inf vae a variational autoencoder framework to integrate homophily and influence in diffusion prediction")
  Member "attributed social network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "network representation learning a survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "epine enhanced proximity information network embedding")

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)