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 capacity of non coherent rayleigh fading channels"):
  Abstract: The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the covert capacity is achieved with an amplitude-constrained input distribution that consists of a finite number of mass points including one at zero and numerically tractable bounds are provided. It is also conjectured that distributions with two mass points in fixed locations are optimal.

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 "first and second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covert transmission with a self sustained relay")
  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 "covert communication in the presence of an uninformed jammer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna jamming in covert communication")
  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 "optimal throughput for covert communication over a classical quantum channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "quantum secure covert communication on bosonic channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stealthy communication over adversarially jammed multipath 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)