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 "zero reachability in probabilistic multi counter automata"):
  Abstract: We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zero-reachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 in time which is polynomial in log(epsilon), exponential in the size of a given pMC, and doubly exponential in the number of counters. In the second case, we are interested in the probability of all runs that visit zero in some counter different from the last counter. Here we show that the qualitative zero-reachability is decidable and SquareRootSum-hard, and the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 (these result applies to pMC satisfying a suitable technical condition that can be verified in polynomial time). The proof techniques invented in the second case allow to construct counterexamples for some classical results about ergodicity in stochastic Petri nets.

Includes members:
  Member "stochastic parity games on lossy channel systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on strong determinacy of countable stochastic games")
  Member "model checking vector addition systems with one zero test":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an approach to computing downward closures")
  Member "polynomial time algorithms for multi type branching processes and stochastic context free grammars":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes")
  Member "approximating the termination value of one counter mdps and stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "efficient analysis of probabilistic programs with an unbounded counter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "long run average behaviour of probabilistic vector addition systems")
  Member "reachability games on extended vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy mean payoff games")
  Member "one counter stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computing expected runtimes for constant probability programs")
  Member "one counter markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes")

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.FL(Formal Languages and Automata Theory)