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 "competitive use of multiple antennas"):
  Abstract: A game theoretic framework is presented to analyze the problem of finding the optimal number of data streams to transmit in a multi-user MIMO scenario, where both the transmitters and receivers are equipped with multiple antennas. Without channel state information (CSI) at any transmitter, and using outage capacity as the utility function with zero-forcing receiver, each user is shown to transmit a single data stream at Nash equilibrium in the presence of sufficient number of users. Transmitting a single data stream is also shown to be optimal in terms of maximizing the sum of the outage capacities in the presence of sufficient number of users. With CSI available at each transmitter, and using the number of successful bits per Joule of energy as the utility function, at Nash equilibrium, each user is shown to transmit a single data stream on the best eigen-mode that requires the least transmit power to achieve a fixed signal-to-interference ratio. Using the concept of locally gross direction preserving maps, existence of Nash equilibrium is shown when the number of successful bits per Joule of energy is used as the utility function.

Includes members:
  Member "power allocation games for mimo multiple access channels with coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "competitive design of multiuser mimo systems based on game theory a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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)