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 "keyless covert communication via channel state information"):
  Abstract: We consider the problem of covert communication over a state-dependent channel when the channel state is available either non-causally, causally, or strictly causally, either at the transmitter alone or at both transmitter and receiver. Covert communication with respect to an adversary, called "warden," is one in which, despite communication over the channel, the warden's observation remains indistinguishable from an output induced by innocent channel-input symbols. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver, the codebook uncertainty is typically removed via a shared secret key that is unavailable to the warden. In contrast to previous work, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Instead, shared randomness is extracted from the channel state in a manner that keeps it secret from the warden, despite the influence of the channel state on the warden's output. When channel state is available at the transmitter and receiver, we derive the covert capacity region. When channel state is only available at the transmitter, we derive inner and outer bounds on the covert capacity. We provide examples for which the covert capacity is positive with knowledge of channel state information but is zero without it.

Includes members:
  Member "first and second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "stealthy secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert secret key generation with an active warden")
  Member "wiretap channels with causal state information strong secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wiretap channels with causal state information revisited")
  Member "covert communication with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "the likelihood encoder for lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wiretap channels with causal state information revisited")
  Member "wiretap channels with random states non causally available at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wiretap channels with causal state information revisited")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "undetectable radios covert communication under spectral mask constraints")

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)