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: "lightdp towards automating differential privacy proofs"
  Abstract: The growing popularity and adoption of differential privacy in academic and industrial settings has resulted in the development of increasingly sophisticated algorithms for releasing information while preserving privacy. Accompanying this phenomenon is the natural rise in the development and publication of incorrect algorithms, thus demonstrating the necessity of formal verification tools. However, existing formal methods for differential privacy face a dilemma: methods based on customized logics can verify sophisticated algorithms but come with a steep learning curve and significant annotation burden on the programmers, while existing programming platforms lack expressive power for some sophisticated algorithms.     In this paper, we present LightDP, a simple imperative language that strikes a better balance between expressive power and usability. The core of LightDP is a novel relational type system that separates relational reasoning from privacy budget calculations. With dependent types, the type system is powerful enough to verify sophisticated algorithms where the composition theorem falls short. In addition, the inference engine of LightDP infers most of the proof details, and even searches for the proof with minimal privacy cost when multiple proofs exist. We show that LightDP verifies sophisticated algorithms with little manual effort.

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 "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-3 (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-4 (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"
    - "advanced probabilistic couplings for differential privacy"
    - "concentrated differential privacy simplifications extensions and lower bounds"

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

Connected through hyperedge HE-6 (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"
    - "probabilistic couplings for probabilistic reasoning"
    - "psi ψ a private data sharing interface"

Connected through hyperedge HE-7 (induced by source paper "the complexity of verifying loop free programs as differentially private"):
  with members:
    - "automated methods for checking differential privacy"
    - "property testing for differential privacy"
    - "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"
    - "proving differential privacy via probabilistic couplings"
    - "the complexity of computing the optimal composition of differential privacy"

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

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)