human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "control of status updates for energy harvesting devices that monitor processes with alarms"
  Abstract: In this work, we derive optimal transmission policies in an energy harvesting status update system. The system monitors a stochastic process which can be either in a normal or in an alarm state of operation. We capture the freshness of status updates for each state of the stochastic process by introducing two Age of Information (AoI) variables and extend the definition of AoI to account for the state changes of the stochastic process. We formulate the problem at hand as a Markov Decision Process which, under the assumption that the demand for status updates is higher when the stochastic process is in the alarm state, utilizes a transition cost function that applies linear and non-linear penalties based on AoI and the state of the stochastic process. Finally, we evaluate numerically the derived policies and illustrate their effectiveness for reserving energy in anticipation of future alarm states.

Connected through hyperedge HE-1 (induced by source paper "timely synchronization with sporadic status changes"):
  with members:
    - "scheduling to minimize age of synchronization in wireless broadcast networks with random updates"
    - "the age of incorrect information a new performance metric for status updates"
    - "timely cloud computing preemption and waiting"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"

Connected through hyperedge HE-2 (induced by source paper "timely distributed computation with stragglers"):
  with members:
    - "straggler mitigation at scale"
    - "trading off computation with transmission in status update systems"
    - "age of information with prioritized streams when to buffer preempted packets"
    - "sampling for remote estimation through queues age of information and beyond"
    - "computation scheduling for distributed machine learning with straggling workers"
    - "age of information for computation intensive messages in mobile edge computing"
    - "age of information for discrete time queues"
    - "on timely channel coding with hybrid arq"

Connected through hyperedge HE-3 (induced by source paper "optimal control of status updates in a multiple access channel with stability constraints"):
  with members:
    - "optimal status updating with a finite battery energy harvesting source"
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "age of information and throughput in a shared access network with heterogeneous traffic"
    - "coded status updates in an energy harvesting erasure channel"
    - "age of information performance of multiaccess strategies with packet management"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-4 (induced by source paper "the cost of delay in status updates and their value non linear ageing"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age of information in multicast networks with multiple update streams"
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "age of information in a network of preemptive servers"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "information aging through queues a mutual information perspective"
    - "sampling for data freshness optimization non linear age functions"

Question: Please tell me which class the center node 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)