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: "an effect system for algebraic effects and handlers"
  Abstract: We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style programming language with first-class algebraic effects and handlers. We define an expressive effect system and prove safety of operational semantics with respect to it. Then we give a domain-theoretic denotational semantics of core Eff, using Pitts's theory of minimal invariant relations, and prove it adequate. We use this fact to develop tools for finding useful contextual equivalences, including an induction principle. To demonstrate their usefulness, we use these tools to derive the usual equations for mutable state, including a general commutativity law for computations using non-interfering references. We have formalized the effect system, the operational semantics, and the safety theorem in Twelf.

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

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

Connected through hyperedge HE-3 (induced by source paper "sequential effect systems with control operators"):
  with members:
    - "koka programming with row polymorphic effect types"
    - "the essence of javascript"

Connected through hyperedge HE-4 (induced by source paper "what is algebraic about algebraic effects and handlers"):
  with members:
    - "programming with algebraic effects and handlers"

Connected through hyperedge HE-5 (induced by source paper "no value restriction is needed for algebraic effects and handlers"):
  with members:
    - "on the expressive power of user defined effects effect handlers monadic reflection delimited control"
    - "efficient algebraic effect handlers for prolog"
    - "do be do be do"
    - "trace semantics for polymorphic references"
    - "programming with algebraic effects and handlers"
    - "knowledge spaces and the completeness of learning strategies"
    - "inferring algebraic effects"
    - "koka programming with row polymorphic effect types"

Connected through hyperedge HE-6 (induced by source paper "on the expressive power of user defined effects effect handlers monadic reflection delimited control"):
  with members:
    - "factorisation systems for logical relations and monadic lifting in type and effect system semantics"
    - "no value restriction is needed for algebraic effects and handlers"
    - "do be do be do"
    - "answer type modification without tears prompt passing style translation for typed delimited control operators"
    - "programming with algebraic effects and handlers"
    - "inferring algebraic effects"
    - "combining and relating control effects and their semantics"
    - "a framework for specifying prototyping and reasoning about computational systems"

Connected through hyperedge HE-7 (induced by source paper "do be do be do"):
  with members:
    - "on the expressive power of user defined effects effect handlers monadic reflection delimited control"
    - "programming with algebraic effects and handlers"
    - "inferring algebraic effects"
    - "koka programming with row polymorphic effect types"
    - "handling algebraic effects"
    - "programming interfaces and basic topology"

Connected through hyperedge HE-8 (induced by source paper "imp with exceptions over decorated logic"):
  with members:
    - "programming with algebraic effects and handlers"
    - "inferring algebraic effects"
    - "certified proofs in programs involving exceptions"
    - "handling algebraic effects"
    - "formal verification in coq of program properties involving the global state effect"
    - "a duality between exceptions and states"
    - "decorated proofs for computational effects states"
    - "a duality between exceptions and states"

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)