human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "average peak age of information minimization in uav assisted iot networks"
    - "saddlepoint approximations for rayleigh block fading channels"
    - "optimal status updating with a finite battery energy harvesting source"
    - "statistical guarantee optimization for aoi in single hop and two hop systems with periodic arrivals"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "dynamic task offloading and resource allocation for ultra reliable low latency edge computing"
    - "ultra reliable low latency vehicular networks taming the age of information tail"

Connected through hyperedge HE-2 (induced by source paper "optimal sampling cost in wireless networks with age of information constraints"):
  with members:
    - "power minimization in wireless sensor networks with constrained aoi using stochastic optimization"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "age of information performance of multiaccess strategies with packet management"
    - "age and value of information non linear age case"

Connected through hyperedge HE-3 (induced by source paper "power minimization in wireless sensor networks with constrained aoi using stochastic optimization"):
  with members:
    - "on the age of information in multi source queueing models"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "the age of information real time status updating by multiple sources"

Question: Please tell me which class the center node 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)