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 "fast evaluation of link prediction by random sampling of unobserved links"):
  Abstract: The evaluation of a link prediction algorithm requires to estimate the possibility of the existence of all unobserved links in a network. However, the number of unobserved links grows exponentially with the increase of the number of nodes, which limits link prediction in large networks. In this paper, we propose a new evaluation scheme for link prediction algorithms, i.e., link prediction with random sampling. We use this method to evaluate the performance of twelve link predictors on ten real-world networks of different contexts and scales. The results show that the performance ranking of these algorithms is not affected by randomly sampling a very small part from unobserved links for experiments, whether using AUC or the precision metric. Moreover, this sampling method can reduce the computational complexity for the evaluation of link prediction algorithms from O(n^2) to O(n) in large networks. Our findings show that the proposed scheme is a fast and effective evaluation method.

Includes members:
  Member "gcn gan a non linear temporal link prediction model for weighted dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "temporal neighbourhood aggregation predicting future links in temporal graphs via recurrent variational graph convolutions")
  Member "link prediction based on graph neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "can graph neural networks count substructures")
  Member "link prediction in dynamic graphs for recommendation":
    also connected through other hyperedges:
      (none)
  Member "multi task graph autoencoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")
  Member "modeling polypharmacy side effects with graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "differentiable graph module dgm graph convolutional networks")
  Member "end to end structure aware convolutional networks for knowledge base completion":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rule learning with template saturation for knowledge graph completion")
  Member "gemsec graph embedding with self clustering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint inference on truth rumor and their sources in social networks")
  Member "scalable temporal latent space inference for link prediction in dynamic social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dyngraph2vec capturing network dynamics using dynamic graph representation learning")

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)