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: "verification of quantum programs"
  Abstract: This paper develops verification methodology for quantum programs, and the contribution of the paper is two-fold: 1. Sharir, Pnueli and Hart [SIAM J. Comput. 13(1984)292-314] presented a general method for proving properties of probabilistic programs, in which a probabilistic program is modeled by a Markov chain and an assertion on the output distribution is extended into an invariant assertion on all intermediate distributions. Their method is essentially a probabilistic generalization of the classical Floyd inductive assertion method. In this paper, we consider quantum programs modeled by quantum Markov chains which are defined by super-operators. It is shown that the Sharir-Pnueli-Hart method can be elegantly generalized to quantum programs by exploiting the Schr\"odinger-Heisenberg duality between quantum states and observables. In particular, a completeness theorem for the Sharir-Pnueli-Hart verification method of quantum programs is established. 2. As indicated by the completeness theorem, the Sharir-Pnueli-Hart method is in principle effective for verifying all properties of quantum programs that can be expressed in terms of Hermitian operators (observables). But it is not feasible for many practical applications because of the complicated calculation involved in the verification. For the case of finite-dimensional state spaces, we find a method for verification of quantum programs much simpler than the Sharir-Pnueli-Hart method by employing the matrix representation of super-operators and Jordan decomposition of matrices. In particular, this method enables us to compute easily the average running time and even to analyze some interesting long-run behaviors of quantum programs in a finite-dimensional state space.

Connected through hyperedge HE-1 (induced by source paper "relational proofs for quantum programs"):
  with members:
    - "quantum relational hoare logic with expectations"
    - "quantitative robustness analysis of quantum programs"
    - "proving expected sensitivity of probabilistic programs"
    - "proving uniformity and independence by self composition and coupling"
    - "probabilistic couplings for probabilistic reasoning"
    - "proving differential privacy via probabilistic couplings"
    - "relational reasoning via probabilistic coupling"
    - "toward automatic verification of quantum cryptographic protocols"

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

Connected through hyperedge HE-3 (induced by source paper "expected runtime of quantum programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-4 (induced by source paper "on hybrid models of quantum finite automata"):
  with members:
    - "on the state complexity of semi quantum finite automata"
    - "unbounded error quantum computation with small space bounds"
    - "decidability of the equivalence of multi letter quantum finite automata"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-5 (induced by source paper "un decidable problems about reachability of quantum systems"):
  with members:
    - "quipper a scalable quantum programming language"
    - "reachability and termination analysis of concurrent quantum programs"
    - "termination of nondeterministic quantum programs"

Connected through hyperedge HE-6 (induced by source paper "reachability and termination analysis of concurrent quantum programs"):
  with members:
    - "analysis of a quantum error correcting code using quantum process calculus"

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)