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: "verification of tree based hierarchical read copy update in the linux kernel"
  Abstract: Read-Copy Update (RCU) is a scalable, high-performance Linux-kernel synchronization mechanism that runs low-overhead readers concurrently with updaters. Production-quality RCU implementations are decidedly non-trivial and their stringent validation is mandatory. This suggests use of formal verification. Previous formal verification efforts for RCU either focus on simple implementations or use modeling languages. In this paper, we construct a model directly from the source code of Tree RCU in the Linux kernel, and use the CBMC program analyzer to verify its safety and liveness properties. To the best of our knowledge, this is the first verification of a significant part of RCU's source code — an important step towards integration of formal verification into the Linux kernel's regression test suite.

Connected through hyperedge HE-1 (induced by source paper "decoupling lock free data structures from memory reclamation for static analysis"):
  with members:
    - "reclaiming memory for lock free data structures there has to be a better way"
    - "proving linearizability using forward simulations"
    - "verifying concurrent stacks by divergence sensitive bisimulation"
    - "effect summaries for thread modular analysis"
    - "concurrent data structures linked in time"
    - "pointer race freedom"
    - "faster linearizability checking via p compositionality"
    - "verifying linearizability a comparative survey"

Connected through hyperedge HE-2 (induced by source paper "safe deferred memory reclamation with types"):
  with members:
    - "decoupling lock free data structures from memory reclamation for static analysis"

Connected through hyperedge HE-3 (induced by source paper "is parallel programming hard and if so what can you do about it v2017 01 02a"):
  with members:
    - "are lock free concurrent algorithms practically wait free"
    - "software verification for weak memory via program transformation"

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)