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: "multi weighted automata and mso logic"
  Abstract: Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the maximum, limit average, or discounted sum of transition weights. In multi-weighted automata, transitions carry several weights and can model, for example, the ratio between rewards and costs, or the efficiency of use of a primary resource under some upper bound constraint on a secondary resource. Here, we introduce a general model for multi-weighted automata as well as a multi-weighted MSO logic. In our main results, we show that this multi-weighted MSO logic and multi-weighted automata are expressively equivalent both for finite and infinite words. The translation process is effective, leading to decidability results for our multi-weighted MSO logic.

Connected through hyperedge HE-1 (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"
    - "expressiveness and closure properties for quantitative languages"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"

Connected through hyperedge HE-2 (induced by source paper "controller synthesis for mdps and frequency ltl setminus gu"):
  with members:
    - "on frequency ltl in probabilistic systems"
    - "percentile queries in multi dimensional markov decision processes"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "markov decision processes with multiple long run averageobjectives"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "trading performance for stability in markov decision processes"
    - "deterministic automata for the f g fragment of ltl"
    - "a probabilistic temporal logic with frequency operators and its model checking"

Connected through hyperedge HE-3 (induced by source paper "weight assignment logic"):
  with members:
    - "quantitative languages defined by functional automata"
    - "a nivat theorem for weighted timed automata and weighted relative distance logic"

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)