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 "high quality disjoint and overlapping community structure in large scale complex networks"):
  Abstract: In this paper, we propose an improved version of an agglomerative hierarchical clustering algorithm that performs disjoint community detection in large-scale complex networks. The improved algorithm is achieved after replacing the local structural similarity used in the original algorithm, with the recently proposed Dynamic Structural Similarity. Additionally, the improved algorithm is extended to detect fuzzy and crisp overlapping community structure. The extended algorithm leverages the disjoint community structure generated by itself and the dynamic structural similarity measures, to compute a proposed membership probability function that defines the fuzzy communities. Moreover, an experimental evaluation is performed on reference benchmark graphs in order to compare the proposed algorithms with the state-of-the-art.

Includes members:
  Member "dynamic structural similarity on graphs":
    also connected through other hyperedges:
      (none)
  Member "personalized pagerank estimation and search a bidirectional approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical policy evaluation with supergraphs")
  Member "improving pagerank for local community detection":
    also connected through other hyperedges:
      (none)
  Member "uncovering the small community structure in large networks a local spectral approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "leveraging disjoint communities for detecting overlapping community structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ensemble based overlapping community detection using disjoint community structures")
  Member "heat kernel based community detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connectivity driven communication in multi agent reinforcement learning through diffusion processes on graphs")
  Member "community detection via local dynamic interaction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "community discovery in dynamic networks a survey")
  Member "slpa uncovering overlapping communities in social networks via a speaker listener interaction dynamic process":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "self falsifiable hierarchical detection of overlapping communities on social networks")

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)