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 in a decentralized network of parallel queues with routing and packets losses"):
  Abstract: The paper deals with Age of Information in a network of multiple sources and parallel servers/queues with buffering capabilities, preemption in service and losses in served packets. The servers do not communicate between each other and the packets are dispatched through the servers according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average Age of Information of a system of two parallel servers (with and without buffer capabilities) and compare the result with that of a single queue. We show known results of packets delay in Queuing Theory do not hold for Age of Information. Unfortunately, the complexity of computing the Age of Information using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average Age of Information in a parallel server system of an arbitrary number of M/M/1/(N + 1) queues and its tightness in various regimes. This upper bound allows providing a tight approximation of the Age of Information with a very low complexity.

Includes members:
  Member "minimizing the age of information noma or oma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "the age of incorrect information a new performance metric for status updates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  Member "minimizing the age of information in a csma environment":
    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 "age optimal updates of multiple information flows":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  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 determinacy minimize age of information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely status updating through intermittent sensing and transmission")
  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 "age optimal sampling and transmission scheduling in multi source systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely status updating through intermittent sensing and transmission")

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.PF(Performance)