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 differential privacy via probabilistic couplings"
  Abstract: Over the last decade, differential privacy has achieved widespread adoption within the privacy community. Moreover, it has attracted significant attention from the verification community, resulting in several successful tools for formally proving differential privacy. Although their technical approaches vary greatly, all existing tools rely on reasoning principles derived from the composition theorem of differential privacy. While this suffices to verify most common private algorithms, there are several important algorithms whose privacy analysis does not rely solely on the composition theorem. Their proofs are significantly more complex, and are currently beyond the reach of verification tools.   In this paper, we develop compositional methods for formally verifying differential privacy for algorithms whose analysis goes beyond the composition theorem. Our methods are based on deep connections between differential privacy and probabilistic couplings, an established mathematical tool for reasoning about stochastic processes. Even when the composition theorem is not helpful, we can often prove privacy by a coupling argument.   We demonstrate our methods on two algorithms: the Exponential mechanism and the Above Threshold algorithm, the critical component of the famous Sparse Vector algorithm. We verify these examples in a relational program logic apRHL+, which can construct approximate couplings. This logic extends the existing apRHL logic with more general rules for the Laplace mechanism and the one-sided Laplace mechanism, and new structural rules enabling pointwise reasoning about privacy; all the rules are inspired by the connection with coupling. While our paper is presented from a formal verification perspective, we believe that its main insight is of independent interest for the differential privacy community.

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 "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"
    - "proving uniformity and independence by self composition and coupling"
    - "probabilistic couplings for probabilistic reasoning"
    - "relational reasoning via probabilistic coupling"
    - "toward automatic verification of quantum cryptographic protocols"
    - "verification of quantum programs"

Connected through hyperedge HE-3 (induced by source paper "free gap information from the differentially private sparse vector and noisy max mechanisms"):
  with members:
    - "proving differential privacy with shadow execution"
    - "private selection from private candidates"
    - "amplification by shuffling from local to central differential privacy via anonymity"
    - "ektelo a framework for defining differentially private computations"
    - "privacy loss in apple s implementation of differential privacy on macos 10 12"
    - "synthesizing coupling proofs of differential privacy"
    - "renyi differential privacy"
    - "towards practical differential privacy for sql queries"

Connected through hyperedge HE-4 (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-5 (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"
    - "advanced probabilistic couplings for differential privacy"

Connected through hyperedge HE-6 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "perfect half space games"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"
    - "complexity hierarchies beyond elementary"

Connected through hyperedge HE-7 (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-8 (induced by source paper "fuzzi a three level logic for differential privacy"):
  with members:
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "ektelo a framework for defining differentially private computations"
    - "detecting violations of differential privacy"
    - "synthesizing coupling proofs of differential privacy"
    - "learning differentially private recurrent language models"
    - "towards practical differential privacy for sql queries"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"

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)