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: "fundamentals of power allocation strategies for downlink multi user noma with target rates"
  Abstract: For a downlink multi-user non-orthogonal multiple access (NOMA) system with successive interference cancellation receivers, the fundamental relationship between the user channel gains, target rates, and power allocation is investigated. It is shown that the power allocation strategy is completely derived as functions of the users' target rates and the successive decoding order, and not of the channel gains, so long as the target rates have the same ordering as the user channel gains. It is proven that the total irremovable interference at each receiver has a fundamental upper-limit that is a function of the target rates, and the outage probability is one when this limit is exceeded. The concept of well-behaved power allocation strategies is defined and its properties are derived. It is shown that any power allocation strategy that has outage performance equal to orthogonal multiple access (OMA) is always well-behaved. Furthermore, it is proven that there always exists a well-behaved power allocation strategy that has improved outage probability performance over OMA. A specific well-behaved strategy is derived to demonstrate the improvement of NOMA over OMA for $K$ users. Simulations validate the theoretical results, and show that the best performance gains are obtained by the users with weaker channels.

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)