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: "a lambda calculus for quantum computation with classical control"
  Abstract: The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and we give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.

Connected through hyperedge HE-1 (induced by source paper "toward certified quantum programming"):
  with members:
    - "reqwire reasoning about reversible quantum circuits"
    - "qdb from quantum algorithms towards correct quantum programs"
    - "a verified optimizer for quantum circuits"
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "a theorem prover for quantum hoare logic and its applications"
    - "quantomatic a proof assistant for diagrammatic reasoning"
    - "formalization of quantum protocols using coq"

Connected through hyperedge HE-2 (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"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-3 (induced by source paper "classically time controlled quantum automata definition and properties"):
  with members:
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "quantum finite automata a modern introduction"
    - "quipper a scalable quantum programming language"
    - "theory of one tape linear time turing machines"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-4 (induced by source paper "an extended quantum process algebra eqpalg approach for distributed quantum systems"):
  with members:
    - "an axiomatization for quantum processes to unifying quantum and classical computing"
    - "toward an architecture for quantum programming"

Connected through hyperedge HE-5 (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"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-6 (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"
    - "applying quantitative semantics to higher order quantum computing"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows"):
  with members:
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "the best of both worlds linear functional programming without compromise"
    - "type classes for lightweight substructural types"
    - "a feasible algorithm for typing in elementary affine logic"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-8 (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"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

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)