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 "on exact asymptotics of the error probability in channel coding symmetric channels"):
  Abstract: The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined. Regardless of the availability of feedback, it is shown that the order of the optimal sub-exponential factor exhibits a dichotomy. Moreover, the proof technique is used to establish the third-order term in the normal approximation for symmetric channels, where a similar dichotomy is shown to exist.

Includes members:
  Member "a new method for employing feedback to improve coding performance":
    also connected through other hyperedges:
      (none)
  Member "the sphere packing bound for dspcs with feedback a la augustin":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the renyi capacity and center")
  Member "exact asymptotics for the random coding error probability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the sphere packing bound for memoryless channels")
  Member "the saddlepoint approximation unified random coding asymptotics for fixed and varying rates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "mismatched decoding error exponents second order rates and saddlepoint approximations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "second order asymptotics of sequential hypothesis testing")
  Member "a derivation of the asymptotic random coding prefactor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the sphere packing bound via augustin s method")

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)