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 "typing quantum superpositions and measurement"):
  Abstract: We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions. We illustrate this idea by defining a quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors. In addition, we provide an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis.

Includes members:
  Member "the vectorial λ calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "call by value call by name and the vectorial behaviour of the algebraic λ calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "quipper a scalable quantum programming language":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward certified quantum programming")
  Member "applying quantitative semantics to higher order quantum computing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "a system f accounting for scalars":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "linearity in the non deterministic call by value setting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")

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)