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 "cross layer control for worse case delay guarantees in heterogeneous powered wireless sensor network via lyapunov optimization"):
  Abstract: The delay guarantee is a challenge in wireless sensor networks (WSNs), where energy constraints must be considered. The coexistence of renewable energy and electricity grid is expected as a promising energy supply manner for WSNs to remain function for a potentially infinite lifetime. In this paper, we address cross-layer control to guarantee worse case delay for Heterogeneous Powered (HP) WSNs. We design a novel virtual delay queue structure, and apply the Lyapunov optimization technique to develop cross-layer control algorithm only requiring knowledge of the instantaneous system state, which provides efficient throughput-utility, and guarantees bounded worst-case delay. We analyze the performance of the proposed algorithm and verify the theoretic claims through the simulation results. Compared to the existing work, the algorithm presented in this paper achieves much higher optimal objective value with ultralow data drop due to the proposed novel virtual queue structure.

Includes members:
  Member "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "novel architectures and algorithms for delay reduction in back pressure scheduling and routing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely throughput optimal scheduling with prediction")

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.NI(Networking and Internet Architecture)