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 "labelrank a stabilized label propagation algorithm for community detection in networks"):
  Abstract: An important challenge in big data analysis nowadays is detection of cohesive groups in large-scale networks, including social networks, genetic networks, communication networks and so. In this paper, we propose LabelRank, an efficient algorithm detecting communities through label propagation. A set of operators is introduced to control and stabilize the propagation dynamics. These operations resolve the randomness issue in traditional label propagation algorithms (LPA), stabilizing the discovered communities in all runs of the same network. Tests on real-world networks demonstrate that LabelRank significantly improves the quality of detected communities compared to LPA, as well as other popular algorithms.

Includes members:
  Member "overlapping community detection in networks the state of the art and comparative study":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meta learning with relational information for short sequences")
  Member "towards linear time overlapping community detection in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "community detection in node attributed social networks a survey")
  Member "community detection using a neighborhood strength driven label propagation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "predicting complex user behavior from cdr based social networks")
  Member "slpa uncovering overlapping communities in social networks via a speaker listener interaction dynamic process":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self falsifiable hierarchical detection of overlapping communities on social networks")
  Member "efficient modularity optimization by multistep greedy algorithm and vertex mover refinement":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "correlation based community detection")
  Member "community structure in large networks natural cluster sizes and the absence of large well defined clusters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")
  Member "finding community structure in mega scale social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "community detection through likelihood optimization in search of a sound model")

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)