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 "transmit designs for the mimo broadcast channel with statistical csi"):
  Abstract: We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a near-optimal linear assignment matrix is derived. This reveals an interesting construction analogous to that of dirty-paper coding. In light of this, a low complexity transmission scheme is provided. Numerical examples illustrate the significant performance of the proposed low complexity scheme.

Includes members:
  Member "linear mimo precoding in jointly correlated fading multiple access channels with finite alphabet signaling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity in mimo channels with arbitrary inputs")
  Member "linear precoder design for mimo interference channels with finite alphabet signaling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  Member "linear beamforming for the spatially correlated miso broadcast channel":
    also connected through other hyperedges:
      (none)
  Member "dirty paper coding for fading channels with partial transmitter side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "statistical eigenmode transmission over jointly correlated mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "dirty paper coding without channel information at the transmitter and imperfect estimation at the receiver":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dirty paper coding for fading channels with partial transmitter side information")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")

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)