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: "proof rules for purely quantum programs"
  Abstract: AbstractWe apply the notion of quantumpredicate proposed by D’Hondt and Panangaden to analyzea purely quantum language fragment which describes the quantum part of a future quantumcomputer in Knill’s architecture. The denotational semantics, weakest precondition semantics,and weakest liberal precondition semantics of this language fragment are introduced. To helpreasoning about quantum programs involving quantum loops, we extend proof rules for classicalprobabilistic programs to our purely quantum programs. 1 Introduction The theory of quantum computing has attracted considerable research eﬀorts in the past twentyyears. Beneﬁting from the possibility of superposition of diﬀerent states and the linearity of quantumoperations, quantum computing may provide considerable speedup over its classical analogue [15, 6,7]. The existing quantum algorithms, however, are described at a very low level: they are usuallyrepresented as quantum circuits. A few works have been done in developing quantum programminglanguages which identify and promote high-level abstractions. Knill [8] moved the ﬁrst step byoutlining a set of basic principles for writing quantum pseudo-code; while the ﬁrst actual quantumprogramming language is due to Omer [12]. After that, Sanders and Zuliani [13], Bettelli et¨ al. [1],and Selinger [14] also proposed various quantum languages each having diﬀerent features.The standard weakest precondition calculus [4] and its probabilistic extension [11] have beensuccessful in reasoning about the correctness and even the rigorous derivation of classical programs.This success motivates us to develop analogous tools for quantum programs. Sanders and Zuliani[13] have provided for their qGCL a stepwise reﬁnement mechanics. The approach, however, isclassical in the sense that they treated quantum programs as special cases of probabilistic programs.As a consequence, known results about probabilistic weakest precondition calculus can be applieddirectly to quantum programs. Indeed, Butler and Hartel [2] have used it to reason about Grover’salgorithm.The ﬁrst step towards really quantum weakest precondition calculus was made by D’Hondt andPanangaden [3]. They proposed the brilliant idea that we can treat an observable, mathematicallydescribed by a Hermitian matrix, as the quantum analogue of ‘predicate’. The elegant dualitybetween state-transformer semantics and the weakest precondition semantics of quantum programswas then proven to hold in a more direct way.In this paper, we apply the ideas in [3] to analyze a purely quantum language fragment describingthe quantum part of a potential quantum computer in Knill’s architecture [8]. The syntax followsSelinger’s style but we consider only purely quantum data. We introduce the denotational semantics

Connected through hyperedge HE-1 (induced by source paper "termination of nondeterministic quantum programs"):
  with members:
    - "toward an architecture for quantum programming"

Connected through hyperedge HE-2 (induced by source paper "verification of quantum programs"):
  with members:
    - "reachability and termination analysis of concurrent 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.PL(Programming Languages)