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 "a monadic framework for relational verification applied to information security program equivalence and optimizations"):
  Abstract: Relational properties describe multiple runs of one or more programs. They characterize many useful notions of security, program refinement, and equivalence for programs with diverse computational effects, and they have received much attention in the recent literature. Rather than developing separate tools for special classes of effects and relational properties, we advocate using a general purpose proof assistant as a unifying framework for the relational verification of effectful programs. The essence of our approach is to model effectful computations using monads and to prove relational properties on their monadic representations, making the most of existing support for reasoning about pure programs. #R##N#We apply this method in F* and evaluate it by encoding a variety of relational program analyses, including information flow control, program equivalence and refinement at higher order, correctness of program optimizations and game-based cryptographic security. By relying on SMT-based automation, unary weakest preconditions, user-defined effects, and monadic reification, we show that, compared to unary properties, verifying relational properties requires little additional effort from the F* programmer.

Includes members:
  Member "proof relevant logical relations for name generation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the next 700 relational program logics")
  Member "hypercollecting semantics and its application to static analysis of information flow":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "whither programs as specifications")
  Member "lightdp towards automating differential privacy proofs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "language integrated provenance":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "language integrated provenance by trace analysis")
  Member "higher order approximate relational refinement types for mechanism design and differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "the foundational cryptography framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a formal proof of pac learnability for decision stumps")
  Member "abstract effects and proof relevant logical relations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem")
  Member "quantitative information flow as safety and liveness hyperproperties":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")

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)