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 "joint access point selection and power allocation for uplink wireless networks"):
  Abstract: We consider the distributed uplink resource allocation problem in a multi-carrier wireless network with multiple access points (APs). Each mobile user can optimize its own transmission rate by selecting a suitable AP and by controlling its transmit power. Our objective is to devise suitable algorithms by which mobile users can jointly perform these tasks in a distributed manner. Our approach relies on a game theoretic formulation of the joint power control and AP selection problem. In the proposed game, each user is a player with an associated strategy containing a discrete variable (the AP selection decision) and a continuous vector (the power allocation among multiple channels). We provide characterizations of the Nash Equilibrium of the proposed game. We present a novel algorithm named Joint Access Point Selection and Power Allocation (JASPA) and its various extensions (with different update schedules) that allow the users to efficiently optimize their rates. Finally, we study the properties of the proposed algorithms as well as their performance via extensive simulations.

Includes members:
  Member "signal processing and optimal resource allocation for the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one bit over the air aggregation for communication efficient federated edge learning design and convergence analysis")
  Member "mechanism design for base station association and resource allocation in downlink ofdma network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust radio resource allocation in miso scma assisted c ran in 5g networks")
  Member "averaged iterative water filling algorithm robustness and convergence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a parallel decomposition method for nonconvex stochastic multi agent optimization problems")
  Member "dynamic power allocation games in parallel multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost efficient throughput maximization in multi carrier cognitive radio systems")
  Member "game theory and the frequency selective interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "channel equilibrium networks for learning deep representation")
  Member "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "large player games on wireless networks")
  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)