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 "a framework for the construction of generative models for mesoscale structure in multilayer networks"):
  Abstract: Multilayer networks allow one to represent diverse and coupled connectivity patterns --- e.g., time-dependence, multiple subsystems, or both --- that arise in many applications and which are difficult or awkward to incorporate into standard network representations. In the study of multilayer networks, it is important to investigate mesoscale (i.e., intermediate-scale) structures, such as dense sets of nodes known as communities, to discover network features that are not apparent at the microscale or the macroscale. The ill-defined nature of mesoscale structure and its ubiquity in empirical networks make it crucial to develop generative models that can produce the features that one encounters in empirical networks. Key purposes of such generative models include generating synthetic networks with empirical properties of interest, benchmarking mesoscale-detection methods and algorithms, and inferring structure in empirical multilayer networks. In this paper, we introduce a framework for the construction of generative models for mesoscale structures in multilayer networks. Our framework provides a standardized set of generative models, together with an associated set of principles from which they are derived, for studies of mesoscale structures in multilayer networks. It unifies and generalizes many existing models for mesoscale structures in fully-ordered (e.g., temporal) and unordered (e.g., multiplex) multilayer networks. One can also use it to construct generative models for mesoscale structures in partially-ordered multilayer networks (e.g., networks that are both temporal and multiplex). Our framework has the ability to produce many features of empirical multilayer networks, and it explicitly incorporates a user-specified dependency structure between layers.

Includes members:
  Member "community discovery in dynamic networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of community search over big graphs")
  Member "random graph models for dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bayesian graph convolutional neural networks using node copying")
  Member "the many facets of community detection in complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "embedding based silhouette community detection")
  Member "the geometric block model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "active learning in the geometric block model")
  Member "block models and personalized pagerank":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "diffusion improves graph learning")
  Member "community detection link prediction and layer interdependence in multilayer networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "community detection on mixture multi layer networks via regularized tensor decomposition")
  Member "multiresolution consensus clustering in networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning resolution parameters for graph clustering")
  Member "the ground truth about metadata and community detection in networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized objectives and algorithms for clustering bipartite graphs and hypergraphs")

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)