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 "solving factored mdps with hybrid state and action variables"):
  Abstract: Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automated decision support systems. In this paper, we describe a novel hybrid factored Markov decision process (MDP) model that allows for a compact representation of these problems, and a new hybrid approximate linear programming (HALP) framework that permits their efficient solutions. The central idea of HALP is to approximate the optimal value function by a linear combination of basis functions and optimize its weights by linear programming. We analyze both theoretical and computational aspects of this approach, and demonstrate its scale-up potential on several hybrid optimization problems.

Includes members:
  Member "from influence diagrams to junction trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a symbolic algebra for the computation of expected utilities in multiplicative influence diagrams")
  Member "approximating map using local search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "survey on models and techniques for root cause analysis")
  Member "metrics for finite markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "dynamic programming for structured continuous markov decision problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "fmap distributed cooperative multi agent planning")
  Member "approximate linear programming for first order mdps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practical linear value approximation techniques for first order mdps")
  Member "solving map exactly using systematic search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate mmap by marginal search")
  Member "metrics for markov decision processes with infinite state spaces":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning to control in metric space with optimal regret")

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)