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 "almost exact analysis of soft covering lemma via large deviation"):
  Abstract: This paper investigates the soft covering lemma under both the relative entropy and the total variation distance as the measures of deviation. The exact order of the expected deviation of the random i.i.d. code for the soft covering problem problem, is determined. The proof technique used in this paper significantly differs from the previous techniques for deriving exact exponent of the soft covering lemma. The achievability of the exact order follows from applying the change of measure trick (which has been broadly used in the large deviation) to the known one-shot bounds in the literature. For the ensemble converse, some new inequalities of independent interest derived and then the change of measure trick is applied again. The exact order of the total variation distance is similar to the exact order of the error probability, thus it adds another duality between the channel coding and soft covering. Finally, The results of this paper are valid for any memoryless channels, not only channels with finite alphabets.

Includes members:
  Member "exact soft covering exponent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a survey")
  Member "a correlation measure based on vector valued l_p norms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "playing games with bounded entropy convergence rate and approximate equilibria")
  Member "exact random coding secrecy exponents for the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "mismatched decoding error exponents second order rates and saddlepoint approximations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "refinement of the random coding bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "second order asymptotics of sequential hypothesis testing")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")

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)