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: "the vectorial λ calculus"
  Abstract: We describe a type system for the linear-algebraic λ-calculus. The type system accounts for the linear-algebraic aspects of this extension of λ-calculus: it is able to statically describe the linear combinations of terms that will be obtained when reducing the programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We prove that the resulting typed λ-calculus is strongly normalising and features weak subject reduction. Finally, we show how to naturally encode matrices and vectors in this typed calculus.

Connected through hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms"):
  with members:
    - "realizability in the unitary sphere"
    - "typing quantum superpositions and measurement"
    - "proof normalisation in a logic identifying isomorphic propositions"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "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 "a fully abstract model for quantum controlled lambda calculus"):
  with members:
    - "realizability in the unitary sphere"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "a concrete categorical semantics of lambda s"):
  with members:
    - "confluence in probabilistic rewriting"
    - "typing quantum superpositions and measurement"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-4 (induced by source paper "from symmetric pattern matching to quantum control extended version"):
  with members:
    - "a categorical foundation for structured reversible flowchart languages soundness and adequacy"
    - "quantum alternation prospects and problems"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-5 (induced by source paper "typing quantum superpositions and measurement"):
  with members:
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-6 (induced by source paper "two linearities for quantum computing in the lambda calculus"):
  with members:
    - "typing quantum superpositions and measurement"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-7 (induced by source paper "quantum superpositions and projective measurement in the lambda calculus"):
  with members:
    - "simply typed lambda calculus modulo type isomorphisms"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-8 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions"):
  with members:
    - "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"
    - "models and theories of 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)