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 "reasoning about parallel quantum programs"):
  Abstract: We initiate the study of parallel quantum programming by defining the operational and denotational semantics of parallel quantum programs. The technical contributions of this paper include: (1) find a series of useful proof rules for reasoning about correctness of parallel quantum programs; and (2) prove a strong soundness theorem of these proof rules showing that partial correctness is well maintained at each step of transitions in the operational semantics of a parallel quantum program. This is achieved by partially overcoming the following conceptual challenges that are never present in classical parallel programming: (i) the intertwining of nondeterminism caused by quantum measurements and introduced by parallelism; (ii) entanglement between component quantum programs; and (iii) combining quantum predicates in the overlap of state Hilbert spaces of component quantum programs with shared variables. It seems that a full solution to these challenges and developing a (relatively) complete proof system for parallel quantum programs are still far beyond the current reach.

Includes members:
  Member "quantitative robustness analysis of quantum programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relational proofs for quantum programs")
  Member "coupling techniques for reasoning about quantum programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantum temporal logic")
  Member "qwire practice formal verification of quantum circuits in coq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward certified quantum programming")
  Member "semantics of higher order quantum computation via geometry of interaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a hott quantum equational theory extended version")
  Member "a theorem prover for quantum hoare logic and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward certified quantum programming")
  Member "quipper a scalable quantum programming language":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward certified quantum programming")
  Member "applying quantitative semantics to higher order quantum computing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")

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.LO(Logic in Computer Science)