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 "adaptive power and rate control for real time status updating over fading channels"):
  Abstract: Age of Information (AoI) has attracted much attention recently due to its capability of characterizing the freshness of information. To improve information freshness over fading channels, efficient scheduling methods are highly desired for wireless transmissions. However, due to the channel instability and arrival randomness, optimizing AoI is very challenging. In this paper, we are interested in the AoI-optimal transmissions with rate-adaptive transmission schemes in a buffer-aware system. More specifically, we utilize a probabilistic scheduling method to minimize the AoI while satisfying an average power constraint. By characterizing the probabilistic scheduling policy with a Constrained Markov Decision Process (CMDP), we formulate a Linear Programming (LP) problem. Further, a low complexity algorithm is presented to obtain the optimal scheduling policy, which is proved to belong to a set of semi-threshold-based policies. Numerical results verify the reduction in computational complexity and the optimality of semi-threshold-based policy, which indicates that we can achieve well real-time service with a low calculating complexity.

Includes members:
  Member "on the optimality of the whittle s index policy for minimizing the age of information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "peak age of information in priority queueing systems")
  Member "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels":
    also connected through other hyperedges:
      (none)
  Member "real time reconstruction of counting process through queues":
    also connected through other hyperedges:
      (none)
  Member "delay optimal and energy efficient communications with markovian arrivals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age delay tradeoffs in queueing systems")
  Member "minimizing age of information for real time monitoring in resource constrained industrial iot networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "age of information dependent random access for massive iot networks")
  Member "the roadmap to 6g ai empowered wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "when wireless security meets machine learning motivation challenges and research directions")
  Member "scheduling to minimize age of information in multi state time varying networks with power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the age of information in internet of things systems with correlated devices")
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)