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 "secure and reliable connectivity in heterogeneous wireless sensor networks"):
  Abstract: We consider wireless sensor networks secured by the heterogeneous random key predistribution scheme under an on/off channel model. The heterogeneous random key predistribution scheme considers the case when the network includes sensor nodes with varying levels of resources, features, or connectivity requirements; e.g., regular nodes vs. cluster heads, but does not incorporate the fact that wireless channel are unreliable. To capture the unreliability of the wireless medium, we use an on/off channel model; wherein, each wireless channel is either on (with probability $\alpha$) or off (with probability $1-\alpha$) independently. We present conditions (in the form of zero-one laws) on how to scale the parameters of the network model so that with high probability the network is $k$-connected, i.e., the network remains connected even if any $k-1$ nodes fail or leave the network. We also present numerical results to support these conditions in the finite-node regime.

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 "node isolation of secure wireless sensor networks under a heterogeneous channel model":
    also connected through other hyperedges:
      (none)
  Member "on the network reliability problem of the heterogeneous key predistribution scheme":
    also connected through other hyperedges:
      (none)
  Member "minimum node degree in inhomogeneous random key graphs with unreliable links":
    also connected through other hyperedges:
      (none)
  Member "on the strengths of connectivity and robustness in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "performance of the eschenauer gligor key distribution scheme under an on off channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)