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 "on secure communication in sensor networks under q composite key predistribution with unreliable links"):
  Abstract: Many applications of wireless sensor networks (WSNs) require deploying sensors in hostile environments, where an adversary may eavesdrop communications. To secure communications in WSNs, the q-composite key predistribution scheme has been proposed in the literature. In this paper, we investigate secure k-connectivity in WSNs operating under the q-composite scheme, in consideration of the unreliability of wireless links. Secure k-connectivity ensures that any two sensors can find a path in between for secure communication, even when k - 1 sensors fail. We present conditions on how to set the network parameters such that the network has secure k-connectivity asymptotically almost surely. The result is given in the form of a sharp zero-one law.

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 "probabilistic key predistribution in mobile networks resilient to node capture attacks":
    also connected through other hyperedges:
      (none)
  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-3 (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-4 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "on the asymptotic connectivity of random networks under the random connection model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "connectivity of large wireless networks under a generic connection model")
  Member "towards a better understanding of large scale network models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatial networks with wireless applications")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure communication in dynamic wireless ad hoc 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.IT(Information Theory)