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 "performance of proportional fair scheduling for downlink non orthogonal multiple access systems"):
  Abstract: In this paper, we present the first analytical solution for performance analysis of proportional fair scheduling (PFS) in downlink non-orthogonal multiple access (NOMA) systems. Assuming an ideal NOMA system with an arbitrary number of multiplexed users, we derive a closed-form solution of the optimal power allocation for PFS and design a low-complexity algorithm for joint power allocation and user set selection. We develop an analytical model to analyze the throughput performance of this optimal solution based on stochastic channel modeling. Our analytical performance is proved to be the upper bound for PFS and is used to estimate user data rates and overall throughput in practical NOMA systems. We conduct system-level simulations to evaluate the accuracy of our data rate estimation. The simulation results verify our analysis on the upper bound of PFS performance in NOMA and confirm that using the analytical performance for data rate estimation guarantees high accuracy. The impact of partial and imperfect channel information on the estimation performance is investigated as well.

Includes members:
  Member "sub channel assignment power allocation and user scheduling for non orthogonal multiple access networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation in intelligent reflecting surface assisted noma systems")
  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 and channel allocation for non orthogonal multiple access in 5g systems tractability and computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "fairness for non orthogonal multiple access in 5g systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma 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)