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: "refinement types for typescript"
  Abstract: We present Refined TypeScript (RSC), a lightweight refinement type system for TypeScript, that enables static verification of higher-order, imperative programs. We develop a formal core of RSC that delineates the interaction between refinement types and mutability. Next, we extend the core to account for the imperative and dynamic features of TypeScript. Finally, we evaluate RSC on a set of real world benchmarks, including parts of the Octane benchmarks, D3, Transducers, and the TypeScript compiler.

Connected through hyperedge HE-1 (induced by source paper "type level computations for ruby libraries"):
  with members:
    - "just in time static type checking for dynamic languages"
    - "occurrence typing modulo theories"
    - "effective quotation relating approaches to language integrated query"
    - "dependent types for javascript"

Connected through hyperedge HE-2 (induced by source paper "safestrings representing strings as structured data"):
  with members:
    - "what is decidable about string constraints with the replaceall function"
    - "dependent types for javascript"

Connected through hyperedge HE-3 (induced by source paper "local refinement typing"):
  with members:
    - "refinement reflection or how to turn your favorite language into a proof assistant using smt"
    - "program synthesis from polymorphic refinement types"
    - "refinement type inference via horn constraint optimization"
    - "occurrence typing modulo theories"
    - "smt based model checking for recursive programs"
    - "hmc verifying functional programs using abstract interpreters"
    - "software model checking via large block encoding"

Connected through hyperedge HE-4 (induced by source paper "refinement types for ruby"):
  with members:
    - "verified low level programming embedded in f"
    - "a relational logic for higher order programs"
    - "just in time static type checking for dynamic languages"
    - "jsketch sketching for java"
    - "occurrence typing modulo theories"
    - "automated feedback generation for introductory programming assignments"

Connected through hyperedge HE-5 (induced by source paper "fast and precise type checking for javascript"):
  with members:
    - "set theoretic types for polymorphic variants"
    - "dependent types for javascript"

Connected through hyperedge HE-6 (induced by source paper "refinement reflection complete verification with smt"):
  with members:
    - "type targeted testing"
    - "occurrence typing modulo theories"

Connected through hyperedge HE-7 (induced by source paper "component based synthesis of table consolidation and transformation tasks from examples"):
  with members:
    - "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)