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 "achieving covert wireless communications using a full duplex receiver"):
  Abstract: Covert communications hide the transmission of a message from a watchful adversary while ensuring a certain decoding performance at the receiver. In this work, a wireless communication system under fading channels is considered where covertness is achieved by using a full-duplex (FD) receiver. More precisely, the receiver of covert information generates artificial noise with a varying power causing uncertainty at the adversary, Willie, regarding the statistics of the received signals. Given that Willie's optimal detector is a threshold test on the received power, we derive a closed-form expression for the optimal detection performance of Willie averaged over the fading channel realizations. Furthermore, we provide guidelines for the optimal choice of artificial noise power range, and the optimal transmission probability of covert information to maximize the detection errors at Willie. Our analysis shows that the transmission of artificial noise, although causes self-interference, provides the opportunity of achieving covertness but its transmit power levels need to be managed carefully. We also demonstrate that the prior transmission probability of 0.5 is not always the best choice for achieving the maximum possible covertness, when the covert transmission probability and artificial noise power can be jointly optimized.

Includes members:
  Member "covert wireless communications with channel inversion power control in rayleigh fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pilot based channel estimation design in covert wireless communication")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert transmission with a self sustained relay")
  Member "covert wireless communication with a poisson field of interferers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "physical layer security jamming theoretical limits and practical designs in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficiency optimization for secure transmission in miso cognitive radio network with energy harvesting")
  Member "covert communication in fading channels under channel uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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 wireless communication with artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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 communications with a full duplex receiver over wireless fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")

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)