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: "toward an architecture for quantum programming"
  Abstract: It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives. The underlying scheme involves a run-time environment which calculates the byte-code for the quantum operations and pipes it to a quantum device controller or to a simulator. This language can compactly express existing quantum algorithms and reduce them to sequences of elementary operations; it also easily lends itself to automatic, hardware independent, circuit simplification. A publicly available preliminary implementation of the proposed ideas has been realised using the language.

Connected through hyperedge HE-1 (induced by source paper "an extended quantum process algebra eqpalg approach for distributed quantum systems"):
  with members:
    - "an axiomatization for quantum processes to unifying quantum and classical computing"
    - "a lambda calculus for quantum computation with classical control"

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"
    - "verification of quantum programs"

Connected through hyperedge HE-3 (induced by source paper "qpcf higher order languages and quantum circuits"):
  with members:
    - "quantum programming made easy"
    - "formalization of metatheory of the quipper quantum programming language in a linear logic"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "wave style token machines and quantum lambda calculi"
    - "full abstraction for probabilistic pcf"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-4 (induced by source paper "qumin a minimalist quantum programming language"):
  with members:
    - "syntax and semantics of linear dependent types"
    - "a survey of quantum programming languages history methods and tools"
    - "a lambda calculus for quantum computation with classical control"

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

Connected through hyperedge HE-6 (induced by source paper "termination of nondeterministic quantum programs"):
  with members:
    - "proof rules for purely quantum programs"

Connected through hyperedge HE-7 (induced by source paper "verification of quantum programs"):
  with members:
    - "reachability and termination analysis of concurrent quantum programs"
    - "proof rules for purely quantum programs"

Connected through hyperedge HE-8 (induced by source paper "qis xml an extensible markup language for quantum information science"):
  with members:
    - "cove a practical quantum computer programming framework"

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)