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: "exact soft covering exponent"
  Abstract: This work establishes the exact exponent for the soft-covering phenomenon of a memoryless channel under the total variation metric. The exponent, established herein, is a strict improvement (in both directions) on bounds found in the literature. This complements the recent literature establishing the exact exponent under the relative entropy metric; however, the proof techniques have significant differences, and we show that the total variation metric yields a more precise high-probability claim, in addition to the standard expected value claim. #R##N#This result implies new and improved bounds for various problems that use soft-covering as their achievability argument, including new lower bounds for the resolvability exponent and the secrecy exponent in the wiretap channel.

Connected through hyperedge HE-1 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "exact random coding secrecy exponents for the wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "sharp bounds for mutual covering"):
  with members:
    - "a unified framework for one shot achievability via the poisson matching lemma"
    - "strong functional representation lemma and applications to coding theorems"
    - "secret key generation with limited interaction"
    - "the likelihood encoder for lossy compression"
    - "the generalized stochastic likelihood decoder random coding and expurgated bounds"
    - "on non interactive simulation of joint distributions"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "one shot marton inner bound for classical quantum broadcast channel"

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

Connected through hyperedge HE-4 (induced by source paper "almost exact analysis of soft covering lemma via large deviation"):
  with members:
    - "a correlation measure based on vector valued l_p norms"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "distributed channel synthesis"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "a correlation measure based on vector valued l_p norms"):
  with members:
    - "exact exponent for soft covering"
    - "generalizing bottleneck problems"
    - "measuring secrecy by the probability of a successful guess"
    - "r enyi resolvability and its applications to the wiretap channel"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "a large deviations approach to secure lossy compression"
    - "f divergence inequalities"
    - "semantic security capacity for wiretap channels of type ii"

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)