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 "quantitative automata under probabilistic semantics"):
  Abstract: Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider.

Includes members:
  Member "nested weighted limit average automata of bounded width":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "long run average behavior of vector addition systems with states")
  Member "multigain a controller synthesis tool for mdps with multiple mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximating values of generalized reachability stochastic games")
  Member "unifying two views on multiple mean payoff objectives in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi weighted markov decision processes with reachability objectives")
  Member "nested weighted automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "streamable regular transductions")
  Member "markov decision processes with multiple long run averageobjectives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "discounting in ltl":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours")
  Member "energy and mean payoff parity markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes")
  Member "measuring and synthesizing systems in probabilistic environments":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strategy representation by decision trees with linear classifiers")

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)