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: "no value restriction is needed for algebraic effects and handlers"
  Abstract: We present a straightforward, sound, Hindley–Milner polymorphic type#N#                        system for algebraic effects and handlers in a call-by-value calculus, which, to#N#                        our surprise, allows type variable generalisation of arbitrary computations, and#N#                        not just values. We first recall that the soundness of unrestricted#N#                        call-by-value Hindley–Milner polymorphism is known to fail in the#N#                        presence of computational effects such as reference cells and continuations, and#N#                        that many programming examples can be recast to use effect handlers instead of#N#                        these effects. After presenting the calculus and its soundness proof, formalised#N#                        in Twelf, we analyse the expressive power of effect handlers with respect to#N#                        state effects. We conjecture handlers alone cannot express reference cells, but#N#                        show they can simulate dynamically scoped state, establishing that dynamic#N#                        binding also does not need a value restriction.

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

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

Connected through hyperedge HE-3 (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"
    - "programming with algebraic effects and handlers"
    - "effect dependent transformations for concurrent programs"

Connected through hyperedge HE-4 (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"
    - "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"
    - "an effect system for algebraic effects and handlers"
    - "combining and relating control effects and their semantics"
    - "a framework for specifying prototyping and reasoning about computational systems"

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)