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: "interference reduction in multi cell massive mimo systems ii downlink analysis for a finite number of antennas"
  Abstract: Sharing global channel information at base stations (BSs) is commonly assumed for downlink multi-cell precoding. In the context of massive multi-input multi-output (MIMO) systems where each BS is equipped with a large number of antennas, sharing instant fading channel coefficients consumes a large amount of resource. To consider practically implementable methods, we study in this paper interference reduction based on precoding using the large-scale fading coefficients that depend on the path-loss model and are independent of a specific antenna. We focus on the downlink multi-cell precoding designs when each BS is equipped with a practically finite number of antennas. In this operation regime, pilot contamination is not the dominant source of interference, and mitigation of all types of interference is required. This paper uses an optimization approach to design precoding methods for equal qualities of service (QoS) to all users in the network, i.e.,maximizing the minimum signal-to-interference-plus-noise ratios (SINRs) among all users. The formulated optimization is proved to be quasi-convex, and can be solved optimally. We also propose low-complexity suboptimal algorithms through uplink and downlink duality. Simulation results show that the proposed precoding methods improve 5% outage rate for more than 10 3 times, compared to other known interference mitigation techniques.

Connected through hyperedge HE-1 (induced by source paper "pilot reuse factor with large scale fading precoding for massive mimo"):
  with members:
    - "massive mimo ten myths and one critical question"
    - "interference reduction in multi cell massive mimo systems i large scale fading precoding and decoding"
    - "massive mu mimo downlink tdd systems with linear precoding and downlink pilots"

Connected through hyperedge HE-2 (induced by source paper "sectoring in multi cell massive mimo systems"):
  with members:
    - "massive mimo for next generation wireless systems"
    - "interference reduction in multi cell massive mimo systems i large scale fading precoding and decoding"

Connected through hyperedge HE-3 (induced by source paper "interference reduction in multi cell massive mimo systems i large scale fading precoding and decoding"):
  with members:
    - "massive mimo for next generation wireless systems"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "achieving massive mimo spectral efficiency with a not so large number of antennas"
    - "massive mimo how many antennas do we need"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "pilot contamination and precoding in multi cell tdd systems"

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)