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 "efficient quantile computation in markov chains via counting problems for parikh images"):
  Abstract: A cost Markov chain is a Markov chain whose transitions are labelled with non-negative integer costs. A fundamental problem on this model, with applications in the verification of stochastic systems, is to compute information about the distribution of the total cost accumulated in a run. This includes the probability of large total costs, the median cost, and other quantiles. While expectations can be computed in polynomial time, previous work has demonstrated that the computation of cost quantiles is harder but can be done in PSPACE. In this paper we show that cost quantiles in cost Markov chains can be computed in the counting hierarchy, thus providing evidence that computing those quantiles is likely not PSPACE-hard. We obtain this result by exhibiting a tight link to a problem in formal language theory: counting the number of words that are both accepted by a given automaton and have a given Parikh image. Motivated by this link, we comprehensively investigate the complexity of the latter problem. Among other techniques, we rely on the so-called BEST theorem for efficiently computing the number of Eulerian circuits in a directed graph.

Includes members:
  Member "complexity of problems of commutative grammars":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "re pairing brackets")
  Member "counting euler tours in undirected bounded treewidth graphs":
    also connected through other hyperedges:
      (none)
  Member "unifying two views on multiple mean payoff objectives in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi weighted markov decision processes with reachability objectives")
  Member "multidimensional beyond worst case and almost sure problems for mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi weighted markov decision processes with reachability objectives")
  Member "the complexity of the kth largest subset problem and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "expected window mean payoff")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes")
  Member "the odds of staying on budget":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "percentile queries in multi dimensional markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "life is random time is not markov decision processes with window objectives")

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)