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 "status updates with priorities lexicographic optimality"):
  Abstract: In this paper, we consider a transmission scheduling problem, in which several streams of status update packets with diverse priority levels are sent through a shared channel to their destinations. We introduce a notion of Lexicographic age optimality, or simply lex-age-optimality, to evaluate the performance of multi-class status update policies. In particular, a lex-age-optimal scheduling policy first minimizes the Age of Information (AoI) metrics for high-priority streams, and then, within the set of optimal policies for high-priority streams, achieves the minimum AoI metrics for low-priority streams. We propose a new scheduling policy named Preemptive Priority, Maximum Age First, Last-Generated, First-Served (PP-MAF-LGFS), and prove that the PP-MAF-LGFS scheduling policy is lex-age-optimal. This result holds (i) for minimizing any time-dependent, symmetric, and non-decreasing age penalty function; (ii) for minimizing any non-decreasing functional of the stochastic process formed by the age penalty function; and (iii) for the cases where different priority classes have distinct arrival traffic patterns, age penalty functions, and age penalty functionals. For example, the PP-MAF-LGFS scheduling policy is lex-age-optimal for minimizing the mean peak age of a high-priority stream and the time-average age of a low-priority stream. Numerical results are provided to illustrate our theoretical findings.

Includes members:
  Member "on the optimality of the whittle s index policy for minimizing the age of information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive power and rate control for real time status updating over fading channels")
  Member "age of information with prioritized streams when to buffer preempted packets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "waiting before serving a companion to packet management in status update systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "timely distributed computation with stragglers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "minimizing the age of information in a csma environment":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")

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)