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: "mgpt a probabilistic planner based on heuristic search"
  Abstract: We describe the version of the GPT planner used in the probabilistic track of the 4th International Planning Competition (IPC-4). This version, called mGPT, solves Markov Decision Processes specified in the PPDDL language by extracting and using different classes of lower bounds along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations where the alternative probabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state and the greedy policy.

Connected through hyperedge HE-1 (induced by source paper "practical linear value approximation techniques for first order mdps"):
  with members:
    - "a heuristic search algorithm for solving first order mdps"
    - "exploiting first order regression in inductive policy selection"
    - "approximate linear programming for first order mdps"
    - "efficient solution algorithms for factored mdps"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-2 (induced by source paper "decision theoretic planning with non markovian rewards"):
  with members:
    - "a heuristic search algorithm for solving first order mdps"
    - "spudd stochastic planning using decision diagrams"
    - "implementation and comparison of solution methods for decision processes with non markovian rewards"
    - "symbolic generalization for on line planning"
    - "engineering a conformant probabilistic planner"
    - "the ff planning system fast plan generation through heuristic search"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-3 (induced by source paper "engineering a conformant probabilistic planner"):
  with members:
    - "decision theoretic planning with non markovian rewards"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"
    - "vhpop versatile heuristic partial order planner"
    - "the ff planning system fast plan generation through heuristic search"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "flaw selection strategies for partial order planning"

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)