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 "worst case robust distributed power allocation in shared unlicensed spectrum"):
  Abstract: This paper considers non-cooperative and fully-distributed power-allocation for selfish transmitterreceiver pairs in shared unlicensed spectrum when normalized-interference to each receiver is uncertain. We model each uncertain parameter by the sum of its nominal (estimated) value and a bounded additive error in a convex set, and show that the allocated power always converges to its equilibrium, called robust Nash equilibrium (RNE). In the case of a bounded and symmetric uncertainty region, we show that the power allocation problem for each user is simplified, and can be solved in a distributed manner. We derive the conditions for RNE’s uniqueness and for converge nce of the distributed algorithm; and show that the total throughput (social utility) is less than that at NE when RNE is unique. We also show that for multiple RNEs, the social utility may be higher at a RNE as compared to that at the corresponding NE, and demonstrate that this is caused by users’ orthogonal uti lization of bandwidth at RNE. Simulations confirm our analysis.

Includes members:
  Member "robust rate maximization game under bounded channel uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference coordination via power domain channel estimation")
  Member "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal power control for over the air computation in fading channels")
  Member "power control in cognitive radio networks how to cross a multi lane highway":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spreading information in mobile wireless networks")
  Member "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "large player games on wireless networks")
  Member "competitive design of multiuser mimo systems based on game theory a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "on peak versus average interference power constraints for protecting primary users in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmit power policy and ergodic multicast rate analysis of cognitive radio networks in generalized fading")
  Member "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mixed monotonic programming for fast global optimization")

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)