human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "what is decidable about partially observable markov decision processes with omega regular objectives"
  Abstract: We consider partially observable Markov decision processes (POMDPs) with {\omega}-regular conditions specified as parity objectives. The class of {\omega}-regular languages extends regular languages to infinite strings and provides a robust specification language to express all properties used in verification, and parity objectives are canonical forms to express {\omega}-regular conditions. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satis- fied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite- memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives.

Connected through hyperedge HE-1 (induced by source paper "point based methods for model checking in partially observable markov decision processes"):
  with members:
    - "verification of uncertain pomdps using barrier certificates"
    - "bounded policy synthesis for pomdps with safe reachability objectives"
    - "a storm is coming a modern probabilistic model checker"
    - "inverse reward design"
    - "qualitative analysis of pomdps with temporal logic specifications for robotics applications"
    - "a learning based approach to control synthesis of markov decision processes for linear temporal logic specifications"
    - "a theory of goal oriented mdps with dead ends"
    - "heuristic search value iteration for pomdps"

Connected through hyperedge HE-2 (induced by source paper "control with probabilistic signal temporal logic"):
  with members:
    - "optimal control of mdps with temporal logic constraints"

Connected through hyperedge HE-3 (induced by source paper "verification and control of partially observable probabilistic real time systems"):
  with members:
    - "partial observation stochastic games how to win when belief fails"

Connected through hyperedge HE-4 (induced by source paper "qualitative analysis of concurrent mean payoff games"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "the value 1 problem under finite memory strategies for concurrent mean payoff games"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "decidable problems for probabilistic automata on infinite words"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative reachability in stochastic bpa games"
    - "measuring and synthesizing systems in probabilistic environments"
    - "the complexity of solving reachability games using value and strategy iteration"

Connected through hyperedge HE-5 (induced by source paper "variations on the stochastic shortest path problem"):
  with members:
    - "quantitative languages defined by functional automata"
    - "multiple environment markov decision processes"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"
    - "to reach or not to reach efficient algorithms for total payoff games"
    - "looking at mean payoff and total payoff through windows"
    - "computing quantiles in markov reward models"

Connected through hyperedge HE-6 (induced by source paper "cegar for qualitative analysis of probabilistic systems"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "interface simulation distances"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "faster algorithms for alternating refinement relations"
    - "decidable problems for probabilistic automata on infinite words"
    - "an o n 2 time algorithm for alternating b uchi games"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative analysis of partially observable markov decision processes"

Connected through hyperedge HE-7 (induced by source paper "probabilistic opacity for markov decision processes"):
  with members:
    - "time bounded reachability for hybrid automata complexity and fixpoints"
    - "opacity issues in games with imperfect information"
    - "randomness for free"
    - "qualitative analysis of partially observable markov decision processes"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-8 (induced by source paper "qualitative analysis of pomdps with temporal logic specifications for robotics applications"):
  with members:
    - "abstractions and sensor design in partial information reactive controller synthesis"
    - "point based pomdp algorithms improved analysis and implementation"
    - "heuristic search value iteration for pomdps"
    - "control of noisy differential drive vehicles from time bounded temporal logic specifications"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Question: Please tell me which class the center node 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)