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: "robust hyperproperty preservation for secure compilation extended abstract"
  Abstract: We map the space of soundness criteria for secure compilation based on the preservation of hyperproperties in arbitrary adversarial contexts, which we call robust hyperproperty preservation. For this, we study the preservation of several classes of hyperproperties and for each class we propose an equivalent "property-free" characterization of secure compilation that is generally better tailored for proofs. Even the strongest of our soundness criteria, the robust preservation of all hyperproperties, seems achievable for simple transformations and provable using context back-translation techniques previously developed for showing fully abstract compilation. While proving the robust preservation of hyperproperties that are not safety requires such powerful context back-translation techniques, for preserving safety hyperproperties robustly, translating each finite trace prefix back to a source context seems to suffice.

Connected through hyperedge HE-1 (induced by source paper "when good components go bad formally secure compilation despite dynamic compromise"):
  with members:
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "effectivesan type and memory error detection using dynamically typed c c"
    - "the meaning of memory safety"
    - "modular fully abstract compilation by approximate back translation"
    - "beyond good and evil formalizing the security guarantees of compartmentalizing compilation"
    - "towards a fully abstract compiler using micro policies secure compilation for mutually distrustful components"

Connected through hyperedge HE-2 (induced by source paper "robustly safe compilation or efficient provably secure compilation"):
  with members:
    - "trace relating compiler correctness and secure compilation"
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "modular fully abstract compilation by approximate back translation"
    - "beyond good and evil formalizing the security guarantees of compartmentalizing compilation"
    - "a formally verified compiler back end"

Connected through hyperedge HE-3 (induced by source paper "software fault isolation for robust compilation"):
  with members:
    - "formally secure compilation of unsafe low level components extended abstract"
    - "beyond good and evil formalizing the security guarantees of compartmentalizing compilation"
    - "towards a fully abstract compiler using micro policies secure compilation for mutually distrustful components"

Connected through hyperedge HE-4 (induced by source paper "formally secure compilation of unsafe low level components extended abstract"):
  with members:
    - "beyond good and evil formalizing the security guarantees of compartmentalizing 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.CR(Cryptography and Security)