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: "cooperative multi cell networks impact of limited capacity backhaul and inter users links"
  Abstract: Cooperative technology is expected to have a great impact on the performance of cellular or, more generally, infrastructure networks. Both multicell processing (cooperation among base stations) and relaying (cooperation at the user level) are currently being investigated. In this presentation, recent results regarding the performance of multicell processing and user cooperation under the assumption of limited-capacity interbase station and inter-user links, respectively, are reviewed. The survey focuses on related results derived for non-fading uplink and downlink channels of simple cellular system models. The analytical treatment, facilitated by these simple setups, enhances the insight into the limitations imposed by limited-capacity constraints on the gains achievable by cooperative techniques.

Connected through hyperedge HE-1 (induced by source paper "cognitive wyner networks with clustered decoding"):
  with members:
    - "on optimal message assignments for interference channels with comp transmission"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "fundamental limits of cooperation"
    - "index coding an interference alignment perspective"
    - "interference channels with coordinated multi point transmission degrees of freedom message assignment and fractional reuse"
    - "interference cooperation and connectivity a degrees of freedom perspective"
    - "on the sum capacity of k user cascade gaussian z interference channel"

Connected through hyperedge HE-2 (induced by source paper "pricing based distributed downlink beamforming in multi cell ofdma networks"):
  with members:
    - "cooperative interference management with miso beamforming"
    - "approaching the capacity of wireless networks through distributed interference alignment"

Connected through hyperedge HE-3 (induced by source paper "uplink comp under a constrained backhaul and imperfect channel knowledge"):
  with members:
    - "application driven joint uplink downlink optimization in wireless communications"
    - "interference mitigation through limited receiver cooperation symmetric case"
    - "distributed mimo receiver achievable rates and upper bounds"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "on the optimal number of cooperative base stations in network mimo systems"):
  with members:
    - "optimized data sharing in multicell mimo with finite backhaul capacity"
    - "multi cell mimo downlink with fairness criteria the large system limit"
    - "training and feedback optimization for multiuser mimo downlink"

Connected through hyperedge HE-5 (induced by source paper "outage efficient strategies for network mimo with partial csit"):
  with members:
    - "on the optimal number of cooperative base stations in network mimo"
    - "on the maximal diversity order of spatial multiplexing with transmit antenna selection"
    - "degrees of freedom region for the mimo x channel"

Connected through hyperedge HE-6 (induced by source paper "on the optimal number of cooperative base stations in network mimo"):
  with members:
    - "training and feedback optimization for multiuser mimo downlink"

Connected through hyperedge HE-7 (induced by source paper "distributed mimo systems with oblivious antennas"):
  with members:
    - "capacity gain from two transmitter and two receiver cooperation"
    - "distributed mimo receiver achievable rates and upper bounds"

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)