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 "on the optimality of the whittle s index policy for minimizing the age of information"):
  Abstract: In this paper, we consider the average age minimization problem where a central entity schedules M users among the N available users for transmission over unreliable channels. It is well-known that obtaining the optimal policy, in this case, is out of reach. Accordingly, the Whittle's index policy has been suggested in earlier works as a heuristic for this problem. However, the analysis of its performance remained elusive. In the sequel, we overcome these difficulties and provide rigorous results on its asymptotic optimality in the many-users regime. Specifically, we first establish its optimality in the neighborhood of a specific system's state. Next, we extend our proof to the global case under a recurrence assumption, which we verify numerically. These findings showcase that the Whittle's index policy has analytically provable optimality in the many-users regime for the AoI minimization problem. Finally, numerical results that showcase its performance and corroborate our theoretical findings are presented.

Includes members:
  Member "age of information with prioritized streams when to buffer preempted packets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "minimizing the age of information noma or oma":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "status updates with priorities lexicographic optimality")
  Member "waiting before serving a companion to packet management in status update systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "whittle index policy for multichannel scheduling in queueing systems":
    also connected through other hyperedges:
      (none)
  Member "timely distributed computation with stragglers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "the age of incorrect information a new performance metric for status updates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  Member "minimum age of information in the internet of things with non uniform status packet sizes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "information freshness for timely detection of status changes")
  Member "a whittle index approach to minimizing functions of age of information":
    also connected through other hyperedges:
      (none)

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)