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: "reqwire reasoning about reversible quantum circuits"
  Abstract: Common quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned to the |0> state before it is discarded, allowing for a range of optimizations. However, existing languages do not provide the tools to verify these assertions, introducing a potential source of errors. In this paper we present methods for verifying that ancillae are discarded in the desired state, and use these methods to implement a verified compiler from classical functions to quantum oracles.

Connected through hyperedge HE-1 (induced by source paper "toward certified quantum programming"):
  with members:
    - "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"
    - "quipper a scalable quantum programming language"

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

Connected through hyperedge HE-3 (induced by source paper "verified optimization in a quantum intermediate representation"):
  with members:
    - "quantitative robustness analysis of quantum programs"
    - "next steps in quantum computing computer science s role"
    - "qwire practice formal verification of quantum circuits in coq"
    - "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)