human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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}})$   .

Connected through hyperedge HE-1 (induced by source paper "pilot based channel estimation design in covert wireless communication"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "covert transmission with a self sustained relay"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "covert wireless communications with channel inversion power control in rayleigh fading"
    - "covert communication achieved by a greedy relay in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "covert wireless communication in presence of a multi antenna adversary and delay constraints"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "achieving covert wireless communications using a full duplex receiver"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "covert wireless communications with channel inversion power control in rayleigh fading"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-3 (induced by source paper "low probability of detection communication opportunities and challenges"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "covert bits through queues"

Connected through hyperedge HE-4 (induced by source paper "covert wireless communications with channel inversion power control in rayleigh fading"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "adaptive full duplex jamming receiver for secure d2d links in random networks"
    - "covert communication in wireless relay networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "covert communication with finite blocklength in awgn channels"

Connected through hyperedge HE-5 (induced by source paper "joint optimization of a uav s trajectory and transmit power for covert communications"):
  with members:
    - "safeguarding wireless network with uavs a physical layer security perspective"
    - "capacity characterization of uav enabled two user broadcast channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "joint trajectory and communication design for multi uav enabled wireless networks"
    - "securing uav communications via trajectory optimization"
    - "covert wireless communication with a poisson field of interferers"
    - "energy efficient data collection in uav enabled wireless sensor network"
    - "on covert communication with noise uncertainty"

Connected through hyperedge HE-6 (induced by source paper "covert capacity of non coherent rayleigh fading channels"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "quantum secure covert communication on bosonic channels"
    - "covert communication gains from adversary s ignorance of transmission time"

Question: Please tell me which class the center node 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)