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: "on linearly precoded rate splitting for mimo broadcast channels"
  Abstract: In this paper, we consider a general K-user multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the capacity region is well known to be achievable with dirty paper coding (DPC), we are interested in the simpler linearly precoded transmission schemes. First, using a simple two-user example, we show that any linear precoding scheme with only private streams can have an unbounded gap to the sum capacity of the channel. Then, we show that applying rate-splitting (RS) with minimum mean square error (MMSE) precoding, one can achieve the entire capacity region to within a constant gap in the two-user case. Remarkably, such constant-gap optimality of the RS scheme does not extend to the three-user case. Specifically, we derive the constant-gap sum rate of the three-user RS scheme and show that its gap to the sum capacity can be unbounded through a pathological example. For the general K-user RS scheme with arbitrary K, we derive a constant-gap sum rate upper bound that is shown numerically to be tight. Finally, we propose a practical stream elimination algorithm that can reduce the total number of active streams while preserving the constant-gap rate, i.e., with only a finite sum rate loss. Based on the same idea, we propose a second algorithm to order the 2^K-1 streams.

Connected through hyperedge HE-1 (induced by source paper "rate splitting for multi antenna downlink precoder design and practical implementation"):
  with members:
    - "rate splitting unifying sdma oma noma and multicasting in miso broadcast channel a simple two user rate analysis"
    - "linearly precoded rate splitting optimality and non optimality for mimo broadcast channels"
    - "rate splitting multiple access for downlink communication systems bridging generalizing and outperforming sdma and noma"
    - "hybrid beamforming via the kronecker decomposition for the millimeter wave massive mimo systems"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "robust transmission in downlink multiuser miso systems a rate splitting approach"
    - "a rate splitting strategy for massive mimo with imperfect csit"
    - "large system analysis of base station cooperation for power minimization"

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)