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 "basic performance limits and tradeoffs in energy harvesting sensor nodes with finite data and energy storage"):
  Abstract: As many sensor network applications require deployment in remote and hard-to-reach areas, it is critical to ensure that such networks are capable of operating unattended for long durations. Consequently, the concept of using nodes with energy replenishment capabilities has been gaining popularity. However, new techniques and protocols must be developed to maximize the performance of sensor networks with energy replenishment. Here, we analyze limits of the performance of sensor nodes with limited energy, being replenished at a variable rate. We provide a simple localized energy management scheme that achieves a performance close to that with an unlimited energy source, and at the same time keeps the probability of complete battery discharge low. Based on the insights developed, we address the problem of energy management for energy-replenishing nodes with finite battery and finite data buffer capacities. To this end, we give an energy management scheme that achieves the optimal utility asymptotically while keeping both the battery discharge and data loss probabilities low.

Includes members:
  Member "information theoretic analysis of an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "diffusion based molecular communication with limited molecule production rate")
  Member "optimal energy management policies for energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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.NI(Networking and Internet Architecture)