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: "covert communication over noisy channels a resolvability perspective"
  Abstract: We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel, while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that irrespective of the quality of the channels, it is possible to communicate on the order of    $\sqrt {n}$    reliable and covert bits over    $n$    channel uses if the transmitter and the receiver share on the order of    $\sqrt {n}$    key bits. This improves upon earlier results requiring on the order of    $\sqrt {n}\log n$    key bits. Second, it proves that if the receiver’s channel is better than the warden’s channel in a sense that we make precise, it is possible to communicate on the order of    $\sqrt {n}$    reliable and covert bits over    $n$    channel uses without a secret key. This generalizes earlier results established for binary symmetric channels. We also identify the fundamental limits of covert and secret communications in terms of the optimal asymptotic scaling of the message size and key size, and we extend the analysis to Gaussian channels. The main technical problem that we address is how to develop concentration inequalities for low-weight sequences. The crux of our approach is to define suitably modified typical sets that are amenable to concentration inequalities.

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"
    - "strong secrecy for cooperative broadcast channels"

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 "optimal resolution of change point detection with empirically observed statistics and erasures"):
  with members:
    - "distributed detection with empirically observed statistics"
    - "second order asymptotically optimal statistical classification"
    - "selective review of offline change point detection methods"
    - "time division is optimal for covert communication over some broadcast channels"
    - "fundamental limits of communication with low probability of detection"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "asymptotically optimal matching of multiple sequences to source distributions and training sequences"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-4 (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"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "solutions for the mimo gaussian wiretap channel with a cooperative jammer"

Connected through 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"):
  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 gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-6 (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"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-7 (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-8 (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"

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)