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: "new algorithms for maximizing cellular wireless network energy efficiency"
  Abstract: In this paper, we aim to maximize the energy efficiency of cellular wireless networks. Specifically, we address the power allocation problem in multi-cell multi-carrier systems. Considering realistic base station power consumption models, we formulate a network-wide energy efficiency maximization problem. Using tools from fractional programming, we cast this problem in the framework of bi-criterion optimization where rate maximization and power minimization are weighted accordingly. Interference pricing mechanism is applied to reduce the intercell interference and to achieve a higher network performance. We decompose the main problem into subproblems via dual decomposition. These subproblems are independently solved per sector using limited information exchange between base stations. We first derive our expressions and present algorithms for the single-tier networks. Then, we extend our analysis to two-tier networks where picocell base stations are deployed to improve the network performance and reduce the link distances. Lastly, we extend our framework and include the quality-of-service constraints.We obtain closed-form expressions for the power level updates which are determined by the multi-level water-filling algorithm, or, as it is sometimes called as, the modified waterfilling algorithm. Based on our simulation results, we demonstrate that the proposed algorithms can outperform the benchmark approaches in terms of energy efficiency by a factor of 2.7.

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.NI(Networking and Internet Architecture)