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 "the sphere packing bound for memoryless channels"):
  Abstract: Sphere packing bounds (SPBs) ---with prefactors that are polynomial in the block length--- are derived for codes on two families of memoryless channels using Augustin's method: (possibly non-stationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e. empirical distribution, type) of the input codewords. A variant of Gallager's inner bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.

Includes members:
  Member "on exact asymptotics of the error probability in channel coding symmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "refined strong converse for the constant composition codes")
  Member "a simple derivation of the refined spb for the constant composition codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "refined strong converse for the constant composition codes")
  Member "the renyi capacity and center":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a simple derivation of the refined sphere packing bound under certain symmetry hypotheses")
  Member "saddlepoint approximations for short packet wireless communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple derivation of the refined sphere packing bound under certain symmetry hypotheses")
  Member "the augustin capacity and center":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "refined strong converse for the constant composition codes")
  Member "the augustin center and the sphere packing bound for memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the renyi capacity and center")
  Member "the capacity of gaussian mimo channels under total and per antenna power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "the sphere packing bound via augustin s method":
    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)