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 "anti aging scheduling in single server queues a systematic and comparative study"):
  Abstract: The Age-of-Information (AoI) is a new performance metric recently proposed for measuring the freshness of information in information-update systems. In this work, we conduct a systematic and comparative study to investigate the impact of scheduling policies on the AoI performance in single-server queues and provide useful guidelines for the design of AoI-efficient scheduling policies. Specifically, we first perform extensive simulations to demonstrate that the update-size information can be leveraged for achieving a substantially improved AoI compared to non-size-based (or arrival-time-based) policies. Then, by utilizing both the update-size and arrival-time information, we propose three AoI-based policies. Observing improved AoI performance of policies that allow service preemption and that prioritize informative updates, we further propose preemptive, informative, AoI-based scheduling policies. Our simulation results show that such policies empirically achieve the best AoI performance among all the considered policies. Interestingly, we also prove sample-path equivalence between some size-based policies and AoI-based policies. This provides an intuitive explanation for why some size-based policies, such as Shortest-Remaining-Processing-Time (SRPT), achieve a very good AoI performance.

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 delay tradeoffs in single server systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age delay tradeoffs in queueing systems")
  Member "status updates in a multi stream m g 1 1 preemptive queue":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who should google scholar update more often")
  Member "delay and peak age violation probability in short packet transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "optimal scheduling of multiple sensors with packet length constraint":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes")
  Member "optimizing data freshness throughput and delay in multi server information update systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "the age of information real time status updating by multiple sources":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "on the age of information in status update systems with packet management":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "age of information with gilbert elliot servers and samplers")

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)