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: "occurrence typing modulo theories"
  Abstract: We present a new type system combining occurrence typing, previously used to type check programs in dynamically-typed languages such as Racket, JavaScript, and Ruby, with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical propositions from external theories. By building on occurrence typing, we can add our enriched type system as an extension of Typed Racket---adding dependency and refinement reuses the existing formalism while increasing its expressiveness. #R##N#Dependent refinement types allow Typed Racket programmers to express rich type relationships, ranging from data structure invariants such as red-black tree balance to preconditions such as vector bounds. Refinements allow programmers to embed the propositions that occurrence typing in Typed Racket already reasons about into their types. Further, extending occurrence typing to refinements allows us to make the underlying formalism simpler and more powerful. #R##N#In addition to presenting the design of our system, we present a formal model of the system, show how to integrate it with theories over both linear arithmetic and bitvectors, and evaluate the system in the context of the full Typed Racket implementation. Specifically, we take safe vector access as a case study, and examine all vector accesses in a 56,000 line corpus of Typed Racket programs. Our system is able to prove that 50% of these are safe with no new annotation, and with a few annotations and modifications, we can capture close to 80%.

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

Connected through hyperedge HE-2 (induced by source paper "local refinement typing"):
  with members:
    - "refinement types for typescript"
    - "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"
    - "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-3 (induced by source paper "refinement types for ruby"):
  with members:
    - "verified low level programming embedded in f"
    - "a relational logic for higher order programs"
    - "refinement types for typescript"
    - "just in time static type checking for dynamic languages"
    - "jsketch sketching for java"
    - "automated feedback generation for introductory programming assignments"

Connected through hyperedge HE-4 (induced by source paper "refinement reflection complete verification with smt"):
  with members:
    - "refinement types for typescript"
    - "type targeted testing"

Connected through hyperedge HE-5 (induced by source paper "verified parallel string matching in haskell"):
  with members:
    - "refinement reflection or how to turn your favorite language into a proof assistant using smt"

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)