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: "diagrammatic logic applied to a parameterization process"
  Abstract: This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2-morphisms between diagrammatic logics. The definition of the 2-category of diagrammatic logics rely on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalization of a parameterization process. This process, which consists in adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process, for recovering a model of the given specification from a model of the parameterized specification and an actual parameter, is seen as a 2-morphism of logics.

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"
    - "a duality between exceptions and states"
    - "decorated proofs for computational effects states"

Connected through hyperedge HE-2 (induced by source paper "deduction as reduction"):
  with members:
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-3 (induced by source paper "how to combine diagrammatic logics"):
  with members:
    - "cartesian effect categories are freyd categories"

Connected through hyperedge HE-4 (induced by source paper "a parameterization process functorially"):
  with members:
    - "a parameterization process as a categorical construction"

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)