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: "a survey of symbolic execution techniques"
  Abstract: Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. For instance, a tool for identifying software vulnerabilities may need to rule out the existence of any backdoor to bypass a program's authentication. One approach would be to test the program using different, possibly random inputs. As the backdoor may only be hit for very specific program workloads, automated exploration of the space of possible inputs is of the essence. Symbolic execution provides an elegant solution to the problem, by systematically exploring many possible execution paths at the same time without necessarily requiring concrete inputs. Rather than taking on fully specified input values, the technique abstractly represents them as symbols, resorting to constraint solvers to construct actual instances that would cause property violations. Symbolic execution has been incubated in dozens of tools developed over the last four decades, leading to major practical breakthroughs in a number of prominent software reliability applications. The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience. #R##N#The present survey has been accepted for publication at ACM Computing Surveys. If you are considering citing this survey, we would appreciate if you could use the following BibTeX entry: this http URL

Connected through hyperedge HE-1 (induced by source paper "cbr controlled burst recording"):
  with members:
    - "in the field monitoring of interactive applications"
    - "timed k tail automatic inference of timed automata"
    - "a platform for automating chaos experiments"

Connected through hyperedge HE-2 (induced by source paper "benchmarking symbolic execution using constraint problems initial results"):
  with members:
    - "shape neutral analysis of graph based data structures"
    - "xcsp3 an integrated format for benchmarking combinatorial constrained problems"
    - "speculative symbolic execution"

Connected through hyperedge HE-3 (induced by source paper "gillian compositional symbolic execution for all"):
  with members:
    - "skeletal semantics and their interpretations"

Connected through hyperedge HE-4 (induced by source paper "faster creation of smaller test suites with snap"):
  with members:
    - "data driven search based software engineering"
    - "hyperparameter optimization for effort estimation"
    - "riot a stochastic based method for workflow scheduling in the cloud"
    - "revisiting unsupervised learning for defect prediction"
    - "beyond evolutionary algorithms for search based software engineering"
    - "sampling as a baseline optimizer for search based software engineering"
    - "enhancing reuse of constraint solutions to improve symbolic execution"
    - "constrained sampling and counting universal hashing meets sat solving"

Connected through hyperedge HE-5 (induced by source paper "a hybrid formal verification system in coq for ensuring the reliability and security of ethereum based service smart contracts"):
  with members:
    - "formal process virtual machine for smart contracts verification"
    - "scilla a smart contract intermediate level language"
    - "a semantic framework for the security analysis of ethereum smart contracts"
    - "fether an extensible definitional interpreter for smart contract verifications in coq"
    - "lolisa formal syntax and semantics for a subset of the solidity programming language"
    - "a general formal memory framework in coq for verifying the properties of programs based on higher order logic theorem proving with increased automation consistency and reusability"
    - "simplicity a new language for blockchains"

Connected through hyperedge HE-6 (induced by source paper "enhancing dynamic symbolic execution by automatically learning search heuristics"):
  with members:
    - "improving function coverage with munch a hybrid fuzzing and directed symbolic execution approach"
    - "concolic testing for deep neural networks"
    - "reinforcement learning for automatic test case prioritization and selection in continuous integration"
    - "firmusb vetting usb device firmware using domain informed symbolic execution"
    - "learn fuzz machine learning for input fuzzing"
    - "abstraction driven concolic testing"

Connected through hyperedge HE-7 (induced by source paper "survey of machine learning techniques for malware analysis"):
  with members:
    - "towards generic deobfuscation of windows api calls"
    - "back to the future malware detection with temporally consistent labels"
    - "robust and effective malware detection through quantitative data flow graph metrics"
    - "novel feature extraction selection and fusion for effective malware family classification"
    - "deep neural network based malware detection using two dimensional binary program features"

Connected through hyperedge HE-8 (induced by source paper "bug searching in smart contract"):
  with members:
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "contractfuzzer fuzzing smart contracts for vulnerability detection"
    - "vandal a scalable security analysis framework for smart contracts"
    - "securify practical security analysis of smart contracts"

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.SE(Software Engineering)