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: "using models to model check recursive schemes"
  Abstract: We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, we argue that having models capturing some class of properties has several other virtues in addition to providing decidability of the model-checking problem. As an illustration, we show a very simple construction transforming a scheme to a scheme reflecting a property captured by a given model.

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"
    - "least and greatest fixed points in linear logic"
    - "a finite semantics of simply typed lambda terms for infinite runs of automata"

Connected through hyperedge HE-2 (induced by source paper "recursion schemes the mso logic and the u quantifier"):
  with members:
    - "the diagonal problem for higher order recursion schemes is decidable"
    - "unboundedness and downward closures of higher order pushdown automata"
    - "ordered tree pushdown systems"
    - "an approach to computing downward closures"
    - "weak mso u with path quantifiers over infinite trees"
    - "io vs oi in higher order recursion schemes"
    - "weak mso with the unbounding quantifier"

Connected through hyperedge HE-3 (induced by source paper "domains for higher order games"):
  with members:
    - "proving liveness of parameterized programs"
    - "summaries for context free games"

Connected through hyperedge HE-4 (induced by source paper "the diagonal problem for higher order recursion schemes is decidable"):
  with members:
    - "on word and frontier languages of unsafe higher order grammars"
    - "unboundedness and downward closures of higher order pushdown automata"
    - "ordered tree pushdown systems"
    - "an approach to computing downward closures"
    - "a characterization for decidable separability by piecewise testable languages"
    - "finite automata for the sub and superword closure of cfls descriptional and computational complexity"
    - "computing downward closures for stacked counter automata"
    - "complexity of model checking recursion schemes for fragments of the modal mu calculus"

Connected through hyperedge HE-5 (induced by source paper "typing weak msol properties"):
  with members:
    - "algorithms for omega regular games with imperfect information"
    - "a finite semantics of simply typed lambda terms for infinite runs of automata"

Connected through hyperedge HE-6 (induced by source paper "an infinitary model of linear logic"):
  with members:
    - "typing weak msol properties"
    - "least and greatest fixed points in linear logic"

Connected through hyperedge HE-7 (induced by source paper "indexed linear logic and higher order model checking"):
  with members:
    - "execution time of lambda terms via denotational semantics and intersection types"

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)