human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "outage capacity for the optical mimo channel"
  Abstract: MIMO processing techniques in fiber optical communications have been proposed as a promising approach to meet increasing demand for information throughput. In this context, the multiple channels correspond to the multiple modes and/or multiple cores in the fiber. In this paper we characterize the distribution of the mutual information with Gaussian input in a simple channel model for this system. Assuming significant cross talk between cores, negligible backscattering and near-lossless propagation in the fiber, we model the transmission channel as a random complex unitary matrix. The loss in the transmission may be parameterized by a number of unutilized channels in the fiber. We analyze the system in a dual fashion. First, we evaluate a closed-form expression for the outage probability, which is handy for small matrices. We also apply the asymptotic approach, in particular the Coulomb gas method from statistical mechanics, to obtain closed-form results for the ergodic mutual information, its variance as well as the outage probability for Gaussian input in the limit of large number of cores/modes. By comparing our analytic results to simulations, we see that, despite the fact that this method is nominally valid for large number of modes, our method is quite accurate even for small to modest number of channels.

Connected through hyperedge HE-1 (induced by source paper "gallager bound for mimo channels large n asymptotics"):
  with members:
    - "moderate deviations in channel coding"
    - "living at the edge a large deviations approach to the outage mimo capacity"
    - "information spectrum approach to second order coding rate in channel coding"
    - "gallager s exponent for mimo channels a reliability rate tradeoff"

Connected through hyperedge HE-2 (induced by source paper "upper and lower bounds for the ergodic capacity of mimo jacobi fading channels"):
  with members:
    - "the jacobi mimo channel"

Connected through hyperedge HE-3 (induced by source paper "backing off from infinity performance bounds via concentration of spectral measure for random mimo channels"):
  with members:
    - "massive mimo for next generation wireless systems"
    - "bounds on the second order coding rate of the mimo rayleigh block fading channel"
    - "shannon meets nyquist capacity of sampled gaussian channels"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "on the distribution of mimo mutual information an in depth painleve based characterization"
    - "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling"
    - "achieving massive mimo spectral efficiency with a not so large number of antennas"
    - "signal processing in large systems a new paradigm"

Connected through hyperedge HE-4 (induced by source paper "new expressions for ergodic capacities of optical fibers and wireless mimo channels"):
  with members:
    - "the jacobi mimo channel"
    - "lll reduction achieves the receive diversity in mimo decoding"

Connected through hyperedge HE-5 (induced by source paper "capacity scaling in mimo systems with general unitarily invariant random matrices"):
  with members:
    - "backing off from infinity performance bounds via concentration of spectral measure for random mimo channels"
    - "applications of large random matrices in communications engineering"
    - "the jacobi mimo channel"

Question: Please tell me which class the center node 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)