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: "automatic generation of adversarial examples for interpreting malware classifiers"
  Abstract: Recent advances in adversarial attacks have shown that machine learning#N#classifiers based on static analysis are vulnerable to adversarial attacks.#N#However, real-world antivirus systems do not rely only on static classifiers,#N#thus many of these static evasions get detected by dynamic analysis whenever#N#the malware runs. The real question is to what extent these adversarial attacks#N#are actually harmful to the real users? In this paper, we propose a systematic#N#framework to create and evaluate realistic adversarial malware to evade#N#real-world systems. We propose new adversarial attacks against real-world#N#antivirus systems based on code randomization and binary manipulation, and use#N#our framework to perform the attacks on 1000 malware samples and test four#N#commercial antivirus software and two open-source classifiers. We demonstrate#N#that the static detectors of real-world antivirus can be evaded 24.3%-41.9% of#N#the cases and often by changing only one byte. We also find that the#N#adversarial attacks are transferable between different antivirus up to 16% of#N#the cases. We also tested the efficacy of the complete (i.e. static + dynamic)#N#classifiers in protecting users. While most of the commercial antivirus use#N#their dynamic engines to protect the users' device when the static classifiers#N#are evaded, we are the first to demonstrate that for one commercial antivirus,#N#static evasions can also evade the offline dynamic detectors and infect users'#N#machines. Our framework can also help explain which features are responsible#N#for evasion and thus can help improve the robustness of malware detectors.

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)