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 "secrecy transmission capacity in noisy wireless ad hoc networks"):
  Abstract: This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the legitimate nodes and the eavesdroppers are distributed as Poisson point processes, we study the secrecy transmission capacity (STC), as well as the connection outage probability and secrecy outage probability, based on the physical layer security. We first consider the basic fixed transmission distance model, and establish a theoretical model of the STC. We then extend the above results to a more realistic random distance transmission model, namely nearest receiver transmission. Finally, extensive simulation and numerical results are provided to validate the efficiency of our theoretical results and illustrate how the STC is affected by noise, connection and secrecy outage probabilities, transmitter and eavesdropper densities, and other system parameters. Remarkably, our results reveal that a proper amount of noise is helpful to the secrecy transmission capacity.

Includes members:
  Member "transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "high sir transmission capacity of wireless networks with general fading and node distribution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on interference dynamics in matern networks")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "rethinking the secrecy outage formulation a secure transmission design perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "on the throughput cost of physical layer security in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "continuum percolation in the intrinsically secure communications graph":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)