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 "topological properties of secure wireless sensor networks under the q composite key predistribution scheme with unreliable links"):
  Abstract: Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The    $q$   -composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the    $q$   -composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the    $q$   -composite scheme in consideration of the unreliability of links. One main difficulty lies in analyzing the network topology, whose links are not independent. Wireless links can be unreliable in practice due to the presence of physical barriers between sensors or because of harsh environmental conditions severely impairing communications. In this paper, we resolve the difficult challenge and investigate topological properties related to node degree in WSNs operating under the    $q$   -composite scheme with unreliable communication links modeled as independent ON/OFF channels. Specifically, we derive the asymptotically exact probability for the property of minimum degree being at least    $k$   , present the asymptotic probability distribution for the minimum degree, and demonstrate that the number of nodes with a fixed degree is in distribution asymptotically equivalent to a Poisson random variable. We further use the theoretical results to provide useful design guidelines for secure WSNs. Experimental results also confirm the validity of our analytical findings.

Includes members:
  Member "k connectivity in random key graphs with unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the strength of connectivity of inhomogeneous random k out graphs")
  Member "on resilience and connectivity of secure wireless sensor networks under node capture attacks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kpsec secure end to end communications for multi hop wireless networks")
  Member "key pre distributions from graph based block designs":
    also connected through other hyperedges:
      (none)
  Member "robustness and algebraic connectivity of random interdependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "connectivity in secure wireless sensor networks under transmission constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "hyperbolicity degeneracy and expansion of random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "on topological properties of wireless sensor networks under the q composite key predistribution scheme with on off channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "performance of the eschenauer gligor key distribution scheme under an on off channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "k connectivity in random key graphs with unreliable links")

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.NI(Networking and Internet Architecture)