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 "minimum age of information in the internet of things with non uniform status packet sizes"):
  Abstract: In this paper, a real-time Internet of Things (IoT) monitoring system is considered in which the IoT devices are scheduled to sample underlying physical processes and send the status updates to a common destination. In a real-world IoT, due to the possibly different dynamics of each physical process, the sizes of the status updates for different devices are often different and each status update typically requires multiple transmission slots. By taking into account such multi-time slot transmissions with non-uniform sizes of the status updates under noisy channels, the problem of joint device scheduling and status sampling is studied in order to minimize the average age of information (AoI) at the destination. This stochastic problem is formulated as an infinite horizon average cost Markov decision process (MDP). The monotonicity of the value function of the MDP is characterized and then used to show that the optimal scheduling and sampling policy is threshold-based with respect to the AoI at each device. To overcome the curse of dimensionality, a low-complexity suboptimal policy is proposed through a semi-randomized base policy and linear approximated value functions. The proposed suboptimal policy is shown to exhibit a similar structure to the optimal policy, which provides a structural base for its effective performance. A structure-aware algorithm is then developed to obtain the suboptimal policy. The analytical results are further extended to the IoT monitoring system with random status update arrivals, for which, the optimal scheduling and sampling policy is also shown to be threshold-based with the AoI at each device. Simulation results illustrate the structures of the optimal policy and show a near-optimal AoI performance resulting from the proposed suboptimal solution approach.

Includes members:
  Member "average peak age of information minimization in uav assisted iot networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "age optimal transmission of rateless codes in an erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive coding for information freshness in a two user broadcast erasure channel")
  Member "beyond 5g with uavs foundations of a 3d wireless cellular network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "a reinforcement learning approach to age of information in multi user networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "sampling for data freshness optimization non linear age functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")
  Member "controlling packet drops to improve freshness of information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "joint status sampling and updating for minimizing age of information in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "age of information with gilbert elliot servers and samplers")

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)