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: "limits of reliable communication with low probability of detection on awgn channels"
  Abstract: We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an intended receiver and a warden, both with non-zero noise power, we prove that o(√n) bits can be sent from the transmitter to the receiver in n channel uses while lower-bounding α + β ≥ 1-e for any e > 0, where α and β respectively denote the warden's probabilities of a false alarm when the sender is not transmitting and a missed detection when the sender is transmitting. Moreover, in most practical scenarios, a lower bound on the noise power on the channel between the transmitter and the warden is known and O(√n) bits can be sent in n LPD channel uses. Conversely, attempting to transmit more than O(√n) bits either results in detection by the warden with probability one or a non-zero probability of decoding error at the receiver as n→∞.

Connected through hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "stealthy secret key generation"
    - "wiretap channels with causal state information strong secrecy"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-2 (induced by source paper "undetectable radios covert communication under spectral mask constraints"):
  with members:
    - "covert communication over a compound channel"
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "covert communication over adversarially jammed channels"
    - "covert communication over a k user multiple access channel"
    - "time division is optimal for covert communication over some broadcast channels"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-3 (induced by source paper "multi antenna jamming in covert communication"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "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"
    - "reliable deniable communication hiding messages in noise"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "solutions for the mimo gaussian wiretap channel with a cooperative jammer"

Connected through hyperedge HE-4 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance"):
  with members:
    - "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints"
    - "first and second order asymptotics in covert communication"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-5 (induced by source paper "treating interference as noise is optimal for covert communication over interference channels"):
  with members:
    - "throughput scaling of covert communication over wireless adhoc networks"
    - "covert communication over a k user multiple access channel"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "time division is optimal for covert communication over some broadcast channels"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-6 (induced by source paper "multi antenna covert communications in random wireless networks"):
  with members:
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert wireless communication with a poisson field of interferers"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-7 (induced by source paper "covert transmission with a self sustained relay"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "wireless powered dense cellular networks how many small cells do we need"
    - "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"
    - "on covert communication with noise uncertainty"

Connected through hyperedge HE-8 (induced by source paper "secrecy and covert communications against uav surveillance via multi hop networks"):
  with members:
    - "safeguarding wireless network with uavs a physical layer security perspective"
    - "coverage probability analysis of uav cellular networks in urban environments"
    - "secure routing with power optimization for ad hoc networks"
    - "securing uav communications via joint trajectory and power control"
    - "multi hop routing in covert wireless networks"
    - "robust trajectory and transmit power design for secure uav communications"
    - "securing uav communications via trajectory optimization"
    - "covert communication in fading channels under channel uncertainty"

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)