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: "quipper a scalable quantum programming language"
  Abstract: The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

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"
    - "formalization of quantum protocols using coq"

Connected through hyperedge HE-2 (induced by source paper "a fully abstract model for quantum controlled lambda calculus"):
  with members:
    - "realizability in the unitary sphere"
    - "the vectorial λ calculus"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "classically time controlled quantum automata definition and properties"):
  with members:
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "quantum finite automata a modern introduction"
    - "a lambda calculus for quantum computation with classical control"
    - "theory of one tape linear time turing machines"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-4 (induced by source paper "realizability in the unitary sphere"):
  with members:
    - "a concrete categorical semantics of lambda s"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "typing quantum superpositions and measurement"
    - "quantum alternation prospects and problems"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-5 (induced by source paper "a hott quantum equational theory extended version"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "homotopies for free"
    - "the hott library a formalization of homotopy type theory in coq"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "higher inductive types as homotopy initial algebras"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-6 (induced by source paper "quantum programming made easy"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "wave style token machines and quantum lambda calculi"
    - "applying quantitative semantics to higher order quantum computing"
    - "probabilistic operational semantics for the lambda calculus"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-7 (induced by source paper "quantum temporal logic"):
  with members:
    - "quantitative robustness analysis of quantum programs"
    - "coupling techniques for reasoning about quantum programs"
    - "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-8 (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"
    - "formalization of quantum protocols using coq"

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)