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 "quantum superpositions and projective measurement in the lambda calculus"):
  Abstract: We propose an extension of simply typed lambda-calculus to handle some properties of quantum computing. The equiprobable quantum superposition is taken as a commutative pair and the quantum measurement as a non-deterministic projection over it. Destructive interferences are achieved by introducing an inverse symbol with respect to pairs. The no-cloning property is ensured by using a combination of syntactic linearity with linear logic. Indeed, the syntactic linearity is enough for unitary gates, while a function measuring its argument needs to enforce that the argument is used only once.

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 "simply typed lambda calculus modulo type isomorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the vectorial λ 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)