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 relational mdps with exogenous events and additive rewards"):
  Abstract: We formalize a simple but natural subclass of service domains for relational planning problems with object-centered, independent exogenous events and additive rewards capturing, for example, problems in inventory control. Focusing on this subclass, we present a new symbolic planning algorithm which is the first algorithm that has explicit performance guarantees for relational MDPs with exogenous events. In particular, under some technical conditions, our planning algorithm provides a monotonic lower bound on the optimal value function. To support this algorithm we present novel evaluation and reduction techniques for generalized first order decision diagrams, a knowledge representation for real-valued functions over relational world states. Our planning algorithm uses a set of focus states, which serves as a training set, to simplify and approximate the symbolic solution, and can thus be seen to perform learning for planning. A preliminary experimental evaluation demonstrates the validity of our approach.

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 "probabilistic relational planning with first order decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of reasoning with fodd and gfodd")
  Member "first order decision diagrams for relational mdps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "qualitative numeric planning reductions and complexity")
  Member "flucap a heuristic search planner for first order mdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of reasoning with fodd and gfodd")
  Member "efficient solution algorithms for factored mdps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "policy synthesis for factored mdps with graph temporal logic specifications")
  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")

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)