human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "outage balancing in downlink non orthogonal multiple access with statistical channel state information"
  Abstract: This paper considers a downlink non-orthogonal multiple access (NOMA) system where the source intends to transmit independent information to the users at targeted data rates under statistical channel state information at the transmitter. The problem of outage balancing among the users is studied with the issues of power allocation, decoding order selection, and user grouping being taken into account. Specifically, with regard to the max-min fairness criterion, we derive the optimal power allocation in closed-form and prove the corresponding optimal decoding order for the elementary downlink NOMA system. By assigning a weighting factor for each user, the analytical results can be used to evaluate the outage performance of the downlink NOMA system under various fairness constraints. Further, we investigate the case with user grouping, in which each user group can be treated as an elementary downlink NOMA system. The associated problems of power and resource allocation among different user groups are solved. The implementation complexity issue of NOMA is also considered with focus on that caused by successive interference cancellation and user grouping. The complexity and performance tradeoff is analyzed by simulations, which provides fruitful insights for the practical application of NOMA. The simulation results substantiate our analysis and show considerable performance gain of NOMA when compared with orthogonal multiple access.

Question: Please tell me which class the center node 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)