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 "probabilistic key predistribution in mobile networks resilient to node capture attacks"):
  Abstract: We present a comprehensive analysis on connectivity and resilience of secure sensor networks under the widely studied    $q$   -composite key predistribution scheme. For network connectivity, which ensures that any two sensors can find a path in between for secure communication, we derive the conditions to guarantee connectivity in consideration of: 1) node-capture attacks, where the adversary may capture a set of sensors and compromise keys in their memory; 2) sensor mobility, meaning that sensors can move around so that the network topology may change over time; 3) physical transmission constraints, under which two sensors have to be within each other’s transmission range for communication; 4) the boundary effect of network fields; and 5) link unreliability, meaning that links are allowed to be unreliable. In contrast, many prior connectivity analyses of secure sensor networks often ignore the above issues. For resilience, although limited studies have presented formal analysis, it is often assumed that the adversary captures a random set of sensors, whereas this paper allows the adversary to capture an arbitrary set of sensors. We present conditions to ensure unassailability and unsplittability in secure sensor networks under the    $q$   -composite scheme. Unassailability ensures that an adversary capturing any set consisting of a negligible fraction of sensors can compromise only a negligible fraction of communication links although the adversary may compromise communications between non-captured nodes, which happen to use keys that are shared by captured nodes. Unsplittability means that when a negligible fraction of sensors are captured, almost all of the remaining nodes are still securely connected. Based on the results of connectivity, unassailability, and unsplittability, we provide useful guidelines for the design of secure sensor networks.

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 "topological properties of secure wireless sensor networks under the q composite key predistribution scheme with unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kpsec secure end to end communications for multi hop wireless networks")
  Member "on connectivity and robustness in random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "transitional behavior of q composite random key graphs with applications to networked control":
    also connected through other hyperedges:
      (none)
  Member "analyzing resilience of interest based social networks against node and link failures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on the security of pervasive online social networks posns")
  Member "toward k connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-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)