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 "age of information for discrete time queues"):
  Abstract: Age of information (AoI) is a time-evolving measure of information freshness, that tracks the time since the last received fresh update was generated. Analyzing peak and average AoI, two time average metrics of AoI, for various continuous time queueing systems has received considerable attention. We analyze peak and average age for various discrete time queueing systems. We first consider first come first serve (FCFS) Ber/G/1 and Ber/G/1 queue with vacations, and derive explicit expressions for peak and average age. We also obtain age expressions for the last come first serve (LCFS) queue and the $G/G/\infty$ queue. We build upon proof techniques from earlier results, and also present new techniques that might be of independent interest in analyzing age in discrete time queuing systems.

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 optimal information gathering and dissemination on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of age of information in stationary and non stationary environments")
  Member "age delay tradeoffs in single server systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "anti aging scheduling in single server queues a systematic and comparative study")
  Member "age of information in g g 1 1 systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "can determinacy minimize age of information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely status updating through intermittent sensing and transmission")
  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 "the age of updates in a simple relay network":
    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 the information through queues":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "waiting before serving a companion to packet management in status update systems")

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)