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: "relational symbolic execution"
  Abstract: Symbolic execution is a classical program analysis technique, widely used for program testing and bug finding. In this work we generalize symbolic execution to support program analysis for relational properties, namely properties about two programs, or about two executions of a single program on different inputs. We design a relational symbolic execution engine, named RelSym, which supports testing and bug finding for relational properties of imperative programs with for-loops and arrays. RelSym also combines relational symbolic execution with program logics. This combination is useful not only to test but also to prove relational properties, by exploiting the finite structure of arrays and for-loops. We demonstrate the flexibility of RelSym by testing and proving relational properties for examples from different domains, such as information flow, program equivalence, sensitivity analysis, and relational cost analysis.

Connected through hyperedge HE-1 (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"
    - "renyi differential privacy"
    - "towards practical differential privacy for sql queries"
    - "lightdp towards automating differential privacy proofs"
    - "advanced probabilistic couplings for differential privacy"

Connected through hyperedge HE-2 (induced by source paper "binsec rel efficient relational symbolic execution for constant time at binary level"):
  with members:
    - "get rid of inline assembly through verification oriented lifting"
    - "symbolic verification of cache side channel freedom"
    - "eliminating timing side channel leaks using program repair"
    - "microwalk a framework for finding side channels in binaries"
    - "time protection the missing os abstraction"
    - "a software approach to defeating side channels in last level caches"
    - "rigorous analysis of software countermeasures against cache attacks"

Connected through hyperedge HE-3 (induced by source paper "detecting violations of differential privacy"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "renyi differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "advanced probabilistic couplings for differential privacy"
    - "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"

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)