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 "qpcf higher order languages and quantum circuits"):
  Abstract: qPCF is a paradigmatic quantum programming language that ex- tends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a dependent type system. The co-processor is essentially a standard QRAM device, albeit we avoid to store permanently quantum states in between two co-processor's calls. Despite its quantum features, qPCF retains the classic programming approach of PCF. We introduce qPCF syntax, typing rules, and its operational semantics. We prove fundamental properties of the system, such as Preservation and Progress Theorems. Moreover, we provide some higher-order examples of circuit encoding.

Includes members:
  Member "quantum programming made easy":
    also connected through other hyperedges:
      (none)
  Member "formalization of metatheory of the quipper quantum programming language in a linear logic":
    also connected through other hyperedges:
      (none)
  Member "semantics of higher order quantum computation via geometry of interaction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a hott quantum equational theory extended version")
  Member "wave style token machines and quantum lambda calculi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantum programming made easy")
  Member "full abstraction for probabilistic pcf":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the linear structure of cones")
  Member "quipper a scalable quantum programming language":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward certified quantum programming")
  Member "applying quantitative semantics to higher order quantum computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-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)