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: "component based synthesis of table consolidation and transformation tasks from examples"
  Abstract: This paper presents an example-driven synthesis technique for automating a large class of data preparation tasks that arise in data science. Given a set of input tables and an out- put table, our approach synthesizes a table transformation program that performs the desired task. Our approach is not restricted to a fixed set of DSL constructs and can synthesize programs from an arbitrary set of components, including higher-order combinators. At a high-level, our approach performs type-directed enumerative search over partial pro- grams but incorporates two key innovations that allow it to scale: First, our technique can utilize any first-order specification of the components and uses SMT-based deduction to reject partial programs. Second, our algorithm uses partial evaluation to increase the power of deduction and drive enumerative search. We have evaluated our synthesis algorithm on dozens of data preparation tasks obtained from on-line forums, and we show that our approach can automatically solve a large class of problems encountered by R users.

Connected through hyperedge HE-1 (induced by source paper "counterexample guided neural synthesis"):
  with members:
    - "neural program synthesis with priority queue training"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "robustfill neural program learning under noisy i o"
    - "programming not only by example"
    - "deepcoder learning to write programs"
    - "automated synthesis of semantic malware signatures using maximum satisfiability"
    - "neuro symbolic program synthesis"
    - "neural gpus learn algorithms"

Connected through hyperedge HE-2 (induced by source paper "resource guided program synthesis"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "towards automatic resource bound analysis for ocaml"
    - "synthesis of recursive adt transformations from reusable templates"
    - "program synthesis from polymorphic refinement types"
    - "denotational cost semantics for functional languages with inductive types"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"

Connected through hyperedge HE-3 (induced by source paper "synthesizing queries via interactive sketching"):
  with members:
    - "selecting representative examples for program synthesis"
    - "active learning of points to specifications"
    - "program synthesis using conflict driven learning"
    - "interactive program synthesis"
    - "interactive bayesian hierarchical clustering"
    - "deepcoder learning to write programs"
    - "synthesizing program input grammars"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-4 (induced by source paper "multi modal synthesis of regular expressions"):
  with members:
    - "seq2sql generating structured queries from natural language using reinforcement learning"
    - "nl2bash a corpus and semantic parser for natural language interface to the linux operating system"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "synthesis of data completion scripts using finite tree automata"
    - "learning a natural language interface with neural programmer"
    - "neural generation of regular expressions from natural language with minimal domain knowledge"
    - "learning semantic string transformations from examples"

Connected through hyperedge HE-5 (induced by source paper "synthesizing database programs for schema refactoring"):
  with members:
    - "relational program synthesis"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "verifying equivalence of database driven applications"
    - "deepcoder learning to write programs"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "on the automated verification of web applications with embedded sql"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-6 (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"
    - "program synthesis from polymorphic refinement types"
    - "a theory of formal synthesis via inductive learning"
    - "the octagon abstract domain"

Connected through hyperedge HE-7 (induced by source paper "visualization by example"):
  with members:
    - "synthesizing bijective lenses"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "synthesis of data completion scripts using finite tree automata"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-8 (induced by source paper "structuring the synthesis of heap manipulating programs"):
  with members:
    - "structuring the synthesis of heap manipulating programs"
    - "synthesizing bijective lenses"
    - "synthesizing imperative programs from examples guided by static analysis"
    - "neural sketch learning for conditional program generation"
    - "program synthesis from polymorphic refinement types"

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)