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 "neuro symbolic execution the feasibility of an inductive approach to symbolic execution"):
  Abstract: Symbolic execution is a powerful technique for program analysis. However, it has many limitations in practical applicability: the path explosion problem encumbers scalability, the need for language-specific implementation, the inability to handle complex dependencies, and the limited expressiveness of theories supported by underlying satisfiability checkers. Often, relationships between variables of interest are not expressible directly as purely symbolic constraints. To this end, we present a new approach -- neuro-symbolic execution -- which learns an approximation of the relationship as a neural net. It features a constraint solver that can solve mixed constraints, involving both symbolic expressions and neural network representation. To do so, we envision such constraint solving as procedure combining SMT solving and gradient-based optimization. We demonstrate the utility of neuro-symbolic execution in constructing exploits for buffer overflows. We report success on 13/14 programs which have difficult constraints, known to require specialized extensions to symbolic execution. In addition, our technique solves $100$\% of the given neuro-symbolic constraints in $73$ programs from standard verification and invariant synthesis benchmarks.

Includes members:
  Member "a counterexample guided approach to finding numerical invariants":
    also connected through other hyperedges:
      (none)
  Member "angora efficient fuzzing by principled search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meuzz smart seed scheduling for hybrid fuzzing")
  Member "loopinvgen a loop invariant generator based on precondition inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overfitting in synthesis theory and practice extended version")
  Member "end to end learning for self driving cars":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "a continuum among logarithmic linear and exponential functions and its potential to improve generalization in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "goldilocks neural networks")
  Member "an overview of gradient descent optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "tensorflow a system for large scale machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "counterexample guided polynomial loop invariant generation by lagrange interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")

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