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 "minimum node degree in inhomogeneous random key graphs with unreliable links"):
  Abstract: We consider wireless sensor networks under a heterogeneous random key predistribution scheme and an on-off channel model. The heterogeneous key predistribution scheme has recently been introduced by Ya\u{g}an - as an extension to the Eschenauer and Gligor scheme - for the cases when the network consists of sensor nodes with varying level of resources and/or connectivity requirements, e.g., regular nodes vs. cluster heads. The network is modeled by the intersection of the inhomogeneous random key graph (induced by the heterogeneous scheme) with an Erd\H{o}s-R\'enyi graph (induced by the on/off channel model). We present conditions (in the form of zero-one laws) on how to scale the parameters of the intersection model so that with high probability all of its nodes are connected to at least $k$ other nodes; i.e., the minimum node degree of the graph is no less than $k$. We also present numerical results to support our results in the finite-node regime. The numerical results suggest that the conditions that ensure $k$-connectivity coincide with those ensuring the minimum node degree being no less than $k$.

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 "connectivity in secure wireless sensor networks under transmission constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "on the strengths of connectivity and robustness in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "modeling the pairwise key predistribution scheme in the presence of unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the strength of connectivity of inhomogeneous random k out graphs")
  Member "performance of the eschenauer gligor key distribution scheme under an on off channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.CR(Cryptography and Security)