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: "on reducing linearizability to state reachability"
  Abstract: Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with respect to given ADT specifications - are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachability are decidable, linearizability is undecidable. #R##N#In this work we demonstrate that verifying linearizability for certain fixed ADT specifications is reducible to control-state reachability, despite being harder for arbitrary ADTs. We effectuate this reduction for several of the most popular atomic objects. This reduction yields the first decidability results for verification without bounding the number of concurrent threads. Furthermore, it enables the application of existing safety-verification tools to linearizability verification.

Connected through hyperedge HE-1 (induced by source paper "verifying visibility based weak consistency"):
  with members:
    - "proving linearizability using forward simulations"
    - "concurrent data structures linked in time"
    - "aspect oriented linearizability proofs"
    - "automated verification of practical garbage collectors"

Connected through hyperedge HE-2 (induced by source paper "order out of chaos proving linearizability using local views"):
  with members:
    - "a general technique for non blocking trees"

Connected through hyperedge HE-3 (induced by source paper "proving linearizability using forward simulations"):
  with members:
    - "on the complexity of linearizability"
    - "flat combining and the synchronization parallelism tradeoff"

Connected through hyperedge HE-4 (induced by source paper "on verifying causal consistency"):
  with members:
    - "causal consistency beyond memory"
    - "on the complexity of linearizability"
    - "verifying pram consistency over read write traces of data replicas"

Connected through hyperedge HE-5 (induced by source paper "reducing opacity to linearizability a sound and complete method"):
  with members:
    - "opacity proof for capr algorithm"

Connected through hyperedge HE-6 (induced by source paper "decidability and complexity for quiescent consistency and its variations"):
  with members:
    - "on verifying causal consistency"
    - "tightening the complexity of equivalence problems for commutative grammars"
    - "sequential consistency and concurrent data structures"
    - "between linearizability and quiescent consistency quantitative quiescent consistency"
    - "on the complexity of linearizability"

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)