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: "dynamic witnesses for static type errors or ill typed programs usually go wrong"
  Abstract: Static type errors are a common stumbling block for newcomers to typed functional languages. We present a dynamic approach to explaining type errors by generating counterexample witness inputs that illustrate how an ill-typed program goes wrong. First, given an ill-typed function, we symbolically execute the body to synthesize witness values that make the program go wrong. We prove that our procedure synthesizes general witnesses in that if a witness is found, then for all inhabited input types, there exist values that can make the function go wrong. Second, we show how to extend this procedure to produce a reduction graph that can be used to interactively visualize and debug witness executions. Third, we evaluate the coverage of our approach on two data sets comprising over 4,500 ill-typed student programs. Our technique is able to generate witnesses for around 85% of the programs, our reduction graph yields small counterexamples for over 80% of the witnesses, and a simple heuristic allows us to use witnesses to locate the source of type errors with around 70% accuracy. Finally, we evaluate whether our witnesses help students understand and fix type errors, and find that students presented with our witnesses show a greater understanding of type errors than those presented with a standard error message.

Connected through hyperedge HE-1 (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"
    - "imperative functional programs that explain their work"
    - "toward semantic foundations for program editors"
    - "a survey of symbolic execution techniques"
    - "programmatic and direct manipulation together at last"
    - "semi automated svg programming via direct manipulation"

Connected through hyperedge HE-2 (induced by source paper "gradual liquid type inference"):
  with members:
    - "learning to blame localizing novice type errors with data driven diagnosis"
    - "soft contract verification for higher order stateful programs"
    - "refinement reflection complete verification with smt"
    - "soft contract verification"
    - "higher order symbolic execution via contracts"

Connected through hyperedge HE-3 (induced by source paper "imperative functional programs that explain their work"):
  with members:
    - "causally consistent dynamic slicing"
    - "hazelnut a bidirectionally typed structure editor calculus"
    - "constructive galois connections taming the galois connection framework for mechanized metatheory"
    - "database queries that explain their work"
    - "a core calculus for provenance"

Connected through hyperedge HE-4 (induced by source paper "bonsai synthesis based reasoning for type systems"):
  with members:
    - "dynamic witnesses for static type errors"
    - "from f to dot type soundness proofs with definitional interpreters"
    - "higher order symbolic execution for contract verification and refutation"

Connected through hyperedge HE-5 (induced by source paper "learning to blame localizing novice type errors with data driven diagnosis"):
  with members:
    - "adam a method for stochastic optimization"
    - "cause clue clauses error localization using maximum satisfiability"

Connected through hyperedge HE-6 (induced by source paper "how are programs found speculating about language ergonomics with curry howard"):
  with members:
    - "dynamic witnesses for static type errors"

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)