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 "controller synthesis for mdps and frequency ltl setminus gu"):
  Abstract: Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an extension is particularly useful for probabilistic systems that often cannot fulfil strict qualitative guarantees on the behaviour. It has been recently shown that controller synthesis for Markov decision processes and fLTL is decidable when all the bounds on frequencies are 1. As a step towards a complete quantitative solution, we show that the problem is decidable for the fragment fLTL$\setminus$GU, where U does not occur in the scope of G (but still F can). Our solution is based on a novel translation of such quantitative formulae into equivalent deterministic automata.

Includes members:
  Member "on frequency ltl in probabilistic systems":
    also connected through other hyperedges:
      (none)
  Member "percentile queries in multi dimensional markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "from ltl to deterministic automata a safraless compositional approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "markov decision processes with multiple long run averageobjectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "near linear time algorithms for streett objectives in graphs and mdps")
  Member "trading performance for stability in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "multi weighted automata and mso logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "aperiodic weighted automata and weighted first order logic")
  Member "deterministic automata for the f g fragment of ltl":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "one theorem to rule them all a unified translation of ltl into ω automata")

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.LO(Logic in Computer Science)