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 local and remote controllers with unreliable uplink channels"):
  Abstract: We consider a networked control system consisting of a remote controller and a collection of linear plants, each associated with a local controller. Each local controller directly observes the state of its co-located plant and can inform the remote controller of the plant's state through an unreliable uplink channel. We assume that the downlink channels from the remote controller to local controllers are perfect. The objective of the local controllers and the remote controller is to cooperatively minimize a quadratic performance cost. We provide a dynamic program for this decentralized control problem using the common information approach. Although our problem is not a partially nested problem, we obtain explicit optimal strategies for all controllers. In the optimal strategies, all controllers compute common estimates of the states of the plants based on the common information obtained from the communication network. The remote controller's action is linear in the common state estimates, and the action of each local controller is linear in both the actual state of its co-located plant and the common state estimates. We illustrate our results with numerical experiments using randomly generated models.

Includes members:
  Member "dynamic teams and decentralized control problems with substitutable actions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal infinite horizon decentralized networked controllers with unreliable communication")
  Member "optimal local and remote controllers with unreliable communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal infinite horizon decentralized networked controllers with unreliable communication")
  Member "decentralized control problems with substitutable actions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal infinite horizon decentralized networked controllers with unreliable communication")
  Member "optimal control of two player systems with output feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "team optimal decentralized state estimation of linear stochastic processes by agents with non classical information structures")
  Member "structural results and explicit solution for two player lqg systems on a finite time horizon":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "team optimal decentralized state estimation")
  Member "decentralized stochastic control with partial history sharing a common information approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "regret bounds for decentralized learning in cooperative multi agent dynamical systems")
  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")
  Member "optimal decentralized control of coupled subsystems with control sharing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sequential decomposition of dynamic games with asymmetric information and dependent states")

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)