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 "distributed linear precoder optimization and base station selection for an uplink heterogeneous network"):
  Abstract: In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a network is to jointly optimize users' linear procoders as well as their BS associations. In this paper, we first show that this joint optimization problem is NP-hard and thus is difficult to solve to global optimality. To find a locally optimal solution, we formulate the problem as a noncooperative game in which the users and the BSs both act as players. We introduce a set of new utility functions for the players and show that every Nash equilibrium (NE) of the resulting game is a stationary solution of the original sum utility maximization problem. Moreover, we develop a best-response type algorithm that allows the players to distributedly reach a NE of the game. Simulation results show that the proposed distributed algorithm can effectively relieve local BS congestion and simultaneously achieve high throughput and load balancing in a heterogeneous network.

Includes members:
  Member "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mixed monotonic programming for fast global optimization")
  Member "linear transceiver design for a mimo interfering broadcast channel achieving max min fairness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "load balancing user association in millimeter wave mimo networks")
  Member "joint distributed access point selection and power allocation in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "database assisted distributed spectrum sharing")
  Member "balancing egoism and altruism on the interference channel the mimo case":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "cooperative interference management with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "intelligent reflecting surface aided multiple access capacity region and deployment strategy")
  Member "on the base station selection and base station sharing in self configuring networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a comprehensive survey of potential game approaches to wireless networks")
  Member "competitive design of multiuser mimo systems based on game theory a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")

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)