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 "a whittle index approach to minimizing functions of age of information"):
  Abstract: We consider a setting where multiple active sources send real-time updates over a single-hop wireless broadcast network to a monitoring station. Our goal is to design a scheduling policy that minimizes the time-average of general non-decreasing cost functions of Age of Information. #R##N#We use a Whittle index based approach to find low complexity scheduling policies that have good performance, for reliable as well as unreliable channels. We prove that for a system with two sources, having possibly different cost functions and reliable channels, the Whittle index policy is exactly optimal. For reliable channels, we also derive structural properties of an optimal policy, that suggest that the performance of the Whittle index policy may be close to optimal in general. These results might also be of independent interest in the study of restless multi-armed bandit problems with similar underlying structure. Finally, we provide simulations comparing the Whittle index policy with optimal scheduling policies found using dynamic programming, which support our results.

Includes members:
  Member "a general formula for the stationary distribution of the age of information and its application to single server queues":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information vs value of information scheduling for cellular networked control systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "revealing much while saying less predictive wireless for status update")
  Member "performance characterization using aoi in a single loop networked control system":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probability analysis of age of information in multi hop networks")
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "the cost of delay in status updates and their value non linear ageing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis")
  Member "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "age and value of information non linear age case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-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)