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: "energy efficient cooperative cognitive relaying schemes for cognitive radio networks"
  Abstract: We investigate a cognitive radio network in which a primary user (PU) may cooperate with a cognitive radio user (i.e., a secondary user (SU)) for transmissions of its data packets. The PU is assumed to be a buffered node operating in a time-slotted fashion where the time is partitioned into equal-length slots. We develop two schemes which involve cooperation between primary and secondary users. To satisfy certain quality of service (QoS) requirements, users share time slot duration and channel frequency bandwidth. Moreover, the SU may leverage the primary feedback message to further increase both its data rate and satisfy the PU QoS requirements. The proposed cooperative schemes are designed such that the SU data rate is maximized under the constraint that the PU average queueing delay is maintained less than the average queueing delay in case of non-cooperative PU. In addition, the proposed schemes guarantee the stability of the PU queue and maintain the average energy emitted by the SU below a certain value. The proposed schemes also provide more robust and potentially continuous service for SUs compared to the conventional practice in cognitive networks where SUs transmit in the spectrum holes and silence sessions of the PUs. We include primary source burstiness, sensing errors, and feedback decoding errors to the analysis of our proposed cooperative schemes. The optimization problems are solved offline and require a simple 2-dimensional grid-based search over the optimization variables. Numerical results show the beneficial gains of the cooperative schemes in terms of SU data rate and PU throughput, average PU queueing delay, and average PU energy savings.

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)