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 "optimum fairness for non orthogonal multiple access"):
  Abstract: This paper focuses on the fairness issue in non-orthogonal multiple access (NOMA) and investigates the optimization problem that maximizes the worst user's achievable rate. Unlike previous studies, we derive a closed-form expression for the optimal value and solution, which are related to Perron-Frobenius eigenvalue and eigenvector of a defined positive matrix. On this basis, we propose an iterative algorithm to compute the optimal solution, which has linear convergence and requires only about half iterations of the classical bisection method.

Includes members:
  Member "when mmwave communications meet network densification a scalable interference coordination perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maritime coverage enhancement using uavs coordinated with hybrid satellite terrestrial networks")
  Member "a two phase power allocation scheme for crns employing noma":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "a new noma approach for fair power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of power allocation strategies for downlink multi user noma with target rates")
  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")

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)