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: "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"
  Abstract: In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput region of a cognitive radio network with a finite relaying buffer at the secondary user. Towards this objective, we formulate a constrained optimization problem for maximizing the secondary user throughput while guaranteeing the stability of the primary user queue. We consider a general cooperation policy where the packet admission and queue selection probabilities, at the secondary user, are both dependent on the state (length) of the finite relaying buffer. Despite the sheer complexity of the optimization problem, attributed to its non-convexity, we transform it to a linear program. Our numerical results reveal a number of valuable insights, e.g., it is always mutually beneficial to cooperate in delivering the primary packets in terms of expanding the stable throughput region. In addition, the stable throughput region of the system, compared to the case of infinite relaying queue capacity, marginally shrinks for limited relaying queue capacity.

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"
    - "cooperative access in cognitive radio networks stable throughput and delay tradeoffs"

Connected through hyperedge HE-2 (induced by source paper "on optimal spectrum access of cognitive relay with finite packet buffer"):
  with members:
    - "cognitive radio networks with probabilistic relaying stable throughput and delay tradeoffs"
    - "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:
    - "cognitive radio networks with probabilistic relaying stable throughput and delay tradeoffs"
    - "stable throughput in a cognitive wireless network"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "cooperation and underlay mode selection in cognitive radio network"):
  with members:
    - "maximum throughput of a cooperative energy harvesting cognitive radio user"
    - "protocol design and stability analysis of cooperative cognitive radio users"
    - "diversity of mimo multihop relay channels"

Connected through hyperedge HE-5 (induced by source paper "on optimizing cooperative cognitive user performance under primary qos constraints"):
  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)