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 "undetectable radios covert communication under spectral mask constraints"):
  Abstract: We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties attempt to communicate reliably in the presence of an eavesdropper that should be unable to estimate if communication takes place. The spectral mask constraint is imposed to restrict excessive radiation beyond the bandwidth of interest. We develop a communication scheme with theoretical reliability and covertness guarantees based on pulse amplitude modulation (PAM) with Binary Phase Shift Keying (BPSK) and root raised cosine (RRC) carrier pulses. Given a fixed transmission duration T and a spectral mask with bandwidth parameter W, we show that one can reliably and covertly transmit $O(\sqrt{WT})$ bits of information. We characterize the constant behind the $O$ and show that it is tight under some conditions.

Includes members:
  Member "covert communication over a compound channel":
    also connected through other hyperedges:
      (none)
  Member "first and second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "embedding covert information in broadcast communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert millimeter wave communication via a dual beam transmitter")
  Member "covert communication over adversarially jammed channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "covert communication over a k user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "treating interference as noise is optimal for covert communication over interference channels")
  Member "time division is optimal for covert communication over some broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures")
  Member "covert communication with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keyless covert communication via channel state information")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "keyless covert communication via channel state information")

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)