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 "peak age of information in priority queueing systems"):
  Abstract: We consider a priority queueing system where a single processor serves k classes of packets that are generated randomly following Poisson processes. Our objective is to compute the expected Peak Age of Information (PAoI) under various scenarios. In particular, we consider two situations where the buffer size at each queue is one and infinite, and in the infinite buffer size case we consider First Come First Serve (FCFS) and Last Come First Serve (LCFS) as service disciplines. For the system with buffer size one at each queue, we derive PAoI exactly for the exponential service time case and bounds (which are excellent approximations) for the case of general service time and small k. For the system with infinite buffer size, we provide the exact PAoI for both FCFS and LCFS where service time is general and k could be large. Using those results we investigated the effect of ordering of priorities and service disciplines for the various scenarios. We perform extensive numerical studies to validate our results and develop insights.

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 "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-2 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information with prioritized streams when to buffer preempted packets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "age of information with gilbert elliot servers and samplers")
  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 "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "timely status update in massive iot systems decentralized scheduling for wireless uplinks":
    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 "age of information in g g 1 1 systems":
    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)