human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "local refinement typing"):
  Abstract: We introduce the Fusion algorithm for local refinement type inference, yielding a new SMT-based method for verifying programs with polymorphic data types and higher-order functions. Fusion is concise as the programmer need only write signatures for (externally exported) top-level functions and places with cyclic (recursive) dependencies, after which Fusion can predictably synthesize the most precise refinement types for all intermediate terms (expressible in the decidable refinement logic), thereby checking the program without false alarms. We have implemented Fusion and evaluated it on the benchmarks from the LiquidHaskell suite totalling about 12KLOC. Fusion checks an existing safety benchmark suite using about half as many templates as previously required and nearly 2x faster. In a new set of theorem proving benchmarks Fusion is both 10 - 50x faster and, by synthesizing the most precise types, avoids false alarms to make verification possible.

Includes members:
  Member "refinement types for typescript":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "type level computations for ruby libraries")
  Member "refinement reflection or how to turn your favorite language into a proof assistant using smt":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verified parallel string matching in haskell")
  Member "program synthesis from polymorphic refinement types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to represent programs with property signatures")
  Member "refinement type inference via horn constraint optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "occurrence typing modulo theories":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "type level computations for ruby libraries")
  Member "smt based model checking for recursive programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proving properties of sorting programs a case study in horn clause verification")
  Member "hmc verifying functional programs using abstract interpreters":
    also connected through other hyperedges:
      (none)
  Member "software model checking via large block encoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "translating xd c programs to msvl programs")

Question: Please tell me which class the source paper 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)