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: "get rid of inline assembly through verification oriented lifting"
  Abstract: Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of the notable forthcoming challenges. For example, C programmers regularly use inline assembly for low-level optimizations and system primitives. This usually results in driving state-of-the-art formal analyzers developed for C ineffective. We thus propose TInA, an automated, generic, trustable and verification-oriented lifting technique turning inline assembly into semantically equivalent C code, in order to take advantage of existing C analyzers. Extensive experiments on real-world C code with inline assembly (including GMP and ffmpeg) show the feasibility and benefits of TInA.

Connected through hyperedge HE-1 (induced by source paper "binary level directed fuzzing for use after free vulnerabilities"):
  with members:
    - "matryoshka fuzzing deeply nested branches"
    - "weizz automatic grey box fuzzing for structured binary formats"
    - "fairfuzz a targeted mutation strategy for increasing greybox fuzz testing coverage"
    - "evaluating fuzz testing"
    - "assurances in software testing a roadmap"
    - "sok sanitizing for security"
    - "the art science and engineering of fuzzing a survey"
    - "neuzz efficient fuzzing with neural program smoothing"

Connected through hyperedge HE-2 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable"):
  with members:
    - "structural analysis shape information via points to computation"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-3 (induced by source paper "binsec rel efficient relational symbolic execution for constant time at binary level"):
  with members:
    - "symbolic verification of cache side channel freedom"
    - "eliminating timing side channel leaks using program repair"
    - "microwalk a framework for finding side channels in binaries"
    - "time protection the missing os abstraction"
    - "relational symbolic execution"
    - "a software approach to defeating side channels in last level caches"
    - "rigorous analysis of software countermeasures against cache attacks"

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.PL(Programming Languages)