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 "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"):
  Abstract: In this paper, we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi–Poor–Verdu, and are investigated under parallel AWGN channels, the AWGN channel, the BI-AWGN channel, and the BSC. The technique we use, which is a generalization of some recent results available from the literature, is to map the probabilities of interest into a Laplace integral, and then solve (or approximate) the integral by use of a steepest descent technique. The proposed results are particularly useful for short packet lengths, where the normal approximation may provide unreliable results.

Includes members:
  Member "exact asymptotics for the random coding error probability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on exact asymptotics of the error probability in channel coding symmetric channels")
  Member "on the evaluation of the polyanskiy poor verdu converse bound for finite block length coding in awgn":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "green communication via type i arq finite block length analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  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 "the log volume of optimal codes for memoryless channels asymptotically within a few nats":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")
  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")

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)