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 "relational proofs for quantum programs"):
  Abstract: Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), equivalence of quantum walks and security of quantum one-time pad.

Includes members:
  Member "quantum relational hoare logic with expectations":
    also connected through other hyperedges:
      (none)
  Member "quantitative robustness analysis of quantum programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantum temporal logic")
  Member "proving expected sensitivity of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "proving uniformity and independence by self composition and coupling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a probabilistic separation logic")
  Member "probabilistic couplings for probabilistic reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fuzzi a three level logic for differential privacy")
  Member "proving differential privacy via probabilistic couplings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "relational reasoning via probabilistic coupling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the next 700 relational program logics")
  Member "toward automatic verification of quantum cryptographic protocols":
    also connected through other hyperedges:
      (none)

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)