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: "mitigation of phase noise in massive mimo systems a rate splitting approach"
  Abstract: This work encompasses Rate-Splitting (RS), providing significant benefits in multi-user settings in the context of huge degrees of freedom promised by massive Multiple-Input Multiple-Output (MIMO). However, the requirement of massive MIMO for cost-efficient implementation makes them more prone to hardware imperfections such as phase noise (PN). As a result, we focus on a realistic broadcast channel with a large number of antennas and hampered by the unavoidable PN. Moreover, we employ the RS transmission strategy, and we show its robustness against PN, since the sum-rate does not saturate at high signal-to-noise ratio (SNR). Although, the analytical results are obtained by means of the deterministic equivalent analysis, they coincide with simulation results even for finite system dimensions.

Connected through hyperedge HE-1 (induced by source paper "rate splitting robustness in multi pair massive mimo relay systems"):
  with members:
    - "rate splitting to mitigate residual transceiver hardware impairments in massive mimo systems"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "rate splitting for mimo wireless networks a promising phy layer strategy for lte evolution"
    - "a rate splitting strategy for massive mimo with imperfect csit"
    - "hardware impairments aware transceiver for full duplex massive mimo relaying"
    - "rate analysis of two receiver miso broadcast channel with finite rate feedback a rate splitting approach"
    - "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"
    - "multipair full duplex relaying with massive arrays and linear processing"

Connected through hyperedge HE-2 (induced by source paper "toward a realistic assessment of multiple antenna hcns residual additive transceiver hardware impairments and channel aging"):
  with members:
    - "impact of general channel aging conditions on the downlink performance of massive mimo"
    - "performance of massive mimo uplink with zero forcing receivers under delayed channels"
    - "cell edge aware precoding for downlink massive mimo cellular networks"
    - "rate splitting to mitigate residual transceiver hardware impairments in massive mimo systems"
    - "analysis and design of secure massive mimo systems in the presence of hardware impairments"
    - "downlink mimo hcns with residual transceiver hardware impairments"
    - "sum rate and power scaling of massive mimo systems with channel aging"
    - "downlink performance of massive mimo under general channel aging conditions"

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)