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: "cooperative access in cognitive radio networks stable throughput and delay tradeoffs"
  Abstract: In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities. The proposed policy opens room for trading the PU delay for enhanced SU delay. Towards this objective, stability conditions for the queues involved in the system are derived. Furthermore, a moment generating function approach is employed to derive closed-form expressions for the average delay encountered by the packets of both users. Results reveal that cooperation expands the stable throughput region of the system and significantly reduces the delay at both users. Moreover, we quantify the gain obtained in terms of the SU delay under the proposed policy, over conventional relaying that gives strict priority to the relay queue. Index Terms—Cognitive relaying, moment generating function, stable throughput region, average delay. I. INTRODUCTION

Connected through hyperedge HE-1 (induced by source paper "stable throughput of cooperative cognitive networks with energy harvesting finite relay buffer and finite battery capacity"):
  with members:
    - "optimization of energy constrained wireless powered communication networks with heterogeneous nodes"
    - "non orthogonal multiple access schemes in wireless powered communication networks"
    - "on stable throughput of cognitive radio networks with cooperating secondary users"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "energy harvesting wireless communications a review of recent advances"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "energy efficient resource allocation for wireless powered communication networks"
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"

Connected through hyperedge HE-2 (induced by source paper "sensing decision based cooperative relaying schemes with multi access transmission stability region and average delay characterization"):
  with members:
    - "stable throughput in a cognitive wireless network"
    - "information theory vs queueing theory for resource allocation in multiple access channels"

Connected through hyperedge HE-3 (induced by source paper "cooperative cognitive radio network with energy harvesting stability analysis"):
  with members:
    - "optimal selection of spectrum sensing duration for an energy harvesting cognitive radio"

Connected through hyperedge HE-4 (induced by source paper "cognitive radio networks with probabilistic relaying stable throughput and delay tradeoffs"):
  with members:
    - "effective capacity of delay constrained cognitive radio links exploiting primary feedback"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"

Connected through hyperedge HE-5 (induced by source paper "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"):
  with members:
    - "cognitive radio networks with probabilistic relaying stable throughput and delay tradeoffs"

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)