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: "automated migration of hierarchical data to relational tables using programming by example"
  Abstract: While many applications export data in hierarchical formats like XML and JSON, it is often necessary to convert such hierarchical documents to a relational representation. This paper presents a novel programming-by-example approach, and its implementation in a tool called Mitra, for automatically migrating tree-structured documents to relational tables. We have evaluated the proposed technique using two sets of experiments. In the first experiment, we used Mitra to automate 98 data transformation tasks collected from StackOverflow. Our method can generate the desired program for 94% of these benchmarks with an average synthesis time of 3.8 seconds. In the second experiment, we used Mitra to generate programs that can convert real-world XML and JSON datasets to full-fledged relational databases. Our evaluation shows that Mitra can automate the desired transformation for all datasets.

Connected through hyperedge HE-1 (induced by source paper "data migration using datalog program synthesis"):
  with members:
    - "synthesizing database programs for schema refactoring"
    - "synthesizing datalog programs using numerical relaxation"

Connected through hyperedge HE-2 (induced by source paper "learning abstractions for program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "synthesizing imperative programs from examples guided by static analysis"
    - "synthesis of data completion scripts using finite tree automata"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"
    - "sat based methods for circuit synthesis"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-3 (induced by source paper "relational program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "synthesizing imperative programs from examples guided by static analysis"
    - "verifying equivalence of database driven applications"
    - "synthesis of data completion scripts using finite tree automata"
    - "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)