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: "on the expressive power of user defined effects effect handlers monadic reflection delimited control"
  Abstract: We compare the expressive power of three programming abstractions for user-defined computational effects: Bauer and Pretnar's effect handlers, Filinski's monadic reflection, and delimited control without answer-type-modification. This comparison allows a precise discussion about the relative expressiveness of each programming abstraction. It also demonstrates the sensitivity of the relative expressiveness of user-defined effects to seemingly orthogonal language features. We present three calculi, one per abstraction, extending Levy's call-by-push-value. For each calculus, we present syntax, operational semantics, a natural type-and-effect system, and, for effect handlers and monadic reflection, a set-theoretic denotational semantics. We establish their basic meta-theoretic properties: safety, termination, and, where applicable, soundness and adequacy. Using Felleisen's notion of a macro translation, we show that these abstractions can macro-express each other, and show which translations preserve typeability. We use the adequate finitary set-theoretic denotational semantics for the monadic calculus to show that effect handlers cannot be macro-expressed while preserving typeability either by monadic reflection or by delimited control. We supplement our development with a mechanised Abella formalisation.

Connected through hyperedge HE-1 (induced by source paper "handling polymorphic algebraic effects"):
  with members:
    - "no value restriction is needed for algebraic effects and handlers"
    - "do be do be do"
    - "programming with algebraic effects and handlers"

Connected through hyperedge HE-2 (induced by source paper "eff directly in ocaml"):
  with members:
    - "programming with algebraic effects and handlers"

Connected through hyperedge HE-3 (induced by source paper "no value restriction is needed for algebraic effects and handlers"):
  with members:
    - "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"
    - "an effect system for algebraic effects and handlers"

Connected through hyperedge HE-4 (induced by source paper "do be do be do"):
  with members:
    - "programming with algebraic effects and handlers"
    - "inferring algebraic effects"
    - "koka programming with row polymorphic effect types"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"
    - "programming interfaces and basic topology"

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.LO(Logic in Computer Science)