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 "extended initiality for typed abstract syntax"):
  Abstract: Initial Semantics aims at interpreting the syntax associated to a signature#N#as the initial object of some category of 'models', yielding induction and#N#recursion principles for abstract syntax. Zsid\'o proves an initiality result#N#for simply-typed syntax: given a signature S, the abstract syntax associated to#N#S constitutes the initial object in a category of models of S in monads.#N#However, the iteration principle her theorem provides only accounts for#N#translations between two languages over a fixed set of object types. We#N#generalize Zsid\'o's notion of model such that object types may vary, yielding#N#a larger category, while preserving initiality of the syntax therein. Thus we#N#obtain an extended initiality theorem for typed abstract syntax, in which#N#translations between terms over different types can be specified via the#N#associated category-theoretic iteration operator as an initial morphism. Our#N#definitions ensure that translations specified via initiality are type-safe,#N#i.e. compatible with the typing in the source and target language in the#N#obvious sense. Our main example is given via the propositions-as-types#N#paradigm: we specify propositions and inference rules of classical and#N#intuitionistic propositional logics through their respective typed signatures.#N#Afterwards we use the category--theoretic iteration operator to specify a#N#double negation translation from the former to the latter. A second example is#N#given by the signature of PCF. For this particular case, we formalize the#N#theorem in the proof assistant Coq. Afterwards we specify, via the#N#category-theoretic iteration operator, translations from PCF to the untyped#N#lambda calculus.

Includes members:
  Member "modules over relative monads for syntax and semantics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reduction monads and their signatures")
  Member "monads need not be endofunctors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reduction monads and their signatures")
  Member "initial semantics for higher order typed syntax in coq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modules over relative monads for syntax and semantics")
  Member "modules over monads and linearity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "modular specification of monads through higher order presentations")

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)