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 "supervisor synthesis of pomdp based on automata learning"):
  Abstract: As a general and thus popular model for autonomous systems, partially observable Markov decision process (POMDP) can capture uncertainties from different sources like sensing noises, actuation errors, and uncertain environments. However, its comprehensiveness makes the planning and control in POMDP difficult. Traditional POMDP planning problems target to find the optimal policy to maximize the expectation of accumulated rewards. But for safety critical applications, guarantees of system performance described by formal specifications are desired, which motivates us to consider formal methods to synthesize supervisor for POMDP. With system specifications given by Probabilistic Computation Tree Logic (PCTL), we propose a supervisory control framework with a type of deterministic finite automata (DFA), za-DFA, as the controller form. While the existing work mainly relies on optimization techniques to learn fixed-size finite state controllers (FSCs), we develop an $L^*$ learning based algorithm to determine both space and transitions of za-DFA. Membership queries and different oracles for conjectures are defined. The learning algorithm is sound and complete. An example is given in detailed steps to illustrate the supervisor synthesis algorithm.

Includes members:
  Member "counterexample guided abstraction refinement for pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "strategy synthesis in pomdps via game based abstractions")
  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 "permissive controller synthesis for probabilistic systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the probabilistic model checker storm")
  Member "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "verifiable rnn based policies for pomdps under temporal logic constraints")
  Member "replanning in domains with partial information and sensing actions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hybrid conditional planning using answer set programming")
  Member "randomness for free":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameter independent strategies for pmdps via pomdps")
  Member "speeding up the convergence of value iteration in partially observable markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial intelligence for low resource communities influence maximization in an uncertain world")

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.SY(Systems and Control)