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: "a stronger soft covering lemma and applications"
  Abstract: Wyner's soft-covering lemma is a valuable tool for achievability proofs of information theoretic security, resolvability, channel synthesis, and source coding. The result herein sharpens the claim of soft-covering by moving away from an expected value analysis. Instead, a random codebook is shown to achieve the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block-length, enabling more powerful applications through the union bound.

Connected through hyperedge HE-1 (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"
    - "wiretap channels with random states non causally available at the encoder"
    - "secrecy via sources and channels"

Connected through hyperedge HE-2 (induced by source paper "distributed source simulation with no communication"):
  with members:
    - "decidability of non interactive simulation of joint distributions"
    - "secure cascade channel synthesis"
    - "on non interactive simulation of joint distributions"
    - "zero error coordination"
    - "exact common information"
    - "analysis of boolean functions"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"

Connected through hyperedge HE-3 (induced by source paper "exact exponent for soft covering"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "second order asymptotics in covert communication"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "renyi divergence and kullback leibler divergence"
    - "exact random coding error exponents of optimal bin index decoding"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-4 (induced by source paper "first and second order asymptotics in covert communication"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "finite blocklength bounds for wiretap channels"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-5 (induced by source paper "exact soft covering exponent"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "soft covering with high probability"
    - "renyi divergence and kullback leibler divergence"
    - "exact random coding error exponents of optimal bin index decoding"
    - "effective secrecy reliability confusion and stealth"
    - "distributed channel synthesis"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-6 (induced by source paper "wiretap channels nonasymptotic fundamental limits"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "semantic security capacity for wiretap channels of type ii"
    - "the third order term in the normal approximation for the awgn channel"
    - "converses for secret key agreement and secure computing"
    - "strong converse and second order asymptotics of channel resolvability"

Connected through hyperedge HE-7 (induced by source paper "the mac resolvability region semantic security and its operational implications"):
  with members:
    - "mac resolvability first and second order results"
    - "soft covering with high probability"
    - "semantic security capacity for wiretap channels of type ii"
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-8 (induced by source paper "soft covering with high probability"):
  with members:
    - "semantic security capacity for wiretap channels of type ii"
    - "strong converse and second order asymptotics of channel resolvability"
    - "effective secrecy reliability confusion and stealth"
    - "distributed channel synthesis"
    - "strong secrecy from channel resolvability"

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)