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 "point based methods for model checking in partially observable markov decision processes"):
  Abstract: Autonomous systems are often required to operate in partially observable environments. They must reliably execute a specified objective even with incomplete information about the state of the environment. We propose a methodology to synthesize policies that satisfy a linear temporal logic formula in a partially observable Markov decision process (POMDP). By formulating a planning problem, we show how to use point-based value iteration methods to efficiently approximate the maximum probability of satisfying a desired logical formula and compute the associated belief state policy. We demonstrate that our method scales to large POMDP domains and provides strong bounds on the performance of the resulting policy.

Includes members:
  Member "verification of uncertain pomdps using barrier certificates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "control theory meets pomdps a hybrid systems approach")
  Member "bounded policy synthesis for pomdps with safe reachability objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic finite state control of pomdps with ltl specifications")
  Member "a storm is coming a modern probabilistic model checker":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the probabilistic model checker storm")
  Member "inverse reward design":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "qualitative analysis of pomdps with temporal logic specifications for robotics applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "strategy synthesis in pomdps via game based abstractions")
  Member "a learning based approach to control synthesis of markov decision processes for linear temporal logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "what is decidable about partially observable markov decision processes with omega regular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "control with probabilistic signal temporal logic")
  Member "a theory of goal oriented mdps with dead ends":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "size independent neural transfer for rddl planning")

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)