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 "initiality for typed syntax and semantics"):
  Abstract: We give an algebraic characterization of the syntax and semantics of a class of simply–typed languages, such as the language PCF: we characterize simply–typed binding syntax equipped with reduction rules via a universal property, namely as the initial object of some category. For this purpose, we employ techniques developed in two previous works: in [2], we model syntactic translations between languages over different sets of types as initial morphisms in a category of models. In [1], we characterize untyped syntax with reduction rules as initial object in a category of models. In the present work, we show that those techniques are modular enough to be combined: we thus characterize simply–typed syntax with reduction rules as initial object in a category. The universal property yields an operator which allows to specify translations — that are semantically faithful by construction — between languages over possibly different sets of types.

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 "extended initiality for typed abstract syntax":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modules over relative monads for syntax and semantics")
  Member "efficient csl model checking using stratification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on probabilistic term rewriting")
  Member "type classes for mathematics in type theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tabled typeclass resolution")
  Member "initial semantics for higher order typed syntax in coq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)