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 "optimal control of status updates in a multiple access channel with stability constraints"):
  Abstract: In this work, we study peak-age-optimal scheduling with stability constraints in a multiple access channel (MAC) with two heterogeneous source nodes transmitting to a common destination. The first node has randomly arriving data packets and it is connected to a power grid. Another energy harvesting (EH) sensor node monitors the environment and sends status updates to the destination. We consider a stationary scheduling policy with random transmission decisions based on some probability distributions, and a dynamic policy where the decisions are made based on the observed network states in each time slot. With the stationary policy, we derive the average peak age of information (AoI) of the EH node and the stability condition of the grid-connected node, and optimize the transmission probabilities by minimizing the average peak age with stability constraint. The dynamic policy is developed by using Lyapunov optimization theory with the help of virtual queues. Simulation results show that the dynamic scheduling policy achieves lower average peak AoI compared to the stationary one, especially when the destination node have low multi-packet reception (MPR) capability. However, this advantage comes at the cost of frequent exchange of information between the nodes due to centralized scheduling.

Includes members:
  Member "optimal status updating with a finite battery energy harvesting source":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "control of status updates for energy harvesting devices that monitor processes with alarms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely synchronization with sporadic status changes")
  Member "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who should google scholar update more often")
  Member "optimal status updating for an energy harvesting sensor with a noisy channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "age of information and throughput in a shared access network with heterogeneous traffic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "trading off computation with transmission in status update systems")
  Member "coded status updates in an energy harvesting erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information performance of multiaccess strategies with packet management":
    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 "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")

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)