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 "parameter independent strategies for pmdps via pomdps"):
  Abstract: Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. #R##N#We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. #R##N#We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.

Includes members:
  Member "sea param exploring schedulers in parametric mdps":
    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 "automated experiment design for data efficient verification of parametric markov decision processes":
    also connected through other hyperedges:
      (none)
  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 "ares adaptive receding horizon synthesis of optimal plans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "declarative vs rule based control for flocking dynamics")
  Member "parameter synthesis for markov models faster than ever":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (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)