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: "formalization of quantum protocols using coq"
  Abstract: Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of practical, general purpose Quantum Computers may be some years into the future. However, Quantum Communication and Quantum Cryptography are well developed. Commercial Quantum Key Distribution systems are easily available and several QKD networks have been built in various parts of the world. The security of the protocols used in these implementations rely on information-theoretic proofs, which may or may not reflect actual system behaviour. Moreover, testing of implementations cannot guarantee the absence of bugs and errors. This paper presents a novel framework for modelling and verifying quantum protocols and their implementations using the proof assistant Coq. We provide a Coq library for quantum bits (qubits), quantum gates, and quantum measurement. As a step towards verifying practical quantum communication and security protocols such as Quantum Key Distribution, we support multiple qubits, communication and entanglement. We illustrate these concepts by modelling the Quantum Teleportation Protocol, which communicates the state of an unknown quantum bit using only a classical channel.

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

Connected through hyperedge HE-2 (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"
    - "qwire practice formal verification of quantum circuits in coq"
    - "quantomatic a proof assistant for diagrammatic reasoning"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-3 (induced by source paper "a theorem prover for quantum hoare logic and its applications"):
  with members:
    - "un decidable problems about reachability of quantum systems"
    - "quipper a scalable quantum programming language"
    - "termination of nondeterministic quantum programs"
    - "toward an architecture for quantum programming"

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)