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 "ergodic sum capacity of macrodiversity mimo systems in flat rayleigh fading"):
  Abstract: The prospect of base station (BS) cooperation leading to joint combining at widely separated antennas has led to increased interest in macrodiversity systems, where both sources and receive antennas are geographically distributed. In this scenario, little is known analytically about channel capacity since the channel matrices have a very general form where each path may have a different power. Hence, in this paper we consider the ergodic sum capacity of a macrodiversity MIMO system with arbitrary numbers of sources and receive antennas operating over Rayleigh fading channels. For this system, we compute the exact ergodic capacity for a two-source system and a compact approximation for the general system, which is shown to be very accurate over a wide range of cases. Finally, we develop a highly simplified upper-bound which leads to insights into the relationship between capacity and the channel powers. Results are verified by Monte Carlo simulations and the impact on capacity of various channel power profiles is investigated

Includes members:
  Member "statistical eigenmode transmission over jointly correlated mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "on the capacity of doubly correlated mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact statistical characterization of 2 times2 gram matrices with arbitrary variance profile")

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)