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: "imperative functional programs that explain their work"
  Abstract: Program slicing provides explanations that illustrate how program outputs were produced from inputs. We build on an approach introduced in prior work by Perera et al., where dynamic slicing was defined for pure higher-order functional programs as a Galois connection between lattices of partial inputs and partial outputs. We extend this approach to imperative functional programs that combine higher-order programming with references and exceptions. We present proofs of correctness and optimality of our approach and a proof-of-concept implementation and experimental evaluation.

Connected through hyperedge HE-1 (induced by source paper "language integrated provenance by trace analysis"):
  with members:
    - "language integrated provenance in haskell"
    - "you say what i hear where and why mis interpreting sql to derive fine grained provenance"
    - "language integrated provenance"
    - "database queries that explain their work"
    - "a core calculus for provenance"

Connected through hyperedge HE-2 (induced by source paper "the meaning of a program change is a change to the program s meaning"):
  with members:
    - "live functional programming with typed holes"
    - "hazelnut a bidirectionally typed structure editor calculus"
    - "incremental computation with names"

Connected through hyperedge HE-3 (induced by source paper "verified self explaining computation"):
  with members:
    - "causally consistent dynamic slicing"

Connected through hyperedge HE-4 (induced by source paper "live functional programming with typed holes"):
  with members:
    - "exploratory and live programming and coding a literature study comparing perspectives on liveness"
    - "augmenting source code lines with sample variable values"
    - "using elm to introduce algebraic thinking to k 8 students"
    - "toward semantic foundations for program editors"
    - "a survey of symbolic execution techniques"
    - "dynamic witnesses for static type errors or ill typed programs usually go wrong"
    - "programmatic and direct manipulation together at last"
    - "semi automated svg programming via direct manipulation"

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)