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 "to skip or to switch minimizing age of information under link capacity constraint"):
  Abstract: Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the "freshness" of the status information available at the destination, we adopt the metric called Age of Information (AoI). We assume all updates are of the same size, and arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes $d$ ($d\geq 2$) time slots for the source to complete the transmission of an update. Therefore, when a new update when arrives at the source and it is transmitting another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average AoI at the destination. We prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision the source should take in any time slot has a multiple-threshold structure, and only depends on the age of the update being transmitted and the AoI in the system. The thresholds are then numerically identified by formulating the problem as a Markov Decision Process (MDP).

Includes members:
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "optimal status updating for an energy harvesting sensor with a noisy channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "age minimal online policies for energy harvesting sensors with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who should google scholar update more often")
  Member "scheduling status updates to minimize age of information with an energy harvesting sensor":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  Member "optimal status update for age of information minimization with an energy harvesting source":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "remote estimation of the wiener process over a channel with random delay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "update or wait how to keep your data fresh":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "who should google scholar update more often")
  Member "age of information in the presence of error":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")

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)