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: "coupling techniques for reasoning about quantum programs"
  Abstract: Relational verification of quantum programs has many potential applications in security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), and equivalence of quantum random walks.

Connected through hyperedge HE-1 (induced by source paper "quantum temporal logic"):
  with members:
    - "quantitative robustness analysis of quantum programs"
    - "quipper a scalable quantum programming language"
    - "reachability and termination analysis of concurrent quantum programs"
    - "termination of nondeterministic quantum programs"
    - "verification of quantum programs"
    - "toward an architecture for quantum programming"

Connected through hyperedge HE-2 (induced by source paper "poq projection based runtime assertions for debugging on a quantum computer"):
  with members:
    - "relational proofs for quantum programs"
    - "quantitative robustness analysis of quantum programs"
    - "quantum temporal logic"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-3 (induced by source paper "reasoning about parallel quantum programs"):
  with members:
    - "quantitative robustness analysis of quantum programs"
    - "qwire practice formal verification of quantum circuits in coq"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "a theorem prover for quantum hoare logic and its applications"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"

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)