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: "automated verification of practical garbage collectors"
  Abstract: Garbage collectors are notoriously hard to verify, due to their low-level#N#interaction with the underlying system and the general difficulty in reasoning#N#about reachability in graphs. Several papers have presented verified#N#collectors, but either the proofs were hand-written or the collectors were too#N#simplistic to use on practical applications. In this work, we present two#N#mechanically verified garbage collectors, both practical enough to use for#N#real-world C# benchmarks. The collectors and their associated allocators#N#consist of x86 assembly language instructions and macro instructions, annotated#N#with preconditions, postconditions, invariants, and assertions. We used the#N#Boogie verification generator and the Z3 automated theorem prover to verify#N#this assembly language code mechanically. We provide measurements comparing the#N#performance of the verified collector with that of the standard Bartok#N#collectors on off-the-shelf C# benchmarks, demonstrating their competitiveness.

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"
    - "on reducing linearizability to state reachability"

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)