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: "opportunistic scheduling as restless bandits"
  Abstract: In this paper we consider energy efficient scheduling in a multiuser setting where each user has a finite sized queue and there is a cost associated with holding packets (jobs) in each queue (modeling the delay constraints). The packets of each user need to be sent over a common channel. The channel qualities seen by the users are time-varying and differ across users; also, the cost incurred, i.e., energy consumed, in packet transmission is a function of the channel quality. We pose the problem as an average cost Markov Decision Problem, and prove that this problem is Whittle Indexable. Based on this result, we propose an algorithm in which the Whittle index of each user is computed and the user who has the lowest value is selected for transmission. We evaluate the performance of this algorithm via simulations and show that it achieves a lower average cost than the Maximum Weight Scheduling and Weighted Fair Scheduling strategies.

Connected through hyperedge HE-1 (induced by source paper "adaptive power and rate control for real time status updating over fading channels"):
  with members:
    - "on the optimality of the whittle s index policy for minimizing the age of information"
    - "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"
    - "real time reconstruction of counting process through queues"
    - "delay optimal and energy efficient communications with markovian arrivals"
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "the roadmap to 6g ai empowered wireless networks"
    - "scheduling to minimize age of information in multi state time varying networks with power constraints"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"

Connected through hyperedge HE-2 (induced by source paper "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"):
  with members:
    - "an aoi optimal scheduling method for wireless transmissions with truncated channel inversion"
    - "minimizing the age of information noma or oma"
    - "scheduling to minimize age of synchronization in wireless broadcast networks with random updates"
    - "scheduling to minimize age of information in multi state time varying networks with power constraints"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-3 (induced by source paper "minimizing age of information with power constraints opportunistic scheduling in multi state time varying networks"):
  with members:
    - "scheduling to minimize age of information in multi state time varying networks with power constraints"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "sending information through status updates"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"
    - "timely throughput optimal scheduling with prediction"

Connected through hyperedge HE-4 (induced by source paper "scheduling to minimize age of information in multi state time varying networks with power constraints"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "joint queue aware and channel aware delay optimal scheduling of arbitrarily bursty traffic over multi state time varying channels"
    - "sending information through status updates"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"
    - "timely throughput optimal scheduling with prediction"
    - "average age of information with hybrid arq under a resource constraint"

Connected through hyperedge HE-5 (induced by source paper "optimal scheduling of multiple sensors over lossy and bandwidth limited channels"):
  with members:
    - "attack allocation on remote state estimation in multi systems structural results and asymptotic solution"
    - "infinite horizon optimal transmission power control for remote state estimation over fading channels"
    - "optimal dynamic multicast scheduling for cache enabled content centric wireless networks"
    - "sensor scheduling in variance based event triggered estimation with packet drops"
    - "stochastic event triggered sensor scheduling for remote state estimation"
    - "optimal strategies for communication and remote estimation with an energy harvesting sensor"

Connected through hyperedge HE-6 (induced by source paper "sequential decision making with limited observation capability application to wireless networks"):
  with members:
    - "a hidden markov restless multi armed bandit model for playout recommendation systems"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "downlink scheduling over markovian fading channels"
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"

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.SY(Systems and Control)