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: "decidable verification of uninterpreted programs"
  Abstract: We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification problem asks whether a given program satisfies a postcondition written using quantifier-free formulas with equality on the final state, with no loop invariants, contracts, etc. being provided. We show that this problem is undecidable in general. The main contribution of this paper is a subclass of programs, called coherent programs that admits decidable verification, and can be decided in PSPACE. We then extend this class of programs to classes of programs that are $k$-coherent, where $k \in \mathbb{N}$, obtained by (automatically) adding $k$ ghost variables and assignments that make them coherent. We also extend the decidability result to programs with recursive function calls and prove several undecidability results that show why our restrictions to obtain decidability seem necessary.

Connected through hyperedge HE-1 (induced by source paper "decidable synthesis of programs with uninterpreted functions"):
  with members:
    - "proving unrealizability for syntax guided synthesis"
    - "a decidable fragment of second order logic with applications to synthesis"
    - "bounded synthesis of register transducers"
    - "program synthesis using abstraction refinement"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "what s decidable about syntax guided synthesis"
    - "distributed synthesis for acyclic architectures"

Connected through hyperedge HE-2 (induced by source paper "deciding memory safety for single pass heap manipulating programs"):
  with members:
    - "what s decidable about program verification modulo axioms"
    - "decidable synthesis of programs with uninterpreted functions"
    - "a first order logic with frames"
    - "memory tagging and how it improves c c memory safety"
    - "invariant synthesis for incomplete verification engines"

Connected through hyperedge HE-3 (induced by source paper "what s decidable about program verification modulo axioms"):
  with members:
    - "deciding memory safety for forest datastructures"
    - "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)