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 "large deviations behavior of the logarithmic error probability of random codes"):
  Abstract: This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC). In particular, it is shown that the probability of randomly drawing a codebook whose error exponent is smaller than the TRC exponent is exponentially small; upper and lower bounds for this exponent are given, which coincide in some cases. In addition, the probability of randomly drawing a codebook whose error exponent is larger than the TRC exponent is shown to be double-exponentially small; upper and lower bounds to the double-exponential exponent are given. The results suggest that codebooks whose error exponent is larger than the error exponent of the TRC are extremely rare. The key ingredient in the proofs is a new large deviations result of type class enumerators with dependent variables.

Includes members:
  Member "error exponents of typical random trellis codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a lagrange dual lower bound to the error exponent function of the typical random code")
  Member "error exponents of typical random codes for the colored gaussian channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a lagrange dual lower bound to the error exponent function of the typical random code")
  Member "error exponents of typical random codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a lagrange dual lower bound to the error exponent function of the typical random code")
  Member "the generalized stochastic likelihood decoder random coding and expurgated bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sharp bounds for mutual covering")
  Member "comparing the bit map and block map decoding thresholds of reed muller codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "revisiting bourgain kalai and fourier entropies")
  Member "channel detection in coded communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "exact random coding error exponents of optimal bin index decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sharp bounds for mutual covering")
  Member "typicality graphs large deviation analysis":
    also connected through other hyperedges:
      (none)

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)