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: "synthesizing imperative programs from examples guided by static analysis"
  Abstract: We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consistent with every example. Our key idea is to combine enumerative program synthesis and static analysis, which aggressively prunes out a large search space while guaranteeing to find, if any, a correct solution. We have implemented our algorithm in a tool, called SIMPL, and evaluated it on 30 problems used in introductory programming courses. The results show that SIMPL is able to solve the benchmark problems in 6.6 seconds on average.

Connected through hyperedge HE-1 (induced by source paper "verification and synthesis of symmetric uni rings for leads to properties"):
  with members:
    - "proving liveness of parameterized programs"
    - "automatic completion of distributed protocols with symmetry"
    - "specification based synthesis of distributed self stabilizing protocols"
    - "synthesis of a simple self stabilizing system"
    - "synchronous counting and computational algorithm design"
    - "generalization strategies for the verification of infinite state systems"

Connected through hyperedge HE-2 (induced by source paper "structuring the synthesis of heap manipulating programs"):
  with members:
    - "structuring the synthesis of heap manipulating programs"
    - "synthesizing bijective lenses"
    - "neural sketch learning for conditional program generation"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-3 (induced by source paper "learning abstractions for program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "automated migration of hierarchical data to relational tables using programming by example"
    - "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-4 (induced by source paper "structuring the synthesis of heap manipulating programs"):
  with members:
    - "structuring the synthesis of heap manipulating programs"
    - "synthesizing bijective lenses"
    - "neural sketch learning for conditional program generation"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-5 (induced by source paper "relational program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "automated migration of hierarchical data to relational tables using programming by example"
    - "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)