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: "expressiveness and closure properties for quantitative languages"
  Abstract: Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages.

Connected through hyperedge HE-1 (induced by source paper "weighted pcl over product valuation monoids"):
  with members:
    - "on weighted configuration logics"
    - "quantitative automata under probabilistic semantics"

Connected through hyperedge HE-2 (induced by source paper "aperiodic weighted automata and weighted first order logic"):
  with members:
    - "pumping lemmas for weighted automata"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "weighted automata and logics for infinite nested words"
    - "multi weighted automata and mso logic"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"

Connected through hyperedge HE-3 (induced by source paper "comparator automata in quantitative verification"):
  with members:
    - "exact and approximate determinization of discounted sum automata"
    - "energy parity games"

Connected through hyperedge HE-4 (induced by source paper "bidirectional nested weighted automata"):
  with members:
    - "nested weighted limit average automata of bounded width"
    - "quantitative automata under probabilistic semantics"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "nested weighted automata"

Connected through hyperedge HE-5 (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"
    - "discounting in ltl"
    - "energy and mean payoff parity markov decision processes"
    - "measuring and synthesizing systems in probabilistic environments"

Connected through hyperedge HE-6 (induced by source paper "faster algorithms for quantitative verification in constant treewidth graphs"):
  with members:
    - "nested weighted automata"
    - "faster algorithms for markov decision processes with low treewidth"
    - "mean payoff pushdown games"
    - "the complexity of mean payoff automaton expression"
    - "measuring and synthesizing systems in probabilistic environments"
    - "mean payoff automaton expressions"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "nested weighted automata"):
  with members:
    - "quantitative languages defined by functional automata"
    - "mean payoff pushdown games"
    - "weighted logics for nested words and algebraic formal power series"
    - "mean payoff automaton expressions"
    - "probabilistic weighted automata"

Connected through hyperedge HE-8 (induced by source paper "weighted automata and logics for infinite nested words"):
  with members:
    - "weighted logics for nested words and algebraic formal power series"
    - "first order and temporal logics for nested words"

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)