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: "relational semantics of linear logic and higher order model checking"
  Abstract: In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of any higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreover, the interaction between the relational interpretations of the HORS and of the ATA identifies the set of accepting states of the tree automaton against the infinite tree generated by the recursion scheme. We show how to extend this result to alternating parity automata (APT) by introducing a parametric version of the exponential modality of linear logic, capturing the formal properties of colors (or priorities) in higher-order model-checking. We show in particular how to reunderstand in this way the type-theoretic approach to higher-order model-checking developed by Kobayashi and Ong. We briefly explain in the end of the paper how his analysis driven by linear logic results in a new and purely semantic proof of decidability of the formulas of the monadic second-order logic for higher-order recursion schemes.

Connected through hyperedge HE-1 (induced by source paper "intersection types for unboundedness problems"):
  with members:
    - "intersection types and counting"
    - "pumping lemma for higher order languages"
    - "the diagonal problem for higher order recursion schemes is decidable"
    - "on word and frontier languages of unsafe higher order grammars"
    - "ordered tree pushdown systems"
    - "finitary semantics of linear logic and higher order model checking"
    - "an approach to computing downward closures"
    - "regular cost functions part i logic and algebra over words"

Connected through hyperedge HE-2 (induced by source paper "around finite second order coherence spaces"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "using models to model check recursive schemes"
    - "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-3 (induced by source paper "on the termination problem for probabilistic higher order recursive programs"):
  with members:
    - "branching processes for quickcheck generators"
    - "on probabilistic term rewriting"
    - "a convenient category for higher order probability theory"
    - "a new proof rule for almost sure termination"
    - "on the hardness of almost sure termination"
    - "complexity of model checking recursion schemes for fragments of the modal mu calculus"
    - "church a language for generative models"
    - "proving termination of probabilistic programs using patterns"

Connected through hyperedge HE-4 (induced by source paper "higher order program verification via hfl model checking"):
  with members:
    - "a type directed negation elimination"
    - "finitary semantics of linear logic and higher order model checking"
    - "higher order program verification as satisfiability modulo theories with algebraic data types"
    - "model checking process equivalences"
    - "the complexity of model checking higher order fixpoint logic"

Connected through hyperedge HE-5 (induced by source paper "finitary semantics of linear logic and higher order model checking"):
  with members:
    - "an infinitary model of linear 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)