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: "logical concurrency control from sequential proofs"
  Abstract: We are interested in identifying and enforcing the isolation requirements of#N#a concurrent program, i.e., concurrency control that ensures that the program#N#meets its specification. The thesis of this paper is that this can be done#N#systematically starting from a sequential proof, i.e., a proof of correctness#N#of the program in the absence of concurrent interleavings. We illustrate our#N#thesis by presenting a solution to the problem of making a sequential library#N#thread-safe for concurrent clients. We consider a sequential library annotated#N#with assertions along with a proof that these assertions hold in a sequential#N#execution. We show how we can use the proof to derive concurrency control that#N#ensures that any execution of the library methods, when invoked by concurrent#N#clients, satisfies the same assertions. We also present an extension to#N#guarantee that the library methods are linearizable or atomic.

Connected through hyperedge HE-1 (induced by source paper "optimizing solution quality in synchronization synthesis"):
  with members:
    - "from non preemptive to preemptive scheduling using synchronization synthesis"
    - "regression free synthesis for concurrency"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

Connected through hyperedge HE-2 (induced by source paper "from non preemptive to preemptive scheduling using synchronization synthesis"):
  with members:
    - "regression free synthesis for concurrency"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

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)