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: "an approximate dynamic programming approach to food security of communities following hazards"
  Abstract: Food security can be threatened by extreme natural hazard events for households of all social classes within a community. To address food security issues following a natural disaster, the recovery of several elements of the built environment within a community, including its building portfolio, must be considered. Building portfolio restoration is one of the most challenging elements of recovery owing to the complexity and dimensionality of the problem. This study introduces a stochastic scheduling algorithm for the identification of optimal building portfolio recovery strategies. The proposed approach provides a computationally tractable formulation to manage multi-state, large-scale infrastructure systems. A testbed community modeled after Gilroy, California, is used to illustrate how the proposed approach can be implemented efficiently and accurately to find the near-optimal decisions related to building recovery following a severe earthquake.

Connected through hyperedge HE-1 (induced by source paper "optimal stochastic dynamic scheduling for managing community recovery from natural hazards"):
  with members:
    - "a modified approximate dynamic programming algorithm for community level food security following disasters"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"

Connected through hyperedge HE-2 (induced by source paper "decision automation for electric power network recovery"):
  with members:
    - "optimal stochastic dynamic scheduling for managing community recovery from natural hazards"
    - "a modified approximate dynamic programming algorithm for community level food security following disasters"
    - "accelerated gradient temporal difference learning"
    - "deep reinforcement learning in large discrete action spaces"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "rollout sampling approximate policy iteration"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"

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.CY(Computers and Society)