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 monads and linearity"
  Abstract: Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important property of compatibility with substitution, in the heterogeneous case where "terms" and variables therein could be of different types as well as in the homogeneous case. In this paper, we present basic constructions of modules and we show examples concerning in particular abstract syntax and lambda-calculus.

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

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

Connected through hyperedge HE-3 (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"
    - "initial semantics for higher order typed syntax in coq"

Connected through hyperedge HE-4 (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"
    - "initial semantics for higher order typed syntax in coq"

Connected through hyperedge HE-5 (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"
    - "initial semantics for higher order typed syntax in coq"

Connected through hyperedge HE-6 (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"
    - "initial semantics for higher order typed syntax in coq"

Connected through hyperedge HE-7 (induced by source paper "initial semantics for strengthened signatures"):
  with members:
    - "modules over relative monads for syntax and semantics"
    - "second order algebraic theories"
    - "initial semantics for higher order typed syntax in coq"

Connected through hyperedge HE-8 (induced by source paper "innocent strategies as presheaves and interactive equivalences for ccs"):
  with members:
    - "contraction free proofs and finitary games for linear logic"

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)