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 "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints"):
  Abstract: Degrees of freedom (DoF) gains are studied in wireless networks with cooperative transmission under a backhaul load constraint that limits the average number of messages that can be delivered from a centralized controller to base station transmitters. The backhaul load is defined as the sum of all the messages available at all the transmitters per channel use, normalized by the number of users. For Wyner's linear interference network, where each transmitter is connected to the receiver having the same index as well as one succeeding receiver, the per user DoF is characterized and the optimal scheme is presented. Furthermore, it is shown that the optimal assignment of messages to transmitters is asymmetric and satisfies a local cooperation constraint, and that the optimal coding scheme relies only on one-shot cooperative zero-forcing transmit beamforming. Using insights from the analysis of Wyner's linear interference network, the results are extended to the more practical hexagonal sectored cellular network, and coding schemes based on cooperative zero-forcing are shown to deliver significant DoF gains. It is established that by allowing for cooperative transmission and a flexible message assignment that is constrained only by an average backhaul load, one can deliver the rate gains promised by information-theoretic upper bounds with practical one-shot schemes that incur little or no additional load on the backhaul. Finally, useful upper bounds on the per user DoF for schemes based on cooperative zero-forcing are presented for lower values of the average backhaul load constraint, and an optimization framework is formulated for the general converse problem.

Includes members:
  Member "layered downlink precoding for c ran systems with full dimensional mimo":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimization of massive full dimensional mimo for positioning and communication")
  Member "conferencing in wyner s asymmetric interference network effect of number of rounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint uplink downlink cell associations for interference networks with local connectivity")
  Member "network mimo transmitters with no csi can still be very useful":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust regularized zf in cooperative broadcast channel under distributed csit")
  Member "cloud based topological interference management a case with no cooperative transmission gain":
    also connected through other hyperedges:
      (none)
  Member "cell associations that maximize the average uplink downlink degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint uplink downlink cell associations for interference networks with local connectivity")
  Member "cloud radio access network virtualizing wireless access for dense heterogeneous systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "performance of cloud radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint uplink downlink cell associations for interference networks with local connectivity")
  Member "topological interference management with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")

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)