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 "new expressions for ergodic capacities of optical fibers and wireless mimo channels"):
  Abstract: Multimode/multicore fibers are expected to provide an attractive solution to overcome the capacity limit of current optical communication system. In presence of high crosstalk between modes/cores, the squared singular values of the input/output transfer matrix follow the law of the Jacobi ensemble of random matrices. Assuming that the channel state information is only available at the receiver, we derive in this paper a new expression for the ergodic capacity of the Jacobi MIMO channel. This expression involves double integrals which can be evaluated easily and efficiently. Moreover, the method used in deriving this expression does not appeal to the classical one-point correlation function of the random matrix model. Using a limiting transition between Jacobi and Laguerre polynomials, we derive a similar formula for the ergodic capacity of the Gaussian MIMO channel. The analytical results are compared with Monte Carlo simulations and related results available in the literature. A perfect agreement is obtained.

Includes members:
  Member "outage capacity for the optical mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gallager bound for mimo channels large n asymptotics")
  Member "the jacobi mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple bounds for the symmetric capacity of the rayleigh fading multiple access channel")
  Member "lll reduction achieves the receive diversity in mimo decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")

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)