human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "proving uniformity and independence by self composition and coupling"
  Abstract: Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs and for verifying differential privacy. In this paper, we demonstrate that probabilistic couplings can be used for verifying non-relational probabilistic properties. Specifically, we show that the program logic pRHL---whose proofs are formal versions of proofs by coupling---can be used for formalizing uniformity and probabilistic independence. We formally verify our main examples using the EasyCrypt proof assistant.

Connected through hyperedge HE-1 (induced by source paper "relational proofs for quantum programs"):
  with members:
    - "quantum relational hoare logic with expectations"
    - "quantitative robustness analysis of quantum programs"
    - "proving expected sensitivity of probabilistic programs"
    - "probabilistic couplings for probabilistic reasoning"
    - "proving differential privacy via probabilistic couplings"
    - "relational reasoning via probabilistic coupling"
    - "toward automatic verification of quantum cryptographic protocols"
    - "verification of quantum programs"

Connected through hyperedge HE-2 (induced by source paper "a probabilistic separation logic"):
  with members:
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "more is less perfectly secure oblivious algorithms in the multi server setting"
    - "an assertion based program logic for probabilistic programs"
    - "a separation logic for concurrent randomized programs"
    - "the beta bernoulli process and algebraic effects"
    - "a domain theory for statistical probabilistic programming"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "a language for probabilistically oblivious computation"

Connected through hyperedge HE-3 (induced by source paper "relational reasoning for markov chains in a probabilistic guarded lambda calculus"):
  with members:
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "guarded dependent type theory with coinductive types"
    - "differentially private bayesian programming"
    - "relational reasoning via probabilistic coupling"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-4 (induced by source paper "a separation logic for concurrent randomized programs"):
  with members:
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "quantitative separation logic"
    - "coupling proofs are probabilistic product programs"
    - "a higher order logic for concurrent termination preserving refinement"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "relational reasoning via probabilistic coupling"
    - "step indexed logical relations for probability"

Connected through hyperedge HE-5 (induced by source paper "constraint based synthesis of coupling proofs"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "synthesizing coupling proofs of differential privacy"
    - "proving expected sensitivity of probabilistic programs"
    - "coupling proofs are probabilistic product programs"
    - "probabilistic couplings for probabilistic reasoning"
    - "advanced probabilistic couplings for differential privacy"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "proving differential privacy via probabilistic couplings"

Connected through hyperedge HE-6 (induced by source paper "synthesizing coupling proofs of differential privacy"):
  with members:
    - "a semantic account of metric preservation"
    - "liftings for differential privacy"
    - "coupling proofs are probabilistic product programs"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"
    - "advanced probabilistic couplings for differential privacy"
    - "understanding the sparse vector technique for differential privacy"
    - "approximate relational hoare logic for continuous random samplings"

Connected through hyperedge HE-7 (induced by source paper "a language for probabilistically oblivious computation"):
  with members:
    - "trace abstraction modulo probability"
    - "coupling proofs are probabilistic product programs"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "privacy preserving data oblivious geometric algorithms for geographic data"

Question: Please tell me which class the center node 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)