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: "applying quantitative semantics to higher order quantum computing"
  Abstract: Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the language to an unusably small finitary fragment, or giving up important features of quantum physics such as entanglement. In this paper, we propose a denotational semantics for a quantum lambda calculus with recursion and an infinite data type, using constructions from quantitative semantics of linear logic.

Connected through hyperedge HE-1 (induced by source paper "a fully abstract model for quantum controlled lambda calculus"):
  with members:
    - "realizability in the unitary sphere"
    - "the vectorial λ calculus"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "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-2 (induced by source paper "realizability in the unitary sphere"):
  with members:
    - "a concrete categorical semantics of lambda s"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "typing quantum superpositions and measurement"
    - "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"
    - "a system f accounting for scalars"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "a hott quantum equational theory extended version"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "homotopies for free"
    - "the hott library a formalization of homotopy type theory in coq"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "higher inductive types as homotopy initial algebras"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-4 (induced by source paper "quantum programming made easy"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "wave style token machines and quantum lambda calculi"
    - "quipper a scalable quantum programming language"
    - "probabilistic operational semantics for the lambda calculus"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-5 (induced by source paper "mixed linear and non linear recursive types"):
  with members:
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "the best of both worlds linear functional programming without compromise"

Connected through hyperedge HE-6 (induced by source paper "qpcf higher order languages and quantum circuits"):
  with members:
    - "quantum programming made easy"
    - "formalization of metatheory of the quipper quantum programming language in a linear logic"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "wave style token machines and quantum lambda calculi"
    - "full abstraction for probabilistic pcf"
    - "quipper a scalable quantum programming language"
    - "a system f accounting for scalars"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "a concrete categorical semantics of lambda s"):
  with members:
    - "confluence in probabilistic rewriting"
    - "the vectorial λ calculus"
    - "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"
    - "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-8 (induced by source paper "reasoning about parallel quantum programs"):
  with members:
    - "quantitative robustness analysis of quantum programs"
    - "coupling techniques for reasoning about quantum programs"
    - "qwire practice formal verification of quantum circuits in coq"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "a theorem prover for quantum hoare logic and its applications"
    - "quipper a scalable quantum programming language"

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)