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: "handling algebraic effects"
  Abstract: Algebraic effects are computational effects that can be represented by an#N#equational theory whose operations produce the effects at hand. The free model#N#of this theory induces the expected computational monad for the corresponding#N#effect. Algebraic effects include exceptions, state, nondeterminism,#N#interactive input/output, and time, and their combinations. Exception handling,#N#however, has so far received no algebraic treatment. We present such a#N#treatment, in which each handler yields a model of the theory for exceptions,#N#and each handling construct yields the homomorphism induced by the universal#N#property of the free model. We further generalise exception handlers to#N#arbitrary algebraic effects. The resulting programming construct includes many#N#previously unrelated examples from both theory and practice, including#N#relabelling and restriction in Milner's CCS, timeout, rollback, and stream#N#redirection.

Connected through hyperedge HE-1 (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"
    - "programming with algebraic effects and handlers"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"

Connected through hyperedge HE-2 (induced by source paper "graded algebraic theories"):
  with members:
    - "graded monads and graded logics for the linear time branching time spectrum"

Connected through hyperedge HE-3 (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"
    - "programming with algebraic effects and handlers"
    - "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-4 (induced by source paper "dijkstra monads for all"):
  with members:
    - "signatures and induction principles for higher inductive inductive types"
    - "quantitative logics for equivalence of effectful programs"
    - "behavioural equivalence via modalities for algebraic effects"
    - "dijkstra monads for free"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "exploring the boundaries of monad tensorability on set"

Connected through hyperedge HE-5 (induced by source paper "behavioural equivalence via modalities for algebraic effects"):
  with members:
    - "quantitative logics for equivalence of effectful programs"
    - "dijkstra monads for all"
    - "dijkstra monads for free"
    - "abstract effects and proof relevant logical relations"
    - "a model of cooperative threads"
    - "on csp and the algebraic theory of effects"

Connected through hyperedge HE-6 (induced by source paper "interaction laws of monads and comonads"):
  with members:
    - "runners in action"
    - "notions of computation as monoids"
    - "linear usage of state"
    - "free applicative functors"
    - "games and full completeness for multiplicative linear logic"
    - "programming interfaces and basic topology"

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

Connected through hyperedge HE-8 (induced by source paper "local reasoning for robust observational equivalence"):
  with members:
    - "evolving algebras 1993 lipari guide"
    - "monoidal computer i basic computability by string diagrams"

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)