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: "advanced probabilistic couplings for differential privacy"
  Abstract: Differential privacy is a promising formal approach to data privacy, which provides a quantitative bound on the privacy cost of an algorithm that operates on sensitive information. Several tools have been developed for the formal verification of differentially private algorithms, including program logics and type systems. However, these tools do not capture fundamental techniques that have emerged in recent years, and cannot be used for reasoning about cutting-edge differentially private algorithms. Existing techniques fail to handle three broad classes of algorithms: 1) algorithms where privacy depends on accuracy guarantees, 2) algorithms that are analyzed with the advanced composition theorem, which shows slower growth in the privacy cost, 3) algorithms that interactively accept adaptive inputs.   We address these limitations with a new formalism extending apRHL, a relational program logic that has been used for proving differential privacy of non-interactive algorithms, and incorporating aHL, a (non-relational) program logic for accuracy properties. We illustrate our approach through a single running example, which exemplifies the three classes of algorithms and explores new variants of the Sparse Vector technique, a well-studied algorithm from the privacy literature. We implement our logic in EasyCrypt, and formally verify privacy. We also introduce a novel coupling technique called optimal subset coupling that may be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "guidelines for implementing and auditing differentially private systems"):
  with members:
    - "differentially private objective perturbation beyond smoothness and convexity"
    - "identifying cache based side channels through secret augmented abstract interpretation"
    - "fuzzi a three level logic for differential privacy"
    - "an economic analysis of privacy protection and statistical accuracy as social choices"
    - "private selection from private candidates"
    - "ektelo a framework for defining differentially private computations"
    - "detecting violations of differential privacy"
    - "how to use heuristics for differential privacy"

Connected through hyperedge HE-2 (induced by source paper "duet an expressive higher order language and linear type system for statically enforcing differential privacy"):
  with members:
    - "fuzzi a three level logic for differential privacy"
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "bidirectional type checking for relational properties"
    - "probabilistic relational reasoning via metrics"
    - "subsampled r enyi differential privacy and analytical moments accountant"
    - "renyi differential privacy"
    - "a semantic account of metric preservation"
    - "towards practical differential privacy for sql queries"

Connected through hyperedge HE-3 (induced by source paper "a programming framework for differential privacy with accuracy concentration bounds"):
  with members:
    - "fuzzi a three level logic for differential privacy"
    - "proving differential privacy with shadow execution"
    - "ektelo a framework for defining differentially private computations"
    - "synthesizing coupling proofs of differential privacy"
    - "apex accuracy aware differentially private data exploration"
    - "renyi differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "concentrated differential privacy simplifications extensions and lower bounds"

Connected through hyperedge HE-4 (induced by source paper "proving differential privacy with shadow execution"):
  with members:
    - "property testing for differential privacy"
    - "ektelo a framework for defining differentially private computations"
    - "detecting violations of differential privacy"
    - "synthesizing coupling proofs of differential privacy"
    - "relational symbolic execution"
    - "renyi differential privacy"
    - "towards practical differential privacy for sql queries"
    - "lightdp towards automating differential privacy proofs"

Connected through hyperedge HE-5 (induced by source paper "approximate span liftings compositional semantics for relaxations of differential privacy"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "renyi differential privacy"
    - "liftings for differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "concentrated differential privacy simplifications extensions and lower bounds"
    - "approximate relational hoare logic for continuous random samplings"
    - "differentially private bayesian programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-6 (induced by source paper "automated methods for checking differential privacy"):
  with members:
    - "bisimilarity distances for approximate differential privacy"
    - "detecting violations of differential privacy"
    - "synthesizing coupling proofs of differential privacy"
    - "understanding the sparse vector technique for differential privacy"
    - "a program logic for union bounds"
    - "proving differential privacy via probabilistic couplings"
    - "calibrating data to sensitivity in private data analysis"
    - "iterative constructions and private data release"

Connected through hyperedge HE-7 (induced by source paper "detecting violations of differential privacy"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "relational symbolic execution"
    - "renyi differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "understanding the sparse vector technique for differential privacy"
    - "concentrated differential privacy simplifications extensions and lower bounds"
    - "concentrated differential privacy"
    - "proving differential privacy via probabilistic couplings"

Connected through hyperedge HE-8 (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"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "probabilistic couplings for probabilistic reasoning"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "proving differential privacy via probabilistic couplings"

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.LO(Logic in Computer Science)