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 "synthesizing coupling proofs of differential privacy"):
  Abstract: Differential privacy has emerged as a promising probabilistic formulation of privacy, generating intense interest within academia and industry. We present a push-button, automated technique for verifying e-differential privacy of sophisticated randomized algorithms. We make several conceptual, algorithmic, and practical contributions: (i) Inspired by the recent advances on approximate couplings and randomness alignment, we present a new proof technique called coupling strategies, which casts differential privacy proofs as a winning strategy in a game where we have finite privacy resources to expend. (ii) To discover a winning strategy, we present a constraint-based formulation of the problem as a set of Horn modulo couplings (HMC) constraints, a novel combination of first-order Horn clauses and probabilistic constraints. (iii) We present a technique for solving HMC constraints by transforming probabilistic constraints into logical constraints with uninterpreted functions. (iv) Finally, we implement our technique in the FairSquare verifier and provide the first automated privacy proofs for a number of challenging algorithms from the differential privacy literature, including Report Noisy Max, the Exponential Mechanism, and the Sparse Vector Mechanism.

Includes members:
  Member "proving uniformity and independence by self composition and coupling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relational proofs for quantum programs")
  Member "a semantic account of metric preservation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "duet an expressive higher order language and linear type system for statically enforcing differential privacy")
  Member "liftings for differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate span liftings compositional semantics for relaxations of differential privacy")
  Member "coupling proofs are probabilistic product programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "lightdp towards automating differential privacy proofs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "probabilistic couplings for probabilistic reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relational proofs for quantum programs")
  Member "advanced probabilistic couplings for differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "understanding the sparse vector technique for differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private and communication efficient edge learning a sparse differential gaussian masking distributed sgd approach")

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)