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: "deciding memory safety for forest datastructures"
  Abstract: Memory safety is the problem of determining if a heap manipulating program that allocates/frees memory locations and manipulates heap pointers, does not dereference a memory location that is not allocated. Memory safety errors are serious security vulnerabilities that can be exploited systematically to attack systems. In this paper we consider the problem of checking if a program, whose initial allocated heap forms a forest structure (i.e., a disjoint set of trees and lists), is memory safe. While the problem of checking memory safety of programs whose initial heap is a forest structure is undecidable, we identify a class of caching programs for which the problem of checking memory safety is decidable. Our experimental evaluation demonstrates that common library routines that manipulate forest data-structures using a single pass are almost always caching. We show that our decision procedure for such programs is effective in both proving memory safety and in identifying memory safety vulnerabilities.

Connected through hyperedge HE-1 (induced by source paper "what s decidable about program verification modulo axioms"):
  with members:
    - "decidable verification of uninterpreted programs"
    - "paxos made epr decidable reasoning about distributed protocols"
    - "algorithms for algebraic path properties in concurrent systems of constant treewidth components"

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)