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 "age minimal online policies for energy harvesting sensors with random battery recharges"):
  Abstract: We consider an energy harvesting sensor that is sending measurement updates regarding some physical phenomenon to a destination. The sensor relies on energy harvested from nature to measure and send its updates, and is equipped with a battery of finite size to collect its harvested energy. The energy harvesting process is Poisson with unit rate, and arrives in amounts that fully recharge the battery. Our setting is online in the sense that the times of energy arrivals are revealed causally to the sensor after the energy is harvested; only the statistics of the arrival process is known a priori. Updates need to be sent in a timely manner to the destination, namely, such that the long term average age of information is minimized over the course of communication. The age of information is defined as the time elapsed since the freshest update has reached the destination. We first show that the optimal scheduling update policy is a renewal policy, and then show that it has a multi threshold structure: the sensor sends an update only if the age of information grows above a certain threshold that depends on the available energy.

Includes members:
  Member "status updates in a multi stream m g 1 1 preemptive queue":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "sending information through status updates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "scheduling status updates to minimize age of information with an energy harvesting sensor":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  Member "status updates through multicast networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "energy harvesting networks with general utility functions near optimal online policies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the optimal power control policy for an energy harvesting system with look ahead bernoulli energy arrivals")
  Member "timely updates over an erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age optimal information updates in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age and value of information non linear age case":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "who should google scholar update more often")

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)