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: "programming with algebraic effects and handlers"
  Abstract: Abstract    Eff  is a programming language based on the algebraic approach to computational effects, in which effects are viewed as algebraic operations and effect handlers as homomorphisms from free algebras.  Eff  supports first-class effects and handlers through which we may easily define new computational effects, seamlessly combine existing ones, and handle them in novel ways. We give a denotational semantics of  Eff  and discuss a prototype implementation based on it. Through examples we demonstrate how the standard effects are treated in  Eff , and how  Eff  supports programming techniques that use various forms of delimited continuations, such as backtracking, breadth-first search, selection functionals, cooperative multi-threading, and others.

Connected through hyperedge HE-1 (induced by source paper "a cubical language for bishop sets"):
  with members:
    - "cubical syntax for reflection free extensional equality"
    - "pointers in recursion exploring the tropics"
    - "design and implementation of the andromeda proof assistant"
    - "the redprl proof assistant invited paper"
    - "computational higher type theory iii univalent universes and exact equality"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"

Connected through hyperedge HE-2 (induced by source paper "signature restriction for polymorphic algebraic effects"):
  with members:
    - "handling polymorphic algebraic effects"
    - "no value restriction is needed for algebraic effects and handlers"
    - "do be do be do"
    - "handling algebraic effects"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"

Connected through hyperedge HE-3 (induced by source paper "asynchronous effects"):
  with members:
    - "runners in action"
    - "pyro deep universal probabilistic programming"
    - "do be do be do"
    - "an effect system for algebraic effects and handlers"

Connected through hyperedge HE-4 (induced by source paper "interaction trees representing recursive and impure programs in coq"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"
    - "handling algebraic effects"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

Connected through hyperedge HE-5 (induced by source paper "runners in action"):
  with members:
    - "synthesizing symmetric lenses"
    - "linear usage of state"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"
    - "functor is to lens as applicative is to biplate introducing multiplate"

Connected through hyperedge HE-6 (induced by source paper "handling polymorphic algebraic effects"):
  with members:
    - "no value restriction is needed for algebraic effects and handlers"
    - "on the expressive power of user defined effects effect handlers monadic reflection delimited control"
    - "do be do be do"

Connected through hyperedge HE-7 (induced by source paper "gradual session types"):
  with members:
    - "gradual parametricity revisited"
    - "gradual liquid type inference"
    - "depending on session typed processes"
    - "fast and precise type checking for javascript"
    - "sums of uncertainty refinements go gradual"
    - "design and implementation of concurrent c0"
    - "do be do be do"
    - "an erlang implementation of multiparty session actors"

Connected through hyperedge HE-8 (induced by source paper "factorisation systems for logical relations and monadic lifting in type and effect system semantics"):
  with members:
    - "a monad for full ground reference cells"
    - "no value restriction is needed for algebraic effects and handlers"
    - "effect dependent transformations for concurrent programs"

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)