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: "cognitive radio networks with probabilistic relaying stable throughput and delay tradeoffs"
  Abstract: In this paper, we study and analyze fundamental throughput and 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. Moreover, admission control is introduced at the relay queue, whereby a PU's packet is admitted to the relay queue with an admission probability. The proposed policy introduces a fundamental tradeoff between the delays of the PU and SU. Consequently, it opens room for trading the PU delay for enhanced SU delay and vice versa. Thus, the system could be tuned according to the demands of the intended application. 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. The effect of varying the service and admission probabilities on the system's throughput and delay is thoroughly investigated. Results show that cooperation expands the stable throughput region. Moreover, numerical simulation results assert the extreme accuracy of the analytically derived delay expressions. In addition, we provide a criterion for the SU based on which it decides whether cooperation is beneficial to the PU or not. Furthermore, we show the impact of controlling the flow of data at the relay queue using the admission probability.

Connected through hyperedge HE-1 (induced by source paper "stability and dynamic control of underlay mobile edge networks"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "asymptotic laws for joint content replication and delivery in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on optimal spectrum access of cognitive relay with finite packet buffer"):
  with members:
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"
    - "buffer aided relaying with adaptive link selection"
    - "stable throughput in a cognitive wireless network"

Connected through hyperedge HE-3 (induced by source paper "on stable throughput of cognitive radio networks with cooperating secondary users"):
  with members:
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"
    - "stable throughput in a cognitive wireless network"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "energy aware cooperative wireless networks with multiple cognitive users"):
  with members:
    - "network level performance evaluation of a two relay cooperative random access wireless system"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-5 (induced by source paper "on optimizing cooperative cognitive user performance under primary qos constraints"):
  with members:
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"

Connected through hyperedge HE-6 (induced by source paper "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"):
  with members:
    - "cooperative access in cognitive radio networks 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)