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: "memory tagging and how it improves c c memory safety"
  Abstract: Memory safety in C and C++ remains largely unresolved. A technique usually called "memory tagging" may dramatically improve the situation if implemented in hardware with reasonable overhead. This paper describes two existing implementations of memory tagging: one is the full hardware implementation in SPARC; the other is a partially hardware-assisted compiler-based tool for AArch64. We describe the basic idea, evaluate the two implementations, and explain how they improve memory safety. This paper is intended to initiate a wider discussion of memory tagging and to motivate the CPU and OS vendors to add support for it in the near future.

Connected through hyperedge HE-1 (induced by source paper "ptauth temporal memory safety via robust points to authentication"):
  with members:
    - "cup comprehensive user space protection for c c"
    - "pac it up towards pointer integrity using arm pointer authentication"
    - "freeguard a faster secure heap allocator"

Connected through hyperedge HE-2 (induced by source paper "dangkiller eliminating dangling pointers efficiently via implicit identifier"):
  with members:
    - "effectivesan type and memory error detection using dynamically typed c c"
    - "intel mpx explained an empirical study of intel mpx and software based bounds checking approaches"

Connected through hyperedge HE-3 (induced by source paper "deciding memory safety for single pass heap manipulating programs"):
  with members:
    - "what s decidable about program verification modulo axioms"
    - "decidable synthesis of programs with uninterpreted functions"
    - "a first order logic with frames"
    - "decidable verification of uninterpreted programs"
    - "invariant synthesis for incomplete verification engines"

Connected through hyperedge HE-4 (induced by source paper "practical byte granular memory blacklisting using califorms"):
  with members:
    - "sok sanitizing for security"
    - "spectre attacks exploiting speculative execution"
    - "effectivesan type and memory error detection using dynamically typed c c"

Connected through hyperedge HE-5 (induced by source paper "pac it up towards pointer integrity using arm pointer authentication"):
  with members:
    - "dr sgx automated and adjustable side channel protection for sgx using data location randomization"
    - "cfi care hardware supported call and return enforcement for commercial microcontrollers"
    - "intel mpx explained an empirical study of intel mpx and software based bounds checking approaches"
    - "hardscope thwarting dop with hardware assisted run time scope enforcement"
    - "inferring fine grained control flow inside sgx enclaves with branch shadowing"

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)