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 theory of formal synthesis via inductive learning"
  Abstract: Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning. We refer to this class of methods that learn programs from examples as formal inductive synthesis. In this paper, we present a theoretical framework for formal inductive synthesis. We discuss how formal inductive synthesis differs from traditional machine learning. We then describe oracle-guided inductive synthesis (OGIS), a framework that captures a family of synthesizers that operate by iteratively querying an oracle. An instance of OGIS that has had much practical impact is counterexample-guided inductive synthesis (CEGIS). We present a theoretical characterization of CEGIS for learning any program that computes a recursive language. In particular, we analyze the relative power of CEGIS variants where the types of counterexamples generated by the oracle varies. We also consider the impact of bounded versus unbounded memory available to the learning algorithm. In the special case where the universe of candidate programs is finite, we relate the speed of convergence to the notion of teaching dimension studied in machine learning theory. Altogether, the results of the paper take a first step towards a theoretical foundation for the emerging field of formal inductive synthesis.

Connected through hyperedge HE-1 (induced by source paper "analyzing cyber physical systems from the perspective of artificial intelligence"):
  with members:
    - "adversarial resilience learning towards systemic vulnerability analysis for large and complex systems"
    - "gray box adversarial testing for control systems with machine learning component"
    - "simulation based adversarial test generation for autonomous vehicles with machine learning components"
    - "co simulation state of the art"
    - "an overview and comparative analysis of recurrent neural networks for short term load forecasting"
    - "deepxplore automated whitebox testing of deep learning systems"
    - "compositional falsification of cyber physical systems with machine learning components"
    - "practical black box attacks against machine learning"

Connected through hyperedge HE-2 (induced by source paper "learning control lyapunov functions from counterexamples and demonstrations"):
  with members:
    - "path following through control funnel functions"
    - "safe learning of quadrotor dynamics using barrier certificates"
    - "learning lyapunov potential functions from counterexamples and demonstrations"
    - "counterexample guided synthesis of switched controllers for reach while stay properties"
    - "controller synthesis with inductive proofs for piecewise linear systems an smt based algorithm"
    - "counter example guided synthesis of control lyapunov functions for switched systems"
    - "learning deep control policies for autonomous aerial vehicles with mpc guided policy search"
    - "torque saturation in bipedal robotic walking through control lyapunov function based quadratic programs"

Connected through hyperedge HE-3 (induced by source paper "decidable synthesis of programs with uninterpreted functions"):
  with members:
    - "proving unrealizability for syntax guided synthesis"
    - "a decidable fragment of second order logic with applications to synthesis"
    - "bounded synthesis of register transducers"
    - "decidable verification of uninterpreted programs"
    - "program synthesis using abstraction refinement"
    - "abstract learning frameworks for synthesis"
    - "what s decidable about syntax guided synthesis"
    - "distributed synthesis for acyclic architectures"

Connected through hyperedge HE-4 (induced by source paper "type directed program synthesis and constraint generation for library portability"):
  with members:
    - "stepping stones to inductive synthesis of low level looping programs"
    - "clblast a tuned opencl blas library"
    - "souper a synthesizing superoptimizer"
    - "yolo9000 better faster stronger"
    - "xnor net imagenet classification using binary convolutional neural networks"
    - "the scalability efficiency maintainability portability trade off in simulation software engineering examples and a preliminary systematic literature review"
    - "you only look once unified real time object detection"
    - "synthesis of recursive adt transformations from reusable templates"

Connected through hyperedge HE-5 (induced by source paper "complexity and information in invariant inference"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "learning disjunctions of predicates"
    - "interactive program synthesis"
    - "abstract learning frameworks for synthesis"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "abstract acceleration of general linear loops"
    - "tight bounds on proper equivalence query learning of dnf"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-6 (induced by source paper "formal policy learning from demonstrations for reachability properties"):
  with members:
    - "learning control lyapunov functions from counterexamples and demonstrations"
    - "sound and automated synthesis of digital stabilizing controllers for continuous plants"
    - "plato policy learning using adaptive trajectory optimization"
    - "controller synthesis with inductive proofs for piecewise linear systems an smt based algorithm"
    - "counter example guided synthesis of control lyapunov functions for switched systems"
    - "a reduction of imitation learning and structured prediction to no regret online learning"
    - "webotstm professional mobile robot simulation"

Connected through hyperedge HE-7 (induced by source paper "overfitting in synthesis theory and practice extended version"):
  with members:
    - "sygus comp 2018 results and analysis"
    - "horn ice learning for synthesizing invariantsand contracts"
    - "webrelate integrating web data with spreadsheets using examples"
    - "loopinvgen a loop invariant generator based on precondition inference"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"
    - "the octagon abstract domain"

Connected through hyperedge HE-8 (induced by source paper "type directed program synthesis and constraint generation for accelerator library portability"):
  with members:
    - "stepping stones to inductive synthesis of low level looping programs"
    - "clblast a tuned opencl blas library"
    - "souper a synthesizing superoptimizer"
    - "the scalability efficiency maintainability portability trade off in simulation software engineering examples and a preliminary systematic literature review"

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.AI(Artificial Intelligence)