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: "a lower bound on the data rate of dirty paper coding in general noise and interference"
  Abstract: Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the interference are statistically independent Gaussian random sequences. More recent works extended this approach to the case where the noise and the interference are mutually independent and at least one of them is Gaussian. In this letter we further extend the DPC scheme by relaxing the Gaussian and statistical independence assumptions. We provide lower bounds on the achievable data rates in a DPC setting for the case of possibly dependent noise, interference and input signals. Also, the interference and noise terms are allowed to have arbitrary probability distributions. The bounds are relatively simple, are phrased in terms of second-order statistics, and are tight when the actual noise distribution is close to Gaussian.

Connected through hyperedge HE-1 (induced by source paper "uplink downlink rate balancing and throughput scaling in fdd massive mimo systems"):
  with members:
    - "uplink downlink rate balancing in cooperating cellular networks"
    - "massive mimo for next generation wireless systems"
    - "downlink training techniques for fdd massive mimo systems open loop and closed loop training with memory"
    - "noncoherent trellis coded quantization a practical limited feedback technique for massive mimo systems"
    - "designing multi user mimo for energy efficiency when is massive mimo the answer"
    - "massive mimo systems signal processing challenges and research trends"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"

Connected through hyperedge HE-2 (induced by source paper "uplink downlink rate balancing in cooperating cellular networks"):
  with members:
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "fundamental limits of cooperation"
    - "large system analysis of linear precoding in correlated miso broadcast channels under limited feedback"
    - "multi user diversity vs accurate channel state information in mimo downlink channels"
    - "massive mimo how many antennas do we need"
    - "bounds on the capacity of ofdm underspread frequency selective fading channels"
    - "completely stale transmitter channel state information is still very useful"
    - "interference alignment with analog channel state feedback"

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)