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: "automated detection exploitation and elimination of double fetch bugs using modern cpu features"
  Abstract: Double-fetch bugs are a special type of race condition, where an unprivileged execution thread is able to change a memory location between the time-of-check and time-of-use of a privileged execution thread. If an unprivileged attacker changes the value at the right time, the privileged operation becomes inconsistent, leading to a change in control flow, and thus an escalation of privileges for the attacker. More severely, such double-fetch bugs can be introduced by the compiler, entirely invisible on the source-code level. #R##N#We propose novel techniques to efficiently detect, exploit, and eliminate double-fetch bugs. We demonstrate the first combination of state-of-the-art cache attacks with kernel-fuzzing techniques to allow fully automated identification of double fetches. We demonstrate the first fully automated reliable detection and exploitation of double-fetch bugs, making manual analysis as in previous work superfluous. We show that cache-based triggers outperform state-of-the-art exploitation techniques significantly, leading to an exploitation success rate of up to 97%. Our modified fuzzer automatically detects double fetches and automatically narrows down this candidate set for double-fetch bugs to the exploitable ones. We present the first generic technique based on hardware transactional memory, to eliminate double-fetch bugs in a fully automated and transparent manner. We extend defensive programming techniques by retrofitting arbitrary code with automated double-fetch prevention, both in trusted execution environments as well as in syscalls, with a performance overhead below 1%.

Connected through hyperedge HE-1 (induced by source paper "zombieload cross privilege boundary data sampling"):
  with members:
    - "smotherspectre exploiting speculative execution through port contention"
    - "fallout reading kernel writes from user space"
    - "store to leak forwarding leaking data on meltdown resistant cpus"
    - "spoiler speculative load hazards boost rowhammer and cache attacks"
    - "speculative buffer overflows attacks and defenses"
    - "netspectre read arbitrary memory over network"
    - "spectector principled detection of speculative information flows"
    - "spectre attacks exploiting speculative execution"

Connected through hyperedge HE-2 (induced by source paper "netspectre read arbitrary memory over network"):
  with members:
    - "meltdownprime and spectreprime automatically synthesized attacks exploiting invalidation based coherence protocols"
    - "spectre attacks exploiting speculative execution"
    - "speculose analyzing the security implications of speculative execution in cpus"
    - "inferring fine grained control flow inside sgx enclaves with branch shadowing"
    - "armageddon cache attacks on mobile devices"
    - "airhopper bridging the air gap between isolated networks and mobile phones using radio frequencies"

Connected through hyperedge HE-3 (induced by source paper "the art science and engineering of fuzzing a survey"):
  with members:
    - "fairfuzz a targeted mutation strategy for increasing greybox fuzz testing coverage"
    - "evaluating fuzz testing"
    - "stads software testing as species discovery"
    - "angora efficient fuzzing by principled search"
    - "learn fuzz machine learning for input fuzzing"
    - "synthesizing program input grammars"

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)