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 communication in presence of a multi antenna adversary and delay constraints"):
  Abstract: Covert communication hides the transmission of a message from a watchful adversary while ensuring reliable information decoding at the receiver, providing enhanced security in wireless communications. In this letter, covert communication in the presence of a multi-antenna adversary and under delay constraints is considered. Under the assumption of quasi-static wireless fading channels, we analyze the effect of increasing the number of antennas employed at the adversary on the achievable throughput of covert communication. It is shown that in contrast to a single-antenna adversary, a slight increase in the number of adversary's antennas drastically reduces the covert throughput, even for relaxed covertness requirements.

Includes members:
  Member "multi antenna covert communications in random wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "power efficient irs assisted noma")
  Member "low probability of detection communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pilot based channel estimation design in covert wireless communication")
  Member "gaussian signalling for covert communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "multi antenna jamming in covert communication")
  Member "joint optimization of a uav s trajectory and transmit power for covert communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latency minimized design of secure transmissions in uav aided communications")
  Member "covert wireless communications with channel inversion power control in rayleigh fading":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pilot based channel estimation design in covert wireless communication")
  Member "fundamental limits of covert communication over mimo awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi antenna jamming in covert communication")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "covert transmission with a self sustained relay")

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)