human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "typing quantum superpositions and measurement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "two linearities for quantum computing in the lambda calculus":
    also connected through other hyperedges:
      (none)
  Member "quantum superpositions and projective measurement in the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ")
  Member "simply typed lambda calculus modulo type isomorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the exp log normal form of types decomposing extensional equality and representing terms compactly")
  Member "call by value call by name and the vectorial behaviour of the algebraic λ calculus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "call by value non determinism in a linear logic type discipline":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "types by need extended version")
  Member "non idempotent intersection types and strong normalisation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "types by need extended version")
  Member "bounding normalization time through intersection types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ")

Question: Please tell me which class the source paper 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)