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: "semantics of higher order quantum computation via geometry of interaction"
  Abstract: While much of the current study on quantum computation employs low-level formalisms such as quantum circuits, several high-level languages/calculi have been recently proposed aiming at structured quantum programming. The current work contributes to the semantical study of such languages by providing interaction-based semantics of a functional quantum programming language; the latter is, much like Selinger and Valiron's, based on linear lambda calculus and equipped with features like the ! modality and recursion. The proposed denotational model is the first one that supports the full features of a quantum functional programming language; we prove adequacy of our semantics. The construction of our model is by a series of existing techniques taken from the semantics of classical computation as well as from process theory. The most notable among them is Girard's Geometry of Interaction (GoI), categorically formulated by Abramsky, Haghverdi and Scott. The mathematical genericity of these techniques---largely due to their categorical formulation---is exploited for our move from classical to quantum.

Connected through hyperedge HE-1 (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"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "higher inductive types as homotopy initial algebras"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-2 (induced by source paper "the game semantics of game theory"):
  with members:
    - "morphisms of open games"
    - "profunctor optics modular data accessors"
    - "compositional game theory"
    - "retracing some paths in process algebra"
    - "mathematical foundations for a compositional distributional model of meaning"

Connected through hyperedge HE-3 (induced by source paper "quantum programming with inductive datatypes causality and affine type theory"):
  with members:
    - "mixed linear and non linear recursive types"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "von neumann algebras form a model for the quantum lambda calculus"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "semantics for a quantum programming language by operator algebras"

Connected through hyperedge HE-4 (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"
    - "wave style token machines and quantum lambda calculi"
    - "full abstraction for probabilistic pcf"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-5 (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"
    - "a theorem prover for quantum hoare logic and its applications"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-6 (induced by source paper "classical control quantum circuits and linear logic in enriched category theory"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "a recipe for state and effect triangles"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "operator algebras in quantum computation"
    - "monads need not be endofunctors"
    - "linear usage of state"
    - "semantics for a quantum programming language by operator algebras"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-7 (induced by source paper "the geometry of parallelism classical probabilistic and quantum effects"):
  with members:
    - "wave style token machines and quantum lambda calculi"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-8 (induced by source paper "wave style token machines and quantum lambda calculi"):
  with members:
    - "wave style token machines and quantum lambda calculi long version"
    - "on multiplicative linear logic modality and quantum circuits"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"
    - "a lambda calculus for quantum computation with classical control"

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)