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: "logical relations for monadic types"
  Abstract: Logical relations and their generalisations are a fundamental tool in proving properties of lambda calculi, for example, for yielding sound principles for observational equivalence. We propose a natural notion of logical relations that is able to deal with the monadic types of Moggi's computational lambda calculus. The treatment is categorical, and is based on notions of subsconing, mono factorisation systems and monad morphisms. Our approach has a number of interesting applications, including cases for lambda calculi with non-determinism (where being in a logical relation means being bisimilar), dynamic name creation and probabilistic systems.

Connected through hyperedge HE-1 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem"):
  with members:
    - "a simple differentiable programming language"
    - "confusion of tagged perturbations in forward automatic differentiation of higher order functions"
    - "efficient differentiable programming in a functional array processing language"
    - "the simple essence of automatic differentiation"
    - "automatic differentiation in machine learning a survey"
    - "step indexed logical relations for probability"
    - "abstract effects and proof relevant logical relations"
    - "church scott ptime an application of resource sensitive realizability"

Connected through hyperedge HE-2 (induced by source paper "effectful applicative bisimilarity monads relators and howe s method long version"):
  with members:
    - "step indexed logical relations for probability"

Connected through hyperedge HE-3 (induced by source paper "the many worlds of modal λ calculi i curry howard for necessity possibility and time"):
  with members:
    - "calculi for intuitionistic normal modal logic"

Connected through hyperedge HE-4 (induced by source paper "towards 3 dimensional rewriting theory"):
  with members:
    - "the structure of first order causality"
    - "computing critical pairs in 2 dimensional rewriting systems"
    - "the structure of first order causality"

Connected through hyperedge HE-5 (induced by source paper "on probabilistic applicative bisimulation and call by value λ calculi long version"):
  with members:
    - "on constructor rewrite systems and the lambda calculus"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-6 (induced by source paper "program equivalence in linear contexts"):
  with members:
    - "on completeness of logical relations for monadic types"

Connected through hyperedge HE-7 (induced by source paper "relational parametricity for computational effects"):
  with members:
    - "linear abadi and plotkin logic"
    - "relational parametricity and control"

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)