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 "second order asymptotics of sequential hypothesis testing"):
  Abstract: We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions P 0 and P 1 and we would like to decide which hypothesis is true using a sequential test. It is known from the work of Wald and Wolfowitz that as the expectation of the length of the test grows, the optimal type-I and type-II error exponents approach the relative entropies $D(P _1 \| P_0 )$ and $D(P_0\| P_1)$. We refine this result by considering the optimal backoff from the corner point of the achievable exponent region ($D(P _1 \| P_0 ), D(P_0\| P_1 ))$ under two different constraints on the length of the test (or the sample size). First, we consider a probabilistic constraint in which the probability that the length of test exceeds a prescribed integer n is less than a certain threshold $0 <\varepsilon < 1$. Second, the expectation of the sample size is bounded by n. In both cases, and under mild conditions, the backoff, also coined second-order asymptotics, is characterized precisely. Examples are provided to illustrate our results.

Includes members:
  Member "reliability of sequential hypothesis testing can be achieved by an almost fixed length test":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "utility maximizing sequential sensing over a finite horizon")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite sample analysis of image registration")
  Member "refinement of the random coding bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "refinement of the sphere packing bound asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "refined strong converse for the constant composition codes")
  Member "second order asymptotics in fixed length source coding and intrinsic randomness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")

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)