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: "wiretap channels with random states non causally available at the encoder"
  Abstract: We study the state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes all other instances of CSI availability as special cases, and calls for an efficient utilization of the state sequence both for reliability and security purposes. A lower bound on the secrecy-capacity, that improves upon the previously best known result by Chen and Han Vinck, is derived based on a novel superposition coding scheme. An example in which the proposed scheme achieves strictly higher rates is provided. Specializing the lower bound to the case where CSI is also available to the decoder reveals that the lower bound is at least as good as the achievable formula by Chia and El-Gamal, which is already known to outperform the adaptation of the Chen and Han Vinck code to the encoder and decoder CSI scenario. Our achievability gives rise to the exact secrecy-capacity characterization of a class of SD-WTCs that decompose into a product of two WTCs, one is independent of the state and the other one depends only on it. The results are derived under the strict semantic-security metric that requires negligible information leakage for all message distributions. The proof of achievability relies on a stronger version of the soft-covering lemma for superposition codes.

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"
    - "covert communication over noisy channels a resolvability perspective"
    - "strong secrecy for cooperative broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "wiretap channels with causal state information revisited"):
  with members:
    - "wiretap channels with causal state information strong secrecy"
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "the likelihood encoder for lossy compression"
    - "a stronger soft covering lemma and applications"
    - "secrecy via sources and channels"

Connected through hyperedge HE-3 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "capacity of the state dependent wiretap channel secure writing on dirty paper"
    - "analogy between gambling and measurement based work extraction"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"
    - "converses for secret key agreement and secure computing"

Connected through hyperedge HE-4 (induced by source paper "broadcast channels with privacy leakage constraints"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "a technique for deriving one shot achievability results in network information theory"
    - "effective secrecy reliability confusion and stealth"
    - "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"

Connected through hyperedge HE-5 (induced by source paper "semantically secured message key trade off over wiretap channels with random parameters"):
  with members:
    - "wiretap channels with causal state information strong secrecy"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "informational divergence approximations to product distributions"
    - "secret key generation using correlated sources and channels"
    - "a cryptographic treatment of the wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "a unified approach to source and message compression"):
  with members:
    - "a one shot achievability result for quantum state redistribution"
    - "simple one shot bounds for various source coding problems using smooth renyi quantities"
    - "on the dispersions of three network information theory problems"
    - "a technique for deriving one shot achievability results in network information theory"
    - "distributed channel synthesis"
    - "fixed length lossy compression in the finite blocklength regime"
    - "information equals amortized communication"
    - "communication requirements for generating correlated random variables"

Connected through hyperedge HE-7 (induced by source paper "covert communication with channel state information at the transmitter"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "strong secrecy for cooperative broadcast channels"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "distributed channel synthesis"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-8 (induced by source paper "wiretap channels with causal state information strong secrecy"):
  with members:
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "secrecy via sources and channels"
    - "secret key agreement with channel state information at the transmitter"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

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)