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: "the mso u theory of n is undecidable"
  Abstract: We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the logic is undecidable on infinite words, i.e. the MSO+U theory of (N,<) is undecidable. This settles an open problem about the logic, and improves a previous undecidability result, which used infinite trees and additional axioms from set theory.

Connected through hyperedge HE-1 (induced by source paper "mso nabla is undecidable"):
  with members:
    - "monadic second order logic with path measure quantifier is undecidable"
    - "emptiness of zero automata is decidable"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"

Connected through hyperedge HE-2 (induced by source paper "monadic second order logic with measure and category quantifiers"):
  with members:
    - "how good is a strategy in a game with nature"
    - "emptiness of zero automata is decidable"
    - "on the problem of computing the probability of regular sets of trees"

Connected through hyperedge HE-3 (induced by source paper "beyond ωbs regular languages ωt regular expressions and counter check automata"):
  with members:
    - "separation property for wb and ws regular languages"
    - "weak mso with the unbounding quantifier"

Connected through hyperedge HE-4 (induced by source paper "unbounded lookahead in wmso u games"):
  with members:
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "synthesis of deterministic top down tree transducers from automatic tree relations"

Connected through hyperedge HE-5 (induced by source paper "recognisable languages over monads"):
  with members:
    - "transducers with origin information"

Connected through hyperedge HE-6 (induced by source paper "delay games with wmso u winning conditions"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "proceedings fifth international symposium on games automata logics and formal verification"
    - "synthesis of deterministic top down tree transducers from automatic tree relations"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "parity and streett games with costs"
    - "degrees of lookahead in regular infinite games"

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)