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: "monads need not be endofunctors"
  Abstract: We introduce a generalization of monads, called relative monads, allowing for#N#underlying functors between different categories. Examples include#N#finite-dimensional vector spaces, untyped and typed lambda-calculus syntax and#N#indexed containers. We show that the Kleisli and Eilenberg-Moore constructions#N#carry over to relative monads and are related to relative adjunctions. Under#N#reasonable assumptions, relative monads are monoids in the functor category#N#concerned and extend to monads, giving rise to a coreflection between relative#N#monads and monads. Arrows are also an instance of relative monads.

Connected through hyperedge HE-1 (induced by source paper "reduction monads and their signatures"):
  with members:
    - "modular specification of monads through higher order presentations"
    - "signatures and models for syntax and operational semantics in the presence of variable binding"
    - "high level signatures and initial semantics"
    - "lecture notes on the lambda calculus"
    - "modules over relative monads for syntax and semantics"
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "second order algebraic theories"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-2 (induced by source paper "a type and scope safe universe of syntaxes with binding their semantics and proofs"):
  with members:
    - "generic description of well scoped well typed syntaxes"
    - "miniagda integrating sized and dependent types"

Connected through hyperedge HE-3 (induced by source paper "the sequent calculus of skew monoidal categories"):
  with members:
    - "coherence for skew monoidal categories"

Connected through hyperedge HE-4 (induced by source paper "signatures and models for syntax and operational semantics in the presence of variable binding"):
  with members:
    - "high level signatures and initial semantics"
    - "lecture notes on the lambda calculus"
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "second order algebraic theories"
    - "initial semantics for strengthened signatures"
    - "closed nominal rewriting and efficiently computable nominal algebra equality"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-5 (induced by source paper "effects without monads non determinism back to the meta language"):
  with members:
    - "building blocks for performance oriented dsls"

Connected through hyperedge HE-6 (induced by source paper "probabilistic relational reasoning via metrics"):
  with members:
    - "duet an expressive higher order language and linear type system for statically enforcing differential privacy"
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "a domain theory for statistical probabilistic programming"
    - "proving expected sensitivity of probabilistic programs"
    - "a semantic account of metric preservation"
    - "approximate relational hoare logic for continuous random samplings"
    - "differentially private bayesian programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-7 (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"
    - "second order algebraic theories"
    - "initial semantics for strengthened signatures"
    - "modules over monads and linearity"

Connected through hyperedge HE-8 (induced by source paper "guarded computational type theory"):
  with members:
    - "denotational semantics for guarded dependent type theory"
    - "guarded dependent type theory with coinductive types"
    - "guarded cubical type theory path equality for guarded recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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.PL(Programming Languages)