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 "improving anti eavesdropping ability without eavesdropper s csi a practical secure transmission design perspective"):
  Abstract: This letter studies the practical design of secure transmissions without knowing eavesdropper's channel state information (ECSI). An ECSI-irrelevant metric is introduced to quantize the intrinsic anti-eavesdropping ability (AEA) that the transmitter has on confronting the eavesdropper via secrecy encoding together with artificial-noise-aided signaling. Non-adaptive and adaptive transmission schemes are proposed to maximize the AEA with the optimal encoding rates and power allocation presented in closed-form expressions. Analyses and numerical results show that maximizing the AEA is equivalent to minimizing the secrecy outage probability (SOP) for the worst case by ignoring eavesdropper's receiver noise. Therefore, the AEA is a useful alternative to the SOP for assessing and designing secure transmissions when the ECSI cannot be prior known.

Includes members:
  Member "safeguarding decentralized wireless networks using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "secrecy in mimo networks with no eavesdropper csit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure retrospective interference alignment")
  Member "on the design of artificial noise aided secure multi antenna transmission in slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")

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)