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 "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"):
  Abstract: This work is motivated by the need of collecting fresh data from power-constrained sensors in the industrial Internet of Things (IIoT) network. A recently proposed metric, the Age of Information (AoI) is adopted to measure data freshness from the perspective of the central controller in the IIoT network. We wonder what is the minimum average AoI the network can achieve and how to design scheduling algorithms to approach it. To answer these questions when the channel states of the network are Markov time-varying and scheduling decisions are restricted to bandwidth constraint, we first decouple the multi-sensor scheduling problem into a single-sensor constrained Markov decision process (CMDP) through relaxation of the hard bandwidth constraint. Next we exploit the threshold structure of the optimal policy for the decoupled single sensor CMDP and obtain the optimum solution through linear programming (LP). Finally, an asymptotically optimal truncated policy that can satisfy the hard bandwidth constraint is built upon the optimal solution to each of the decoupled single-sensor. Our investigation shows that to obtain a small AoI performance: (1) The scheduler exploits good channels to schedule sensors supported by limited power; (2) Sensors equipped with enough transmission power are updated in a timely manner such that the bandwidth constraint can be satisfied.

Includes members:
  Member "an aoi optimal scheduling method for wireless transmissions with truncated channel inversion":
    also connected through other hyperedges:
      (none)
  Member "minimizing the age of information noma or oma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "scheduling to minimize age of synchronization in wireless broadcast networks with random updates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely synchronization with sporadic status changes")
  Member "scheduling to minimize age of information in multi state time varying networks with power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "who should google scholar update more often")
  Member "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis")
  Member "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "age minimal online policies for energy harvesting sensors with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)