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: "from safety to termination and back smt based verification for lazy languages"
  Abstract: Abstract SMT-based veriﬁers have long been an effective means of ensur-ing safety properties of programs. While these techniques are wellunderstood, we show that they implicitly require eager seman-tics; directly applying them to a lazy language is unsound due tothe presence of divergent sub-computations. We recover sound-ness by composing the safety analysis with a termination analy-sis. Of course, termination is itself a challenging problem, but weshow how the safety analysis can be used to ensure termination,thereby bootstrapping soundness for the entire system. Thus, whilesafety invariants have long been required to prove termination, weshow how termination proofs can be to soundly establish safety.We have implemented our approach in L IQUID H ASKELL , a Re-ﬁnement Type-based veriﬁer for Haskell. We demonstrate its effec-tiveness via an experimental evaluation using L IQUID H ASKELL toverify safety, functional correctness and termination properties ofreal-world Haskell libraries, totaling over 10,000 lines of code.

Connected through hyperedge HE-1 (induced by source paper "size change termination as a contract"):
  with members:
    - "soft contract verification for higher order stateful programs"
    - "abstracting definitional interpreters functional pearl"
    - "soft contract verification"
    - "abstracting abstract machines a systematic approach to higher order program analysis"
    - "higher order symbolic execution via contracts"
    - "abstracting abstract machines"
    - "a dynamic approach to characterizing termination of general logic programs"

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)