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: "journey beyond full abstraction exploring robust property preservation for secure compilation"
  Abstract: (CROPPED TO FIT IN ARXIV'S SILLY LIMIT. SEE PDF FOR COMPLETE ABSTRACT.) #R##N#We are the first to thoroughly explore a large space of formal secure compilation criteria based on robust property preservation, i.e., the preservation of properties satisfied against arbitrary adversarial contexts. We study robustly preserving various classes of trace properties such as safety, of hyperproperties such as noninterference, and of relational hyperproperties such as trace equivalence. This leads to many new secure compilation criteria, some of which are easier to practically achieve and prove than full abstraction, and some of which provide strictly stronger security guarantees. For each of the studied criteria we propose an equivalent "property-free" characterization that clarifies which proof techniques apply. For relational properties and hyperproperties, which relate the behaviors of multiple programs, our formal definitions of the property classes themselves are novel. We order our criteria by their relative strength and show several collapses and separation results. Finally, we adapt existing proof techniques to show that even the strongest of our secure compilation criteria, the robust preservation of all relational hyperproperties, is achievable for a simple translation from a statically typed to a dynamically typed language.

Connected through hyperedge HE-1 (induced by source paper "why should anyone use colours or syntax highlighting beyond code snippets"):
  with members:
    - "funtal reasonably mixing a functional language with assembly"

Connected through hyperedge HE-2 (induced by source paper "control flow flattening preserves the constant time policy extended version"):
  with members:
    - "robustly safe compilation or efficient provably secure compilation"

Connected through hyperedge HE-3 (induced by source paper "the next 700 relational program logics"):
  with members:
    - "synthetic topology in homotopy type theory for probabilistic programming"
    - "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"
    - "proof relevant logical relations for name generation"
    - "relational cost analysis for functional imperative programs"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "relational reasoning via probabilistic coupling"
    - "abstract effects and proof relevant logical relations"

Connected through hyperedge HE-4 (induced by source paper "exorcising spectres with secure compilers"):
  with members:
    - "towards constant time foundations for the new spectre era"
    - "speculative buffer overflows attacks and defenses"
    - "spectector principled detection of speculative information flows"
    - "you shall not bypass employing data dependencies to prevent bounds check bypass"
    - "spectre returns speculation attacks using the return stack buffer"
    - "ret2spec speculative execution using return stack buffers"
    - "a formally verified compiler back end"

Connected through hyperedge HE-5 (induced by source paper "trace relating compiler correctness and secure compilation"):
  with members:
    - "the last mile high assurance and high speed cryptographic implementations"
    - "interaction trees representing recursive and impure programs in coq work in progress"
    - "beyond good and evil formalizing the security guarantees of compartmentalizing compilation"
    - "a formally verified compiler back end"

Connected through hyperedge HE-6 (induced by source paper "data abstraction and relational program logic"):
  with members:
    - "a general framework for relational parametricity"
    - "two for the price of one lifting separation logic assertions"
    - "relational parametricity and separation logic"
    - "ownership confinement ensures representation independence for object oriented programs"

Connected through hyperedge HE-7 (induced by source paper "universal composability is secure compilation"):
  with members:
    - "a formally verified compiler back end"

Connected through hyperedge HE-8 (induced by source paper "weird machines as insecure compilation"):
  with members:
    - "trace relating compiler correctness and secure compilation"

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)