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: "distributed energy efficient cross layer optimization for multihop mimo cognitive radio networks with primary user rate protection"
  Abstract: Due to the unique physical-layer characteristics associated with multiple-input multiple-output (MIMO) and cognitive radio (CR), the network performance is tightly coupled with mechanisms at the physical, link, network, and transport layers. In this paper, we consider an energy-efficient cross-layer optimization problem in multihop MIMO CR networks (CRNs) and provide a new formulation to balance the weighted network utility and the weighted power consumption of secondary users (SUs), with the minimum transmission rate constraint of primary users (PUs) and the SU power consumption constraint. However, this formulation is highly challenging due to the nonconvexity of the PU rate constraint. We propose a solution that features a linearization-based alternative optimization method and a heuristic primal recovery method. We further develop a distributed algorithm to jointly optimize the covariance matrix of the transmitted signal vector at each SU node, bandwidth allocation at each SU link, rate control at each session source, and multihop/multipath routing. Extensive simulation results demonstrate that the performance of the proposed distributed algorithm is very close to that of the centralized algorithm, and the proposed formulation provides an efficient way to save power consumption significantly, while achieving the network utility very close to that achieved with full power consumption.

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)