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: "qualitative concurrent stochastic games with imperfect information"
  Abstract: We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor state is chosen accordingly to some fixed probability distribution depending on the previous state and on the pair of actions chosen by the players. Imperfect information is modeled as follows: both players have an equivalence relation over states and, instead of observing the exact state, they only know to which equivalence class it belongs. Therefore, if two partial plays are indistinguishable by some player, he should behave the same in both of them. We consider reachability (does the play eventually visit a final state?) and B\"uchi objective (does the play visit infinitely often a final state?). Our main contribution is to prove that the following problem is complete for 2-ExpTime: decide whether the first player has a strategy that ensures her to almost-surely win against any possible strategy of her oponent. We also characterise those strategies needed by the first player to almost-surely win.

Connected through hyperedge HE-1 (induced by source paper "alternating tree automata with qualitative semantics"):
  with members:
    - "monadic second order logic with path measure quantifier is undecidable"
    - "alternating nonzero automata"
    - "emptiness of zero automata is decidable"
    - "monadic second order logic with measure and category quantifiers"
    - "pure strategies in imperfect information stochastic games"
    - "partial observation stochastic games how to win when belief fails"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-2 (induced by source paper "pure strategies in imperfect information stochastic games"):
  with members:
    - "partial observation stochastic games how to win when belief fails"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-3 (induced by source paper "partial observation stochastic games how to win when belief fails"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "decidable problems for probabilistic automata on infinite words"):
  with members:
    - "power of randomization in automata on infinite strings"
    - "partial observation stochastic games how to win when belief fails"

Connected through hyperedge HE-5 (induced by source paper "randomness for free"):
  with members:
    - "pomdps under probabilistic semantics"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "partial observation stochastic games how to win when belief fails"
    - "algorithms for omega regular games with imperfect information"
    - "interactive small step algorithms ii abstract state machines and the characterization theorem"

Connected through hyperedge HE-6 (induced by source paper "qualitative analysis of partially observable markov decision processes"):
  with members:
    - "power of randomization in automata on infinite strings"
    - "randomness for free"
    - "algorithms for omega regular 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.FL(Formal Languages and Automata Theory)