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 "permissive finite state controllers of pomdps using parameter synthesis"):
  Abstract: We study finite-state controllers (FSCs) for partially observable Markov decision processes (POMDPs). #R##N#The key insight is that computing (randomized) FSCs on POMDPs is equivalent to synthesis for parametric Markov chains (pMCs). #R##N#This correspondence enables using parameter synthesis techniques to compute FSCs for POMDPs in a black-box fashion. #R##N#We investigate how typical restrictions on parameter values affect the quality of the obtained FSCs. #R##N#Permissive strategies for POMDPs are obtained as regions of parameter values, a natural output of parameter synthesis techniques. #R##N#Experimental evaluation on several POMDP benchmarks shows promising results.

Includes members:
  Member "parametric markov chains pctl complexity and fraction free gaussian elimination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameter synthesis for markov models")
  Member "sequential convex programming for the efficient verification of parametric mdps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameter synthesis for markov models")
  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 "parameter synthesis for markov models faster than ever":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the probabilistic model checker storm")
  Member "safety constrained reinforcement learning for mdps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extended markov games to learn multiple tasks in multi agent reinforcement learning")
  Member "permissive controller synthesis for probabilistic systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "verifiable rnn based policies for pomdps under temporal logic constraints")
  Member "optimal cost almost sure reachability in pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "counterexample driven synthesis for probabilistic program sketches")

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.LO(Logic in Computer Science)