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 scheduling of multiple sensors over lossy and bandwidth limited channels"):
  Abstract: This work considers the sensor scheduling problem for multiple dynamic processes. We consider $n$ linear dynamic processes, the state of each process is measured by a sensor, which transmits the measurements over a wireless channel to a remote estimator. The channel is bandlimited. In each time step, only one sensor is allowed to transmit data to the remote estimator and the packet might be lost due to unreliability of the wireless channel. Our goal is to find a scheduling policy which coordinates the sensors in a centralized manner to minimize the expected estimation error of the remote estimator. We formulate the problem as a Markov decision process. We develop an algorithm to check whether there exists a deterministic and stationary optimal policy. When only one channel is available at each time step, we show that the optimal policy has a switching structure, which saves computational effort of finding the optimal policy and facilitates practical implementation. For the general case, we provide an index-based heuristics to avoid brute force computation. Numerical examples are presented to illustrate our theoretical results.

Includes members:
  Member "opportunistic scheduling as restless bandits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive power and rate control for real time status updating over fading channels")
  Member "attack allocation on remote state estimation in multi systems structural results and asymptotic solution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "max min fair sensor scheduling game theoretic perspective and algorithmic solution")
  Member "infinite horizon optimal transmission power control for remote state estimation over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal causal rate constrained sampling of the wiener process")
  Member "optimal dynamic multicast scheduling for cache enabled content centric wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes")
  Member "sensor scheduling in variance based event triggered estimation with packet drops":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stabilizing scheduling policies for networked control systems")
  Member "stochastic event triggered sensor scheduling for remote state estimation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "event triggered diffusion kalman filters")
  Member "optimal strategies for communication and remote estimation with an energy harvesting sensor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal causal rate constrained sampling for a class of continuous markov processes")

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