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 communication in dynamic wireless ad hoc networks"):
  Abstract: We consider a wireless ad hoc network in the presence of eavesdroppers (EDs), where the nodes are distributed according to independent Poisson point processes (PPPs). The legitimate nodes follow the half-duplex mode of operation employing the slotted ALOHA protocol for transmission. For such a network, a novel communication scheme that induces a time-varying secure connectivity graph (SCG) is proposed, and the connectivity behavior of this induced SCG is studied. In particular, for a legitimate node in the network, we analyze (i) the average number of incoming edges and the average number of outgoing edges; (ii) the time to nearest-neighbor secure connectivity; and (iii) a condition on the EDs' density that allows information percolation, {\ie}, a condition for the existence of a `giant' component. The average time for secure connectivity among the nodes in this giant component is shown to scale linearly with the Euclidean distance. Further, we show that by splitting the packets into two sub-packets and routing each sub-packet along paths that are sufficiently far apart can (a) potentially improve secure connectivity and (b) reduce the overall delay incurred in exchanging packets between any two legitimate nodes in the giant component.

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 "tradeoff between delay and physical layer security in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "directional cell search delay analysis for cellular networks with static users":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bandwidth partitioning and downlink analysis in mmwave integrated access and backhaul for 5g")
  Member "toward a tractable delay analysis in ultra dense networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient optimization of wireless powered 5g full duplex cellular networks a mean field game approach")
  Member "connectivity in secure wireless sensor networks under transmission constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "k connectivity in random key graphs with unreliable links")
  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-6 (induced by source paper "probabilistic key predistribution in mobile networks resilient to node capture attacks")
  Member "physical layer security in cellular networks a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "on the throughput cost of physical layer security in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secrecy transmission in large scale uav enabled wireless 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)