human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "saturn software deobfuscation framework based on llvm"):
  Abstract: The strength of obfuscated software has increased over the recent years. Compiler based obfuscation has become the de facto standard in the industry and recent papers also show that injection of obfuscation techniques is done at the compiler level. In this paper we discuss a generic approach for deobfuscation and recompilation of obfuscated code based on the compiler framework \textit{LLVM}. We show how binary code can be lifted back into the compiler intermediate language \textit{LLVM-IR} and explain how we recover the control flow graph of an obfuscated binary function with an iterative control flow graph construction algorithm \cite{biondi:hal-01241356} based on compiler optimizations and SMT solving. Our approach does not make any assumptions about the obfuscated code, but instead uses strong compiler optimizations available in \textit{LLVM} and \textit{Souper Optimizer} to simplify away the obfuscation. Our experimental results show that this approach can be effective to weaken or even remove the applied obfuscation techniques like constant unfolding, certain arithmetic-based opaque expressions, dead code insertions, bogus control flow or integer encoding found in public and commercial obfuscators. The recovered \textit{LLVM-IR} can be further processed by custom deobfuscation passes that are now applied at the same level as the injected obfuscation techniques or recompiled with one of the available \textit{LLVM} backends. The presented work is implemented in a deobfuscation tool called \textit{SATURN}

Includes members:
  Member "how to kill symbolic deobfuscation for free or unleashing the potential of path oriented protections":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fine grained static detection of obfuscation transforms using ensemble learning and semantic reasoning")
  Member "defeating opaque predicates statically through machine learning and binary analysis":
    also connected through other hyperedges:
      (none)
  Member "sympas symbolic program slicing":
    also connected through other hyperedges:
      (none)
  Member "souper a synthesizing superoptimizer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "superoptimization of webassembly bytecode")

Question: Please tell me which class the source paper 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)