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: "formal verification in coq of program properties involving the global state effect"
  Abstract: The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we present a framework for the verification in Coq of properties of programs manipulating the global state effect. These properties are expressed in a proof system which is close to the syntax, as in effect systems, in the sense that the state does not appear explicitly in the type of expressions which manipulate it. Rather, the state appears via decorations added to terms and to equations. In this system, proofs of programs thus present two aspects: properties can be verified {\em up to effects} or the effects can be taken into account. The design of our Coq library consequently reflects these two aspects: our framework is centered around the construction of two inductive and dependent types, one for terms up to effects and one for the manipulation of decorations.

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"
    - "a duality between exceptions and states"
    - "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"
    - "a duality between exceptions and states"
    - "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 "patterns for computational effects arising from a monad or a comonad"):
  with members:
    - "certified proofs in programs involving exceptions"

Connected through hyperedge HE-4 (induced by source paper "a duality between exceptions and states"):
  with members:
    - "certified proofs in programs involving exceptions"
    - "bases as coalgebras"
    - "states and exceptions considered as dual effects"

Connected through hyperedge HE-5 (induced by source paper "a duality between exceptions and states"):
  with members:
    - "certified proofs in programs involving exceptions"
    - "bases as coalgebras"
    - "states and exceptions considered as dual effects"

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)