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 "techniques for enhanced physical layer security"):
  Abstract: Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channels to strengthen the security of communications systems. Within this paradigm, we explore strategies to improve secure connectivity in a wireless network. We first consider the intrinsically secure communications graph (iS-graph), a convenient representation of the links that can be established with information-theoretic security on a large-scale network. We then propose and characterize two techniques--sectorized transmission and eavesdropper neutralization--which are shown to dramatically enhance the connectivity of the iS-graph.

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 "wireless secrecy in large scale networks")
  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")
  Member "a note on the secrecy capacity of the multi antenna wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the secrecy rate region of a fading multiple antenna gaussian broadcast channel with confidential messages and partial 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.NI(Networking and Internet Architecture)