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: "soft covering with high probability"
  Abstract: Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for simple achievability proofs in lossy source coding. This work 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 super-exponentially small in the block-length, enabling many applications through the union bound. This work gives bounds for both the exponential decay rate of total variation and the second-order codebook rate for soft covering.

Connected through hyperedge HE-1 (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"
    - "a stronger soft covering lemma and applications"
    - "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-2 (induced by source paper "modular design to transform codes for the wiretap channel of type i into codes for the wiretap channel of type ii"):
  with members:
    - "semantic security and the second largest eigenvalue of biregular graphs"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "semantic security capacity for wiretap channels of type ii"

Connected through hyperedge HE-3 (induced by source paper "exact soft covering exponent"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "a stronger soft covering lemma and applications"
    - "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-4 (induced by source paper "resolvability on continuous alphabets"):
  with members:
    - "channel resolvability theorems for general sources and channels"
    - "r enyi resolvability and its applications to the wiretap channel"
    - "mac resolvability first and second order results"
    - "the mac resolvability region semantic security and its operational implications"
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "informational divergence approximations to product distributions"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-5 (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"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "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-6 (induced by source paper "exact random coding secrecy exponents for the wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "on the secrecy exponent of the wire tap channel"
    - "exact random coding error exponents of optimal bin index decoding"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "distributed channel synthesis"

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"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "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 "mac resolvability first and second order results"):
  with members:
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "effective secrecy reliability confusion and stealth"
    - "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)