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 "centrality measures for networks with community structure"):
  Abstract: Understanding the network structure, and finding out the influential nodes is a challenging issue in large networks. Identifying the most influential nodes in a network can be useful in many applications like immunization of nodes in case of epidemic spreading, during intentional attacks on complex networks. A lot of research is being done to devise centrality measures which could efficiently identify the most influential nodes in a network. There are two major approaches to this problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology, while on the other end, random strategies are completely agnostic about the network structure. Centrality measures that can deal with a limited knowledge of the network structure are of prime importance. Indeed, in practice, information about the global structure of the overall network is rarely available or hard to acquire. Even if available, the structure of the network might be too large that it is too much computationally expensive to calculate global centrality measures. To that end, a centrality measure is proposed here that requires information only at the community level. Indeed, most of the real-world networks exhibit a community structure that can be exploited efficiently to discover the influential nodes. We performed a comparative evaluation of prominent global deterministic strategies together with stochastic strategies, an available and the proposed deterministic community-based strategy. Effectiveness of the proposed method is evaluated by performing experiments on synthetic and real-world networks with community structure in the case of immunization of nodes for epidemic control.

Includes members:
  Member "community based immunization strategies for epidemic control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "centrality in modular networks")
  Member "nonlinear spread of rumor and inoculation strategies in the nodes with degree dependent tie strength in complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "community based immunization strategies for epidemic control")
  Member "fast multi scale community detection based on local criteria within a multi threaded algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "uncovering nodes that spread information between communities in social networks")
  Member "comparative evaluation of community detection algorithms a topological approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ensemble clustering for graphs comparisons and applications")
  Member "mapping the gnutella network properties of large scale peer to peer systems and implications for system design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network interdiction using adversarial traffic flows")

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)