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 "wireless secrecy in large scale networks"):
  Abstract: The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.

Includes members:
  Member "continuum percolation in the intrinsically secure communications graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "secure communication in stochastic wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the throughput cost of physical layer security in decentralized wireless networks")
  Member "techniques for enhanced physical layer security":
    also connected through other hyperedges:
      (none)
  Member "on the relationship between the multi antenna secrecy communications and cognitive radio communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust an aided beamforming and power splitting design for secure miso cognitive radio with swipt")
  Member "on secrecy capacity scaling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming")
  Member "secrecy in cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")

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)