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 "human in the loop synthesis for partially observable markov decision processes"):
  Abstract: We study planning problems where autonomous agents operate inside environments that are subject to uncertainties and not fully observable. Partially observable Markov decision processes (POMDPs) are a natural formal model to capture such problems. Because of the potentially huge or even infinite belief space in POMDPs, synthesis with safety guarantees is, in general, computationally intractable. We propose an approach that aims to circumvent this difficulty: in scenarios that can be partially or fully simulated in a virtual environment, we actively integrate a human user to control an agent. While the user repeatedly tries to safely guide the agent in the simulation, we collect data from the human input. Via behavior cloning, we translate the data into a strategy for the POMDP. The strategy resolves all nondeterminism and non-observability of the POMDP, resulting in a discrete-time Markov chain (MC). The efficient verification of this MC gives quantitative insights into the quality of the inferred human strategy by proving or disproving given system specifications. For the case that the quality of the strategy is not sufficient, we propose a refinement method using counterexamples presented to the human. Experiments show that by including humans into the POMDP verification loop we improve the state of the art by orders of magnitude in terms of scalability.

Includes members:
  Member "permissive finite state controllers of pomdps using parameter synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "privacy verification in pomdps via barrier certificates")
  Member "a storm is coming a modern probabilistic model checker":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the probabilistic model checker storm")
  Member "motion planning under partial observability using game based abstraction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strategy synthesis in pomdps via game based abstractions")
  Member "synthesis of shared control protocols with provable safety and performance guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "synthesis of provably correct autonomy protocols for shared control")
  Member "high level counterexamples for probabilistic automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the probabilistic model checker storm")
  Member "optimal cost almost sure reachability in pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "counterexample driven synthesis for probabilistic program sketches")
  Member "qualitative analysis of pomdps with temporal logic specifications for robotics applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "solving pomdps by searching the space of finite policies":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reinforcement learning for pomdp partitioned rollout and policy iteration with application to autonomous sequential repair problems")

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)