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 "uplink downlink rate balancing in cooperating cellular networks"):
  Abstract: Broadcast MIMO techniques can significantly increase the throughput in the downlink of cellular networks, at the price of channel state information (CSI) feedback from the mobiles, sent over the uplink. Thus, it creates a mechanism that can tradeoff some uplink capacity for increased downlink capacity. In this work we quantify this tradeoff and study the exchange ratio between the feedback rate (over the uplink) and the downlink rate. We study both finite and infinite networks, and show that for high enough (but finite) SNR, the uplink rate can be exchanged for increased downlink rate with a favorable exchange ratio. This exchange ratio is an increasing function of the channel coherence time, and a decreasing function of the number of measured base stations. We also show that devoting a constant fraction of the uplink to CSI feedback can increase the downlink multiplexing gain continuously from 0 to 1, in finite networks. On the other hand, in infinite networks (with infinite connectivity) our bounds can only show doubly logarithmic scaling of the rate with SNR. The presented results prove that the adaptation of the feedback rate can control the balance between the uplink and downlink rates. This capability is very important in modern cellular networks, where the operators need to respond to continuously changing user demands.

Includes members:
  Member "a lower bound on the data rate of dirty paper coding in general noise and interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uplink downlink rate balancing and throughput scaling in fdd massive mimo systems")
  Member "a coordinated approach to channel estimation in large scale multiple antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "fundamental limits of cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "large system analysis of linear precoding in correlated miso broadcast channels under limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covariance aided csi acquisition with non orthogonal pilots in massive mimo a large system performance analysis")
  Member "multi user diversity vs accurate channel state information in mimo downlink channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "delay performance of the multiuser miso downlink under imperfect csi and finite length coding")
  Member "massive mimo how many antennas do we need":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")
  Member "bounds on the capacity of ofdm underspread frequency selective fading channels":
    also connected through other hyperedges:
      (none)
  Member "completely stale transmitter channel state information is still very useful":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")

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)