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: "modules over relative monads for syntax and semantics"
  Abstract: We give an algebraic characterization of the syntax and semantics of a class of languages with variable binding. #R##N#We introduce a notion of 2-signature: such a signature specifies not only the terms of a language, but also reduction rules on those terms. To any 2-signature $S$ we associate a category of "models" of $S$. This category has an initial object, which integrates the terms freely generated by $S$, and which is equipped with reductions according to the inequations given in $S$. We call this initial object the language generated by $S$. Models of a 2--signature are built from relative monads and modules over such monads. Through the use of monads, the models---and in particular, the initial model---come equipped with a substitution operation that is compatible with reduction in a suitable sense. #R##N#The initiality theorem is formalized in the proof assistant Coq, yielding a machinery which, when fed with a 2-signature, provides the associated programming language with reduction relation and certified substitution.

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"
    - "high level signatures and initial semantics"
    - "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"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-2 (induced by source paper "modular specification of monads through higher order presentations"):
  with members:
    - "high level signatures and initial semantics"
    - "modules over monads and linearity"

Connected through hyperedge HE-3 (induced by source paper "high level signatures and initial semantics"):
  with members:
    - "from signatures to monads in unimath"
    - "monads need not be endofunctors"
    - "second order algebraic theories"
    - "initial semantics for strengthened signatures"
    - "modules over monads and linearity"

Connected through hyperedge HE-4 (induced by source paper "models of type theory with strict equality"):
  with members:
    - "extending homotopy type theory with strict equality"

Connected through hyperedge HE-5 (induced by source paper "monads need not be endofunctors"):
  with members:
    - "coherence for skew monoidal categories"
    - "denotation of contextual modal type theory cmtt syntax and meta programming"
    - "initiality for typed syntax and semantics"

Connected through hyperedge HE-6 (induced by source paper "initiality for typed syntax and semantics"):
  with members:
    - "monads need not be endofunctors"
    - "extended initiality for typed abstract syntax"
    - "efficient csl model checking using stratification"
    - "type classes for mathematics in type theory"
    - "initial semantics for higher order typed syntax in coq"
    - "modules over monads and linearity"

Connected through hyperedge HE-7 (induced by source paper "extended initiality for typed abstract syntax"):
  with members:
    - "monads need not be endofunctors"
    - "initial semantics for higher order typed syntax in coq"
    - "modules over monads and linearity"

Connected through hyperedge HE-8 (induced by source paper "initial semantics for strengthened signatures"):
  with members:
    - "second order algebraic theories"
    - "initial semantics for higher order typed syntax in coq"
    - "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)