human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "signatures and models for syntax and operational semantics in the presence of variable binding"):
  Abstract: This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable category of models.This characterization, in the spirit of Initial Semantics, gives a justification of the recursion principle. Languages with variable binding, such as the pure lambda calculus, are monads on the category of sets specified through the classical algebraic signatures. The first extensions to syntaxes with equations that we consider are quotients of these algebraic signatures. They allow, for example, to specify a binary commutative operation. But some equations, such as associativity, seem to remain out of reach. We thus introduce the notion of 2-signature, consisting in two parts: a specification of operations through a usual signature as before, and a set of equations among them. We identify the class of algebraic 2-signatures for which the existence of the associated syntax is guaranteed. Finally, we takle the specification of the operational semantics of a programming language such as lambda calculus with beta-reduction. To this end, we introduce the notion of reduction monad and their signatures, then we generalize them to get the notion of operational monad.

Includes members:
  Member "high level signatures and initial semantics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reduction monads and their signatures")
  Member "lecture notes on the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reduction monads and their signatures")
  Member "monads need not be endofunctors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reduction monads and their signatures")
  Member "cartesian closed 2 categories and permutation equivalence in higher order rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reduction monads and their signatures")
  Member "second order algebraic theories":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reduction monads and their signatures")
  Member "initial semantics for strengthened signatures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "high level signatures and initial semantics")
  Member "closed nominal rewriting and efficiently computable nominal algebra equality":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "nominal c unification")
  Member "a theory of explicit substitutions with safe and full composition":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reduction monads and their signatures")

Question: Please tell me which class the source paper 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)