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: "a finite semantics of simply typed lambda terms for infinite runs of automata"
  Abstract: Model checking properties are often described by means of finite automata.#N#Any particular such automaton divides the set of infinite trees into finitely#N#many classes, according to which state has an infinite run. Building the full#N#type hierarchy upon this interpretation of the base type gives a finite#N#semantics for simply-typed lambda-trees.#N#  A calculus based on this semantics is proven sound and complete. In#N#particular, for regular infinite lambda-trees it is decidable whether a given#N#automaton has a run or not. As regular lambda-trees are precisely recursion#N#schemes, this decidability result holds for arbitrary recursion schemes of#N#arbitrary level, without any syntactical restriction.

Connected through hyperedge HE-1 (induced by source paper "around finite second order coherence spaces"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "relational semantics of linear logic and higher order model checking"
    - "using models to model check recursive schemes"
    - "least and greatest fixed points in linear logic"

Connected through hyperedge HE-2 (induced by source paper "typing weak msol properties"):
  with members:
    - "using models to model check recursive schemes"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-3 (induced by source paper "ordered tree pushdown systems"):
  with members:
    - "saturation algorithms for model checking pushdown systems"
    - "saturation of concurrent collapsible pushdown systems"
    - "model checking of ordered multi pushdown automata"
    - "strictness of the collapsible pushdown hierarchy"
    - "the safe lambda calculus"

Connected through hyperedge HE-4 (induced by source paper "using models to model check recursive schemes"):
  with members:
    - "io vs oi in higher order recursion schemes"

Connected through hyperedge HE-5 (induced by source paper "complexity of model checking recursion schemes for fragments of the modal mu calculus"):
  with members:
    - "the safe lambda calculus"
    - "the complexity of games on higher order pushdown automata"

Connected through hyperedge HE-6 (induced by source paper "semantics of higher order recursion schemes"):
  with members:
    - "the category theoretic solution of recursive program schemes"

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)