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 "optimal joint power and subcarrier allocation for mc noma systems"):
  Abstract: In this paper, we investigate the resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted system throughput. We employ monotonic optimization to develop the optimal joint power and subcarrier allocation policy. The optimal resource allocation policy serves as a performance benchmark due to its high complexity. Furthermore, to strike a balance between computational complexity and optimality, a suboptimal scheme with low computational complexity is proposed. Our simulation results reveal that the suboptimal algorithm achieves a close-to-optimal performance and MC-NOMA employing the proposed resource allocation algorithm provides a substantial system throughput improvement compared to conventional multicarrier orthogonal multiple access (MC-OMA).

Includes members:
  Member "power efficient resource allocation for mc noma with statistical channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "a minorization maximization method for optimizing sum rate in the downlink of non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "power efficient resource allocation for full duplex radio distributed antenna networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "distributive subband allocation power and rate control for relay assisted ofdma cellular system with imperfect system state knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust and secure resource allocation for full duplex miso multicarrier noma systems")

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)