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 "distributed and optimal resilient planning of large scale interdependent critical infrastructures"):
  Abstract: The complex interconnections between heterogeneous critical infrastructure sectors make the system of systems (SoS) vulnerable to natural or human-made disasters and lead to cascading failures both within and across sectors. Hence, the robustness and resilience of the interdependent critical infrastructures (ICIs) against extreme events are essential for delivering reliable and efficient services to our society. To this end, we first establish a holistic probabilistic network model to model the interdependencies between infrastructure components. To capture the underlying failure and recovery dynamics of ICIs, we further propose a Markov decision processes (MDP) model in which the repair policy determines a long-term performance of the ICIs. To address the challenges that arise from the curse of dimensionality of the MDP, we reformulate the problem as an approximate linear program and then simplify it using factored graphs. We further obtain the distributed optimal control for ICIs under mild assumptions. Finally, we use a case study of the interdependent power and subway systems to corroborate the results and show that the optimal resilience resource planning and allocation can reduce the failure probability and mitigate the impact of failures caused by natural or artificial disasters.

Includes members:
  Member "a dynamic game analysis and design of infrastructure network protection and recovery 125":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal secure two layer iot network design")
  Member "efficient solution algorithms for factored mdps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "policy synthesis for factored mdps with graph temporal logic specifications")

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)