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 "transitional behavior of q composite random key graphs with applications to networked control"):
  Abstract: Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a $q$-composite random key graph, whose construction on $n$ nodes is as follows: each node independently selects a set of $K_n$ different keys uniformly at random from the same pool of $P_n$ distinct keys, and two nodes establish an undirected edge in between if and only if they share at least $q$ key(s). Such graph denoted by $G_q(n,K_n,P_n)$ models a secure sensor network employing the well-known $q$-composite key predistribution. For $G_q(n,K_n,P_n)$, we analyze the probabilities of $G_q(n,K_n,P_n)$ having $k$-connectivity, $k$-robustness, a Hamilton cycle and a perfect matching, respectively. Our studies of these four properties are motivated by a detailed discussion of their applications to networked control. Our results reveal that $G_q(n,K_n,P_n)$ exhibits a sharp transition for each property: as $K_n$ increases, the probability that $G_q(n,K_n,P_n)$ has the property sharply increases from $0$ to $1$. These results provide fundamental guidelines to design secure sensor networks for different control-related applications: distributed in-network parameter estimation, fault-tolerant consensus, and resilient data backup.

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 "analyzing connectivity of heterogeneous secure sensor networks":
    also connected through other hyperedges:
      (none)
  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")

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)