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: "the complexity of partial observation stochastic parity games with finite memory strategies"
  Abstract: We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability~1 (resp. positive probability). These qualtitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME. We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis.

Connected through hyperedge HE-1 (induced by source paper "secure control under partial observability with temporal logic constraints"):
  with members:
    - "control of probabilistic systems under dynamic partially known environments with temporal logic specifications"
    - "on the computational complexity of stochastic controller optimization in pomdps"

Connected through hyperedge HE-2 (induced by source paper "deciding maxmin reachability in half blind stochastic games"):
  with members:
    - "profinite techniques for probabilistic automata and the optimality of the markov monoid algorithm"
    - "deciding the value 1 problem for probabilistic leaktight automata"
    - "regular cost functions part i logic and algebra over words"
    - "decidable problems for probabilistic automata on infinite words"
    - "power of randomization in automata on infinite strings"
    - "partial observation stochastic games how to win when belief fails"

Connected through hyperedge HE-3 (induced by source paper "the complexity of synthesis from probabilistic components"):
  with members:
    - "synthesis from probabilistic components"
    - "a reduction from parity games to simple stochastic games"
    - "randomness for free"

Connected through hyperedge HE-4 (induced by source paper "qualitative analysis of concurrent mean payoff games"):
  with members:
    - "the value 1 problem under finite memory strategies for concurrent mean payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "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 "cegar for qualitative analysis of probabilistic systems"):
  with members:
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "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-6 (induced by source paper "games with a weak adversary"):
  with members:
    - "partial observation stochastic games how to win when belief fails"
    - "randomness for free"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-7 (induced by source paper "partial observation stochastic games how to win when belief fails"):
  with members:
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "forward analysis for wsts part ii complete wsts"
    - "decidable problems for probabilistic automata on infinite words"
    - "power of randomization in automata on infinite strings"
    - "reachability games on extended vector addition systems with states"
    - "randomness for free"
    - "qualitative analysis of partially observable markov decision processes"
    - "qualitative concurrent stochastic games with imperfect information"

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)