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 wireless communications with channel inversion power control in rayleigh fading"):
  Abstract: Considering Rayleigh fading channels, in this work we adopt channel inversion power control to achieve covert communications, where a transmitter can possibly hide itself from a warden while transmitting information to a receiver. Specifically, we examine the performance of the achieved covert communications in two scenarios in terms of the effective covert rate (ECR), which quantifies the amount of information that the transmitter can reliably convey to the receiver subject to the warden's detection error probability being no less than some specific value. In the first scenario, the noise uncertainty at the warden serves as the enabler of covert communications and our examination shows that increasing the noise uncertainty at the warden and the receiver simultaneously may not continuously improve the ECR. In the second scenario, covert communications are aided by a full-duplex receiver, which always transmits artificial noise (AN) with a random power. Our analysis indicates that the achieved ECR approaches to an upper bound as the transmit power of AN approaches to infinity. This work provides useful guidelines and performance limits on achieving covert communications and potentially hiding a transmitter in practical Rayleigh fading channels.

Includes members:
  Member "gaussian signalling for covert communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pilot based channel estimation design in covert wireless communication")
  Member "achieving covert wireless communications using a full duplex receiver":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi antenna jamming in covert communication")
  Member "adaptive full duplex jamming receiver for secure d2d links in random networks":
    also connected through other hyperedges:
      (none)
  Member "covert communication in wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gaussian signalling for covert communications")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "covert communication in fading channels under channel uncertainty":
    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")

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)