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: "joint spectrum allocation and structure optimization in green powered heterogeneous cognitive radio networks"
  Abstract: We aim at maximizing the sum rate of secondary users (SUs) in OFDM-based Heterogeneous Cognitive Radio (CR) Networks using RF energy harvesting. Assuming SUs operate in a time switching fashion, each time slot is partitioned into three non-overlapping parts devoted for energy harvesting, spectrum sensing and data transmission. The general problem of joint resource allocation and structure optimization is formulated as a Mixed Integer Nonlinear Programming task which is NP-hard and intractable. Thus, we propose to tackle it by decomposing it into two subproblems. We first propose a sub-channel allocation scheme to approximately satisfy SUs' rate requirements and remove the integer constraints. For the second step, we prove that the general optimization problem is reduced to a convex optimization task. Considering the trade-off among fractions of each time slot, we focus on optimizing the time slot structures of SUs that maximize the total throughput while guaranteeing the rate requirements of both real-time and non-real-time SUs. Since the reduced optimization problem does not have a simple closed-form solution, we thus propose a near optimal closed-form solution by utilizing Lambert-W function. We also exploit iterative gradient method based on Lagrangian dual decomposition to achieve near optimal solutions. Simulation results are presented to validate the optimality of the proposed schemes.

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)