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 "detecting stable communities in link streams at multiple temporal scales"):
  Abstract: Link streams model interactions over time in a wide range of fields. Under this model, the challenge is to mine efficiently both temporal and topological structures. Community detection and change point detection are one of the most powerful tools to analyze such evolving interactions. In this paper, we build on both to detect stable community structures by identifying change points within meaningful communities. Unlike existing dynamic community detection algorithms, the proposed method is able to discover stable communities efficiently at multiple temporal scales. We test the effectiveness of our method on synthetic networks, and on high-resolution time-varying networks of contacts drawn from real social networks.

Includes members:
  Member "detecting sequences of system states in temporal networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unsupervised network embedding for graph visualization clustering and classification")
  Member "olcpm an online framework for detecting overlapping communities in dynamic social networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "challenges in community discovery on temporal networks")
  Member "community discovery in dynamic networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of community search over big graphs")
  Member "motifs in temporal networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "stream graphs and link streams for the modeling of interactions over time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "fast change point detection on dynamic social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "change detection in noisy dynamic networks a spectral embedding approach")
  Member "detecting change points in the large scale structure of evolving networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "change detection in dynamic attributed networks")
  Member "community structure in large networks natural cluster sizes and the absence of large well defined clusters":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")

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)