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 "dynamic spectrum management a complete complexity characterization"):
  Abstract: Consider a multi-user multi-carrier communication system where multiple users share multiple discrete subcarriers. To achieve high spectrum efficiency, the users in the system must choose their transmit power dynamically in response to fast channel fluctuations. Assuming perfect channel state information, two formulations for the spectrum management (power control) problem are considered in this paper: the first is to minimize the total transmission power subject to all users' transmission data rate constraints, and the second is to maximize the min-rate utility subject to individual power constraints at each user. It is known in the literature that both formulations of the problem are polynomial time solvable when the number of subcarriers is one and strongly NP-hard when the number of subcarriers are greater than or equal to three. However, the complexity characterization of the problem when the number of subcarriers is two has been missing for a long time. This paper answers this long-standing open question: both formulations of the problem are strongly NP-hard when the number of subcarriers is two.

Includes members:
  Member "complexity analysis of joint subcarrier and power allocation for the cellular downlink ofdma system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weighted sum rate maximization in multi carrier noma with cellular power constraint")
  Member "on the complexity of joint subcarrier and power allocation for multi user ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "harq cc enabled noma designs with outage probability constraints")
  Member "on the scale algorithm for multiuser multicarrier power spectrum management":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conic quadratic formulations for wireless communications design")
  Member "linear transceiver design for a mimo interfering broadcast channel achieving max min fairness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "load balancing user association in millimeter wave mimo networks")

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)