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 g g 1 1 systems age expressions bounds special cases and optimization"):
  Abstract: We consider the age of information in G/G/1/1 systems under two service discipline models. In the first model, if a new update arrives when the service is busy, it is blocked; in the second model, a new update preempts the current update in service. For the blocking model, we first derive an exact age expression, then we propose two simple to calculate upper bounds for the average age. The first upper bound assumes the interarrival times to have log-concave distribution. The second upper bound assumes both the interarrivals and service times to have log-concave distribution. Both upper bounds are tight in the case of M/M/1/1 systems. We show that deterministic interarrivals and service times are optimum for the blocking service model. In addition, using the age expression for G/G/1/1 systems, we calculate average age expressions for special cases, i.e., M/G/1/1 and G/M/1/1 systems. Next, for the preemption in service model, we first derive an exact average age expression for G/G/1/1 systems. Then, we propose a simple to calculate upper bound for the average age. In addition, similar to blocking discipline, using the age expression for G/G/1/1 systems, we calculate average age expressions for special cases, i.e., M/G/1/1 and G/M/1/1 systems. Average age for G/M/1/1 can be written as a summation of two terms, the first of which depends only on the first and second moments of interarrival times and the second of which depends only on the service rate. In other words, interarrival and service times are decoupled. We show that deterministic interarrivals are optimum for G/M/1/1 systems. On the other hand, we observe for non-exponential service times that the optimal distribution of interarrival times depends on the relative values of the mean interarrival time and the mean service time.

Includes members:
  Member "age minimal online policies for energy harvesting sensors with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "sending information through status updates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "optimal status update for age of information minimization with an energy harvesting source":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who should google scholar update more often")
  Member "status updates through multicast networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "status updates through m g 1 1 queues with harq":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "age minimization in energy harvesting communications energy controlled delays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "age minimal transmission in energy harvesting two hop networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "who should google scholar update more often")
  Member "update or wait how to keep your data fresh":
    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)