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: "low complexity power allocation scheme for regenerative multi user relay networks"
  Abstract: In relay assisted wireless communications, the multi-source, single relay and single destination system (an M-1-1 system) has garnered significant interest, due to the increased demand for higher network throughput and connectivity. Previously, power allocation at the relay in M-1-1 systems have assumed availability of instantaneous channel state information (CSI), which is rather idealistic. In this paper we consider an M-1-1 Decode-and-Forward (DF), Full-Duplex, orthogonal frequency division multiple access (OFDMA) based relay system with statistical-CSI and analyze the achievable rate R of such a system. We show how R can only be maximized by numerical power allocation schemes which have high-complexity of order O(M 3 ). By introducing a rational approximation in the achievable rate analysis, we develop a low-complexity power allocation scheme at the relay that can obtain a system achievable rate very close to the maximum R. Most importantly, we show that the complexity of our power allocation scheme is of the order O(M log M). Our power allocation scheme is suitable for a multiuser relay system, where the priority is to maximize the system throughput. The work we present in this paper will be of value to the design and implementation of real-time multi-user relay systems operating under realistic channel conditions.

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)