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: "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.

Connected through hyperedge HE-1 (induced by source paper "scaling up probabilistic inference in linear and non linear hybrid domains by leveraging knowledge compilation"):
  with members:
    - "quantifying program bias"
    - "probabilistic inference modulo theories"
    - "inference and learning in probabilistic logic programs using weighted boolean formulas"
    - "approximate counting in smt and value estimation for probabilistic programs"
    - "algebraic model counting"
    - "sum product networks a new deep architecture"
    - "solving sat and bayesian inference with backtracking search"
    - "a knowledge compilation map"

Connected through hyperedge HE-2 (induced by source paper "making decisions with spatially and temporally uncertain data"):
  with members:
    - "finding approximate pomdp solutions through belief compression"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "reinforcement learning a survey"

Connected through hyperedge HE-3 (induced by source paper "a solution to time varying markov decision processes"):
  with members:
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-4 (induced by source paper "reasoning about probabilities in dynamic systems using goal regression"):
  with members:
    - "robot location estimation in the situation calculus"
    - "tractable inference for complex stochastic processes"
    - "formula based probabilistic inference"
    - "reasoning about noisy sensors and effectors in the situation calculus"

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