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 "delay optimal scheduling for energy harvesting based communications"):
  Abstract: Green communication attracts increasing research interest recently. Equipped with a rechargeable battery, a source node can harvest energy from ambient environments and rely on this free and regenerative energy supply to transmit packets. Due to the uncertainty of available energy from harvesting, however, intolerably large latency and packet loss could be induced, if the source always waits for harvested energy. To overcome this problem, one Reliable Energy Source (RES) can be resorted to for a prompt delivery of backlogged packets. Naturally, there exists a tradeoff between the packet delivery delay and power consumption from the RES. In this paper, we address the delay optimal scheduling problem for a bursty communication link powered by a capacity-limited battery storing harvested energy together with one RES. The proposed scheduling scheme gives priority to the usage of harvested energy, and resorts to the RES when necessary based on the data and energy queueing processes, with an average power constraint from the RES. Through twodimensional Markov chain modeling and linear programming formulation, we derive the optimal threshold-based scheduling policy together with the corresponding transmission parameters. Our study includes three exemplary cases that capture some important relations between the data packet arrival process and energy harvesting capability. Our theoretical analysis is corroborated by simulation results.

Includes members:
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "optimal transmission policies for energy harvesting two hop networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed user association in energy harvesting small cell networks a probabilistic bandit model")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimum transmission policies for battery limited energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "optimal packet scheduling in an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "optimal energy management policies for energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achievable rate of multi antenna wsrns with eh constraint in the presence of a jammer")

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.ET(Emerging Technologies)