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: "models and theories of lambda calculus"
  Abstract: In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general construction of lambda-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stone-style representation theorem for combinatory algebras; (iii) a proof that no effective lambda-model can have lambda-beta or lambda-beta-eta as its equational theory (this can be seen as a partial answer to an open problem introduced by Honsell-Ronchi Della Rocca in 1984).

Connected through hyperedge HE-1 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions"):
  with members:
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "pure type systems without explicit contexts"

Connected through hyperedge HE-2 (induced by source paper "simply typed lambda calculus modulo type isomorphisms"):
  with members:
    - "call by value non determinism in a linear logic type discipline"
    - "non determinism through type isomorphism"
    - "the probability of non confluent systems"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "pure type systems without explicit contexts"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "non determinism through type isomorphism"):
  with members:
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "completeness of algebraic cps simulations"
    - "confluence via strong normalisation in an algebraic lambda calculus with rewriting"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"

Connected through hyperedge HE-4 (induced by source paper "normalisation of a non deterministic type isomorphic lambda calculus"):
  with members:
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "pure type systems without explicit contexts"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"

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)