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: "a duality between exceptions and states"
  Abstract: In this short note we study the semantics of two basic computational effects, exceptions and states, from a new point of view. In the handling of exceptions we dissociate the control from the elementary operation that recovers from the exception. In this way it becomes apparent that there is a duality, in the categorical sense, between exceptions and states.

Connected through hyperedge HE-1 (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"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"
    - "formal verification in coq of program properties involving the global state effect"
    - "decorated proofs for computational effects states"
    - "a duality between exceptions and states"

Connected through hyperedge HE-2 (induced by source paper "certified proofs in programs involving exceptions"):
  with members:
    - "patterns for computational effects arising from a monad or a comonad"
    - "formal verification in coq of program properties involving the global state effect"
    - "decorated proofs for computational effects states"
    - "a duality between exceptions and states"
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-3 (induced by source paper "formal verification in coq of program properties involving the global state effect"):
  with members:
    - "patterns for computational effects arising from a monad or a comonad"
    - "decorated proofs for computational effects states"
    - "a duality between exceptions and states"
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-4 (induced by source paper "scalability using effects"):
  with members:
    - "decorated proofs for computational effects states"
    - "adjunctions for exceptions"
    - "a duality between exceptions and states"
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-5 (induced by source paper "decorated proofs for computational effects states"):
  with members:
    - "adjunctions for exceptions"
    - "a duality between exceptions and states"
    - "states and exceptions considered as dual effects"
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-6 (induced by source paper "decorated proofs for computational effects exceptions"):
  with members:
    - "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.LO(Logic in Computer Science)