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 "mismatched decoding error exponents second order rates and saddlepoint approximations"):
  Abstract: This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous alphabets. The number of auxiliary costs required to match the error exponents and second-order rates of constant-composition coding is studied, and is shown to be at most two. For i.i.d. random coding, asymptotic estimates of two well-known non-asymptotic bounds are given using saddlepoint approximations. Each expression is shown to characterize the asymptotic behavior of the corresponding random-coding bound at both fixed and varying rates, thus unifying the regimes characterized by error exponents, second-order rates and moderate deviations. For fixed rates, novel exact asymptotics expressions are obtained to within a multiplicative 1+o(1) term. Using numerical examples, it is shown that the saddlepoint approximations are highly accurate even at short block lengths.

Includes members:
  Member "expurgated random coding ensembles exponents refinements and connections":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ratio list decoding")
  Member "multiuser coding techniques for mismatched decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mismatched multi letter successive decoding for the multiple access channel")
  Member "a general formula for the mismatch capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strategic communication with side information at the decoder")
  Member "refinement of the random coding bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "on exact asymptotics of the error probability in channel coding symmetric channels")
  Member "on achievable rates for channels with mismatched decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mismatched multi letter successive decoding for the multiple access channel")
  Member "moderate deviations in channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures")
  Member "refinement of the sphere packing bound asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "refined strong converse for the constant composition codes")

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)