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: "qwire practice formal verification of quantum circuits in coq"
  Abstract: We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The implementation uses higher-order abstract syntax to represent variable binding and provides a type-checking algorithm for linear wire types, ensuring that quantum circuits are well-formed. We formalize a denotational semantics that interprets QWIRE circuits as superoperators on density matrices, and prove the correctness of some simple quantum programs.

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"
    - "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"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-2 (induced by source paper "formal verification of cyber physical systems using theorem proving invited paper"):
  with members:
    - "formal analysis of robotic cell injection systems using theorem proving"
    - "formal analysis of linear control systems using theorem proving"
    - "formal analysis of continuous time systems using fourier transform"
    - "formalization of transform methods using hol light"
    - "towards formal fault tree analysis using theorem proving"
    - "a verified compiler for probability density functions"
    - "towards the formal reliability analysis of oil and gas pipelines"
    - "formal analysis of optical systems"

Connected through hyperedge HE-3 (induced by source paper "a survey on theorem provers in formal methods"):
  with members:
    - "comparison of two theorem provers isabelle hol and coq"
    - "the boyer moore waterfall model revisited"
    - "reinforcement learning of theorem proving"
    - "proofwatch watchlist guidance for large theories in e"
    - "verifying asymptotic time complexity of imperative programs in isabelle"
    - "formalized lambek calculus in higher order logic hol4"
    - "the x86isa books features usage and future plans"
    - "constraint solving for finite model finding in smt solvers"

Connected through hyperedge HE-4 (induced by source paper "a hott quantum equational theory extended version"):
  with members:
    - "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"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-5 (induced by source paper "quantum programming made easy"):
  with members:
    - "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"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-6 (induced by source paper "a verified optimizer for quantum circuits"):
  with members:
    - "reqwire reasoning about reversible quantum circuits"
    - "next steps in quantum computing computer science s role"
    - "quantomatic a proof assistant for diagrammatic reasoning"
    - "formalization of quantum protocols using coq"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-7 (induced by source paper "verified optimization in a quantum intermediate representation"):
  with members:
    - "reqwire reasoning about reversible quantum circuits"
    - "quantitative robustness analysis of quantum programs"
    - "next steps in quantum computing computer science s role"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-8 (induced by source paper "reqwire reasoning about reversible quantum circuits"):
  with members:
    - "quipper a scalable quantum programming language"
    - "an introduction to quantum programming in quipper"

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)