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: "reachability under contextual locking"
  Abstract: The pairwise reachability problem for a multi-threaded program asks, given#N#control locations in two threads, whether they can be simultaneously reached in#N#an execution of the program. The problem is important for static analysis and#N#is used to detect statements that are concurrently enabled. This problem is in#N#general undecidable even when data is abstracted and when the threads (with#N#recursion) synchronize only using a finite set of locks. Popular programming#N#paradigms that limit the lock usage patterns have been identified under which#N#the pairwise reachability problem becomes decidable. In this paper, we consider#N#a new natural programming paradigm, called contextual locking, which ties the#N#lock usage to calling patterns in each thread: we assume that locks are#N#released in the same context that they were acquired and that every lock#N#acquired by a thread in a procedure call is released before the procedure#N#returns. Our main result is that the pairwise reachability problem is#N#polynomial-time decidable for this new programming paradigm as well. The#N#problem becomes undecidable if the locks are reentrant; reentrant locking is a#N#\emph{recursive locking} mechanism which allows a thread in a multi-threaded#N#program to acquire the reentrant lock multiple times.

Connected through hyperedge HE-1 (induced by source paper "reachability for dynamic parametric processes"):
  with members:
    - "model checking parameterized asynchronous shared memory systems"
    - "parameterized verification of asynchronous shared memory systems"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-2 (induced by source paper "reachability problem for weak multi pushdown automata"):
  with members:
    - "partially commutative context free languages"
    - "context bounded analysis for concurrent programs with dynamic creation of threads"

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.LO(Logic in Computer Science)