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: "discounting in ltl"
  Abstract: In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or not, a given specification, reasoning about quality addresses the question of \emph{how well} the system satisfies the specification. One direction in this effort is to refine the "eventually" operators of temporal logic to {\em discounting operators}: the satisfaction value of a specification is a value in $[0,1]$, where the longer it takes to fulfill eventuality requirements, the smaller the satisfaction value is. #R##N#In this paper we introduce an augmentation by discounting of Linear Temporal Logic (LTL), and study it, as well as its combination with propositional quality operators. We show that one can augment LTL with an arbitrary set of discounting functions, while preserving the decidability of the model-checking problem. Further augmenting the logic with unary propositional quality operators preserves decidability, whereas adding an average-operator makes some problems undecidable. We also discuss the complexity of the problem, as well as various extensions.

Connected through hyperedge HE-1 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours"):
  with members:
    - "strategy logic with imperfect information"
    - "admissibility in quantitative graph games"
    - "high quality synthesis against stochastic environments"
    - "assume admissible synthesis"
    - "quantified ctl expressiveness and complexity"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "on equilibria in quantitative games with reachability safety objectives"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-2 (induced by source paper "a counting semantics for monitoring ltl specifications over finite traces"):
  with members:
    - "faster statistical model checking for unbounded temporal properties"

Connected through hyperedge HE-3 (induced by source paper "environment independent task specifications via gltl"):
  with members:
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-4 (induced by source paper "quantitative automata under probabilistic semantics"):
  with members:
    - "nested weighted limit average automata of bounded width"
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "nested weighted automata"
    - "markov decision processes with multiple long run averageobjectives"
    - "energy and mean payoff parity markov decision processes"
    - "measuring and synthesizing systems in probabilistic environments"
    - "expressiveness and closure properties for quantitative languages"

Connected through hyperedge HE-5 (induced by source paper "quantitative model checking of linear time properties based on generalized possibility measures"):
  with members:
    - "computation tree logic model checking based on possibility measures"
    - "quantitative computation tree logic model checking based on generalized possibility measures"
    - "model checking of linear time properties based on possibility measure"

Connected through hyperedge HE-6 (induced by source paper "weighted linear dynamic logic"):
  with members:
    - "parametric linear dynamic logic"
    - "proceedings of second international symposium on games automata logics and formal verification gandalf 2011 electronic proceedings in theoretical computer science"

Connected through hyperedge HE-7 (induced by source paper "a cegar like approach for cost ltl bounds"):
  with members:
    - "linear temporal logic for regular cost functions"

Connected through hyperedge HE-8 (induced by source paper "near optimal scheduling for ltl with future discounting"):
  with members:
    - "expressiveness and closure properties for quantitative languages"
    - "better quality in synthesis through quantitative objectives"

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