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 "gallager bound for mimo channels large n asymptotics"):
  Abstract: The use of multiple antenna arrays in transmission and reception has become an integral part of modern wireless communications. To quantify the performance of such systems, the evaluation of bounds on the error probability of realistic finite length codewords is important. In this paper, we analyze the standard Gallager error bound for both constraints of maximum average power and maximum instantaneous power. Applying techniques from random matrix theory, we obtain analytic expressions of the error exponent when the length of the codeword increases to infinity at a fixed ratio with the antenna array dimensions. Analyzing its behavior at rates close to the ergodic rate, we find that the Gallager error bound becomes asymptotically close to an upper error bound obtained recently by Hoydis et al. 2015. We also obtain an expression for the Gallager exponent in the case when the codelength spans several Rayleigh fading blocks, hence taking into account the situation when the channel varies during each transmission.

Includes members:
  Member "outage capacity for the optical mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "upper and lower bounds for the ergodic capacity of mimo jacobi fading channels")
  Member "moderate deviations in channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures")
  Member "living at the edge a large deviations approach to the outage mimo capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "backing off from infinity performance bounds via concentration of spectral measure for random mimo channels")
  Member "information spectrum approach to second order coding rate in channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "gallager s exponent for mimo channels a reliability rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "saddlepoint approximations for short packet wireless communications")

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)