human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "stable throughput of cooperative cognitive networks with energy harvesting finite relay buffer and finite battery capacity"):
  Abstract: This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite length relaying queue as well as a finite length battery queue. Our prime objective is to characterize the stable throughput region. Nevertheless, the complete characterization of stable throughput region is notoriously difficult, since the computation of the steady state distribution of the two-dimensional Markov Chain (MC) model for both finite queues is prohibitively complex. We first propose an algorithm to characterize the stable throughput region numerically, and show its sheer computational complexity for large queue lengths. Hence, we next focus on two simpler systems, namely, finite battery queue with infinite relay queue and finite relay queue with infinite battery queue. The motivation behind the relaxation of having two finite queues at the same time is to lend tractability, explore the nature of design parameters optimization at the cognitive node and provide efficient lower computational complexity algorithms for stable throughput region characterization. For each proposed system, we investigate the maximum service rate of the cognitive node subject to stability conditions. Despite the complexity of the formulated optimization problems due to their non-convexity, we exploit the problems' structure to transform them into linear programs. Thus, we are able to solve them efficiently using standard linear programming solvers. Our numerical results demonstrate that, in practical systems, finite battery and relaying queues achieve the same level of benefits of a system with infinite queue sizes when their sizes are sufficiently large. They also reveal that the achievable stable throughput region significantly expands when the arrival rate of the energy harvesting process increases.

Includes members:
  Member "optimization of energy constrained wireless powered communication networks with heterogeneous nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "non orthogonal multiple access schemes in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "on stable throughput of cognitive radio networks with cooperating secondary users":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding")
  Member "on optimal policies in full duplex wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "effect of energy harvesting on stable throughput in cooperative relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a random access g network stability stable throughput and queueing analysis")
  Member "energy efficient resource allocation for wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "common throughput maximization for uav enabled interference channel with wireless powered communications")
  Member "cooperative access in cognitive radio networks stable throughput and delay tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sensing decision based cooperative relaying schemes with multi access transmission stability region and average delay characterization")

Question: Please tell me which class the source paper 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.IT(Information Theory)