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 "covert communication in wireless relay networks"):
  Abstract: Covert communication aims to shield the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, for the first time we examine the possibility and achievable performance of covert communication in one-way relay networks. Specifically, the relay opportunistically transmits its own information to the destination covertly on top of forwarding the source's message, while the source tries to detect this covert transmission to discover the illegitimate usage of the recourse (e.g., power, spectrum) allocated only for the purpose of forwarding source's information. The necessary condition that the relay can transmit covertly without being detected is identified and the source's detection limit is derived in terms of the false alarm and miss detection rates. Our analysis indicates that boosting the forwarding ability of the relay (e.g., increasing its maximum transmit power) also increases its capacity to perform the covert communication in terms of achieving a higher effective covert rate subject to some specific requirement on the source's detection performance.

Includes members:
  Member "covert communication in fading channels under channel uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "covert communication with finite blocklength in awgn channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert transmission with a self sustained relay")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "keyless covert communication via channel state information")
  Member "artificial noise aided secure transmission with directional modulation based on random frequency diverse arrays":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert transmission with a self sustained relay")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keyless covert communication via channel state information")
  Member "artificial noise aided secure transmission in wiretap channels with transmitter side correlation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "covert transmission with a self sustained relay")
  Member "lpd communication when the warden does not know when":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi antenna covert communications in random 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)