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 "decentralized control of stochastically switched linear system with unreliable communication"):
  Abstract: We consider a networked control system (NCS) consisting of two plants, a global plant and a local plant, and two controllers, a global controller and a local controller. The global (resp. local) plant follows discrete-time stochastically switched linear dynamics with a continuous global (resp. local) state and a discrete global (resp. local) mode. We assume that the state and mode of the global plant are observed by both controllers while the state and mode of the local plant are only observed by the local controller. The local controller can inform the global controller of the local plant's state and mode through an unreliable TCP-like communication channel where successful transmissions are acknowledged. The objective of the controllers is to cooperatively minimize a modes-dependent quadratic cost over a finite time horizon. Following the method developed in [1] and [2], we construct a dynamic program based on common information and a decomposition of strategies, and use it to obtain explicit optimal strategies for the controllers. In the optimal strategies, both controllers compute a common estimate of the local plant's state. The global controller's action is linear in the state of the global plant and the common estimated state, and the local controller's action is linear in the actual states of both plants and the common estimated state. Furthermore, the gain matrices for the global controller depend on the global mode and its observation about the local mode, while the gain matrices for the local controller depend on the actual modes of both plants and the global controller's observation about the local mode.

Includes members:
  Member "optimal local and remote controllers with unreliable uplink channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "regret bounds for decentralized learning in cooperative multi agent dynamical systems")
  Member "dynamic teams and decentralized control problems with substitutable actions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (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-5 (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-6 (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-7 (induced by source paper "regret bounds for decentralized learning in cooperative multi agent dynamical systems")

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)