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 "the next 700 relational program logics"):
  Abstract: We propose the first framework for defining relational program logics for arbitrary monadic effects. The framework is embedded within a relational dependent type theory and is highly expressive. At the semantic level, we provide an algebraic characterization for relational specifications as a class of relative monads, and link computations and specifications by introducing relational effect observations, which map pairs of monadic computations to relational specifications in a way that respects the algebraic structure. For an arbitrary relational effect observation, we generically define the core of a sound relational program logic, and explain how to complete it to a full-fledged logic for the monadic effect at hand. We show that by instantiating our framework with state and unbounded iteration we can embed a variant of Benton's Relational Hoare Logic, and also sketch how to reconstruct Relational Hoare Type Theory. Finally, we identify and overcome conceptual challenges that prevented previous relational program logics from properly dealing with effects such as exceptions, and are the first to provide a proper semantic foundation and a relational program logic for exceptions.

Includes members:
  Member "synthetic topology in homotopy type theory for probabilistic programming":
    also connected through other hyperedges:
      (none)
  Member "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the geometry of bayesian programming")
  Member "journey beyond full abstraction exploring robust property preservation for secure compilation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "why should anyone use colours or syntax highlighting beyond code snippets")
  Member "proof relevant logical relations for name generation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a monadic framework for relational verification applied to information security program equivalence and optimizations")
  Member "relational cost analysis for functional imperative programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "coupling proofs are probabilistic product programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "a relational logic for higher order programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "operationally based program equivalence proofs using lctrss")
  Member "relational reasoning via probabilistic coupling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relational proofs for quantum programs")

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)