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 "symbolic dynamic programming for discrete and continuous state mdps"):
  Abstract: Many real-world decision-theoretic planning problems can be naturally modeled with discrete and continuous state Markov decision processes (DC-MDPs). While previous work has addressed automated decision-theoretic planning for DCMDPs, optimal solutions have only been defined so far for limited settings, e.g., DC-MDPs having hyper-rectangular piecewise linear value functions. In this work, we extend symbolic dynamic programming (SDP) techniques to provide optimal solutions for a vastly expanded class of DCMDPs. To address the inherent combinatorial aspects of SDP, we introduce the XADD - a continuous variable extension of the algebraic decision diagram (ADD) - that maintains compact representations of the exact value function. Empirically, we demonstrate an implementation of SDP with XADDs on various DC-MDPs, showing the first optimal automated solutions to DCMDPs with linear and nonlinear piecewise partitioned value functions and showing the advantages of constraint-based pruning for XADDs.

Includes members:
  Member "spudd stochastic planning using decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum causal entropy specification inference from demonstrations")
  Member "dynamic programming for structured continuous markov decision problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning state abstractions for transfer in continuous control")
  Member "planning under continuous time and resource uncertainty a challenge for ai":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fmap distributed cooperative multi agent planning")
  Member "a heuristic search approach to planning with continuous resources in stochastic domains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded approximate symbolic dynamic programming for hybrid mdps")
  Member "solving factored mdps with hybrid state and action variables":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scalable nonlinear planning with deep neural network learned transition models")
  Member "decision theoretic planning structural assumptions and computational leverage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal by design model driven synthesis of adaptation strategies for autonomous systems")
  Member "exploiting causal independence in bayesian network inference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an advance on variable elimination with applications to tensor based computation")

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.AI(Artificial Intelligence)