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 "random spatial network models with core periphery structure"):
  Abstract: Core-periphery structure is a common property of complex networks, which is a composition of tightly connected groups of core vertices and sparsely connected periphery vertices. This structure frequently emerges in traffic systems, biology, and social networks via underlying spatial positioning of the vertices. While core-periphery structure is ubiquitous, there have been limited attempts at modeling network data with this structure. Here, we develop a generative, random network model with core-periphery structure that jointly accounts for topological and spatial information by "core scores" of vertices. Our model achieves substantially higher likelihood than existing generative models of core-periphery structure, and we demonstrate how the core scores can be used in downstream data mining tasks, such as predicting airline traffic and classifying fungal networks. We also develop nearly linear time algorithms for learning model parameters and network sampling by using a method akin to the fast multipole method, a technique traditional to computational physics, which allow us to scale to networks with millions of vertices with minor tradeoffs in accuracy.

Includes members:
  Member "higher order clustering in networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized objectives and algorithms for clustering bipartite graphs and hypergraphs")
  Member "a nonlinear spectral method for core periphery detection in networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlocal pagerank")
  Member "found graph data and planted vertex covers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "planted hitting set recovery in hypergraphs")
  Member "coin flipping ball dropping and grass hopping for generating random graphs from matrices of edge probabilities":
    also connected through other hyperedges:
      (none)
  Member "classifying developers into core and peripheral an empirical study on count and network metrics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a systematic mapping study of developer social network research")
  Member "detection of core periphery structure in networks using spectral methods and geodesic paths":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "core periphery structure in directed networks")
  Member "identification of core periphery structure in networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "link prediction in networks with core fringe data")
  Member "finding the hierarchy of dense subgraphs using nucleus decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the power of pivoting for exact clique counting")

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)