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 "gaussian signalling for covert communications"):
  Abstract: In this paper, we examine the optimality of Gaussian signalling for covert communications with an upper bound on    $\mathcal {D}(p_{_{1}}||p_{_{0}})$    or    $\mathcal {D}(p_{_{0}}||p_{_{1}})$    as the covertness constraint, where    $\mathcal {D}(p_{_{1}}||p_{_{0}})$    and    $\mathcal {D}(p_{_{0}}||p_{_{1}})$    are different due to the asymmetry of Kullback–Leibler divergence,    $p_{_{0}}(y)$    and    $p_{_{1}}(y)$    are the likelihood functions of the observation    ${y}$    at the warden under the null hypothesis (no covert transmission) and alternative hypothesis (a covert transmission occurs), respectively. Considering additive white Gaussian noise at both the receiver and the warden, we prove that the Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound on    $\mathcal {D}(p_{_{1}}||p_{_{0}})$    as the constraint. More interestingly, we also prove that the Gaussian signalling is not optimal for covert communications with an upper bound on    $\mathcal {D}(p_{_{0}}||p_{_{1}})$    as the constraint, for which as we explicitly show skew-normal signalling can outperform the Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on    $\mathcal {D}(p_{_{1}}||p_{_{0}})$    is a tighter covertness constraint in that it leads to lower mutual information than the same upper bound on    $\mathcal {D}(p_{_{0}}||p_{_{1}})$   , by proving    $\mathcal {D}(p_{_{0}}||p_{_{1}}) \leq \mathcal {D}(p_{_{1}}||p_{_{0}})$   .

Includes members:
  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 "covert communication over a k user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "multipath stealth communication with jammers":
    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 "covert wireless communications with channel inversion power control in rayleigh fading")
  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 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 "on covert communication with noise 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 "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)