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 "networkit a tool suite for large scale complex network analysis"):
  Abstract: We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets containing up to billions of connections. We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficient data structures, and modular software architecture. Our goal for the software is to package results of our algorithm engineering efforts and put them into the hands of domain experts. NetworKit is implemented as a hybrid combining the kernels written in C++ with a Python front end, enabling integration into the Python ecosystem of tested tools for data analysis and scientific computing. The package provides a wide range of functionality (including common and novel analytics algorithms and graph generators) and does so via a convenient interface. In an experimental comparison with related software, NetworKit shows the best performance on a range of typical analysis tasks.

Includes members:
  Member "querying probabilistic neighborhoods in spatial data sets efficiently":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "updating dynamic random hyperbolic graphs in sublinear time")
  Member "engineering parallel algorithms for community detection in massive networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "high quality shared memory graph partitioning")
  Member "snap a general purpose network analysis and graph mining library":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive low level storage of very large knowledge graphs")
  Member "structure preserving sparsification methods for social networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "convex skeletons of complex networks")
  Member "fully dynamic approximation of betweenness centrality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simple and fast distributed computation of betweenness centrality")
  Member "approximating betweenness centrality in large evolving networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simple and fast distributed computation of betweenness centrality")
  Member "social structure of facebook networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "the similarity between stochastic kronecker and chung lu graph models":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "signed network modeling based on structural balance theory")

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)