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 sampling cost in wireless networks with age of information constraints"):
  Abstract: We consider the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints (AoI). Errors in the transmission may occur and the scheduling algorithm has to decide if the users sample a new packet or attempt for retransmission of the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost in the system. We formulate a stochastic optimization problem with time average cost in the objective under time average AoI constraints. To solve this problem, we apply tools from Lyapunov optimization theory and develop a dynamic algorithm that takes decisions in a slot-by-slot basis. The algorithm decides if a user: a) samples a new packet, b) transmits the old one, c) remains silent. We provide optimality guarantees of the algorithm and study its performance in terms of time average cost and AoI through simulation results.

Includes members:
  Member "power minimization in wireless sensor networks with constrained aoi using stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "average age of information for a multi source m m 1 queueing model with packet management")
  Member "optimal control of status updates in a multiple access channel with stability constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "minimizing the age of information in wireless networks with stochastic arrivals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "age of information for multicast transmission with fixed and random deadlines in iot systems")
  Member "age of information performance of multiaccess strategies with packet management":
    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 "age and value of information non linear age case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.NI(Networking and Internet Architecture)