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: "initial semantics for higher order typed syntax in coq"
  Abstract: Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed higher-order syntax together with its formalization in the Coq proof assistant. The main theorem was first proved on paper in the second author's PhD thesis in 2010, and verified formally shortly afterwards. To a simply-typed binding signature S over a fixed set T of object types we associate a category called the category of representations of S. We show that this category has an initial object Sigma(S). From its construction it will be clear that the object Sigma(S) merits the name abstract syntax associated to S. Our theorem is implemented and proved correct in the proof assistant Coq through heavy use of dependent types. The approach through monads gives rise to an implementation of syntax where both terms and variables are intrinsically typed, i.e. where the object types are reflected in the meta-level types. This article is to be seen as a research article rather than about the formalization of a classical mathematical result. The nature of our theorem - involving lengthy, technical proofs and complicated algebraic structures - makes it particularly interesting for formal verification. Our goal is to promote the use of computer theorem provers as research tools, and, accordingly, a new way of publishing mathematical results: a parallel description of a theorem and its formalization should allow the verification of correct transcription of definitions and statements into the proof assistant, and straightforward but technical proofs should be well-hidden in a digital library. We argue that Coq's rich type theory, combined with its various features such as implicit arguments, allows a particularly readable formalization and is hence well-suited for communicating mathematics.

Connected through hyperedge HE-1 (induced by source paper "modules over relative monads for syntax and semantics"):
  with members:
    - "monads need not be endofunctors"
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "extended initiality for typed abstract syntax"
    - "modules over monads and linearity"

Connected through hyperedge HE-2 (induced by source paper "from signatures to monads in unimath"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "heterogeneous substitution systems revisited"
    - "non wellfounded trees in homotopy type theory"
    - "modules over monads and linearity"

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

Connected through hyperedge HE-4 (induced by source paper "extended initiality for typed abstract syntax"):
  with members:
    - "modules over relative monads for syntax and semantics"
    - "monads need not be endofunctors"
    - "modules over monads and linearity"

Connected through hyperedge HE-5 (induced by source paper "initial semantics for strengthened signatures"):
  with members:
    - "modules over relative monads for syntax and semantics"
    - "second order algebraic theories"
    - "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)