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: "inferring algebraic effects"
  Abstract: We present a complete polymorphic effect inference algorithm for an ML-style#N#language with handlers of not only exceptions, but of any other algebraic#N#effect such as input & output, mutable references and many others. Our main aim#N#is to offer the programmer a useful insight into the effectful behaviour of#N#programs. Handlers help here by cutting down possible effects and the resulting#N#lengthy output that often plagues precise effect systems. Additionally, we#N#present a set of methods that further simplify the displayed types, some even#N#by deliberately hiding inferred information from the programmer.

Connected through hyperedge HE-1 (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"
    - "koka programming with row polymorphic effect types"
    - "an effect system for algebraic effects and handlers"

Connected through hyperedge HE-2 (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"
    - "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"

Connected through hyperedge HE-3 (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"
    - "koka programming with row polymorphic effect types"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"
    - "programming interfaces and basic topology"

Connected through hyperedge HE-4 (induced by source paper "imp with exceptions over decorated logic"):
  with members:
    - "programming with algebraic effects and handlers"
    - "certified proofs in programs involving exceptions"
    - "an effect system for algebraic effects and handlers"
    - "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)