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 type system for the vectorial aspect of the linear algebraic lambda calculus"
  Abstract: We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We show that the resulting typed lambda-calculus is strongly normalizing and features a weak subject-reduction.

Connected through hyperedge HE-1 (induced by source paper "the vectorial λ calculus"):
  with members:
    - "typing quantum superpositions and measurement"
    - "two linearities for quantum computing in the lambda calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "simply typed lambda calculus modulo type isomorphisms"
    - "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"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"

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"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "call by value call by name and the vectorial behaviour of the algebraic λ calculus"):
  with members:
    - "the vectorial λ calculus"
    - "full abstraction for the resource lambda calculus with tests through taylor expansion"
    - "a finiteness structure on resource terms"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"

Connected through hyperedge HE-4 (induced by source paper "the probability of non confluent systems"):
  with members:
    - "the vectorial λ calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "normalisation of a non deterministic type isomorphic lambda calculus"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "probabilistic operational semantics for the lambda calculus"
    - "pure type systems without explicit contexts"

Connected through hyperedge HE-5 (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"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-6 (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"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "a system f accounting for scalars"):
  with members:
    - "semantics of a typed algebraic lambda calculus"
    - "a finiteness structure on resource terms"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"
    - "reasoning about entanglement and separability in quantum higher order functions"
    - "quantum entanglement analysis based on abstract interpretation"
    - "a lambda calculus for quantum computation with classical control"
    - "probabilistic asynchronous pi calculus"

Connected through hyperedge HE-8 (induced by source paper "confluence via strong normalisation in an algebraic lambda calculus with rewriting"):
  with members:
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "linearity in the non deterministic call by value setting"
    - "semantics of a typed algebraic lambda calculus"
    - "a finiteness structure on resource terms"
    - "algebraic totality towards completeness"
    - "probabilistic asynchronous pi 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)