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: "high level signatures and initial semantics"
  Abstract: We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we consider a general notion of "signature" for specifying syntactic constructions. Our signatures subsume classical algebraic signatures (i.e., signatures for languages with variable binding, such as the pure lambda calculus) and extend to much more general examples.#N#In the spirit of Initial Semantics, we define the "syntax generated by a signature" to be the initial object - if it exists - in a suitable category of models. Our notions of signature and syntax are suited for compositionality and provide, beyond the desired algebra of terms, a well-behaved substitution and the associated inductive/recursive principles.#N#Our signatures are "general" in the sense that the existence of an associated syntax is not automatically guaranteed. In this work, we identify a large and simple class of signatures which do generate a syntax.#N#This paper builds upon ideas from a previous attempt by Hirschowitz-Maggesi, which, in turn, was directly inspired by some earlier work of Ghani-Uustalu-Hamana and Matthes-Uustalu.#N#The main results presented in the paper are computer-checked within the UniMath system.

Connected through hyperedge HE-1 (induced by source paper "reduction monads and their signatures"):
  with members:
    - "modular specification of monads through higher order presentations"
    - "signatures and models for syntax and operational semantics in the presence of variable binding"
    - "lecture notes on the lambda calculus"
    - "modules over relative monads for syntax and semantics"
    - "monads need not be endofunctors"
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "second order algebraic theories"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-2 (induced by source paper "signatures and models for syntax and operational semantics in the presence of variable binding"):
  with members:
    - "lecture notes on the lambda calculus"
    - "monads need not be endofunctors"
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "second order algebraic theories"
    - "initial semantics for strengthened signatures"
    - "closed nominal rewriting and efficiently computable nominal algebra equality"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-3 (induced by source paper "modular specification of monads through higher order presentations"):
  with members:
    - "modules over relative monads for syntax and semantics"
    - "modules over monads and linearity"

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)