human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "toward certified quantum programming"):
  Abstract: While recent progress in quantum hardware open the door for significant speedup in certain key areas, quantum algorithms are still hard to implement right, and the validation of such quantum programs is a challenge. Early attempts either suffer from the lack of automation or parametrized reasoning, or require the user to write specifications and algorithms far from those presented in research articles or textbooks, and as a consequence, no significant quantum algorithm implementation has been currently verified in a scale-invariant manner. We propose QBRICKS, the first development environment for certified quantum programs featuring clear separation between code and proof, scale-invariance specification and proof, high degree of proof automation and allowing to encode quantum programs in a natural way, i.e. close to textbook style. This environment features a new domain-specific language for quantum programs, namely QBRICKS-DSL, together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics, used for both specification (parametrized, versatile) and automation (closure properties). QBRICKS builds on best practice of formal verification for the classic case and tailor them to the quantum case. To illustrate the opportunity of QBRICKS , we implement the first scale-invariant verified implementations of non-trivial quantum algorithms, namely phase estimation (QPE) -- the purely quantum part of Shor algorithm for integer factoring -- and Grover search. It proves by fact that applying formal verification to real quantum programs is possible and should be further developed.

Includes members:
  Member "reqwire reasoning about reversible quantum circuits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a verified optimizer for quantum circuits")
  Member "qdb from quantum algorithms towards correct quantum programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on testing quantum programs")
  Member "a verified optimizer for quantum circuits":
    also connected through other hyperedges:
      (none)
  Member "qwire practice formal verification of quantum circuits in coq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "formal verification of cyber physical systems using theorem proving invited paper")
  Member "qpcf higher order languages and quantum circuits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantum programming made easy")
  Member "a theorem prover for quantum hoare logic and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reasoning about parallel quantum programs")
  Member "quantomatic a proof assistant for diagrammatic reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a framework for rewriting families of string diagrams")
  Member "formalization of quantum protocols using coq":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a verified optimizer for quantum circuits")

Question: Please tell me which class the source paper 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)