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: "stateless model checking for power"
  Abstract: We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines several contributions. The first contribution is that we develop a scheme for systematically deriving operational execution models from existing axiomatic ones. The scheme is such that the derived execution models are well suited for efficient SMC. We apply our scheme to an axiomatic model of POWER. Our main contribution is a technique for efficient SMC, called Relaxed Stateless Model Checking (RSMC), which systematically explores the possible inequivalent executions of a program. RSMC is suitable for execution models obtained using our scheme. We prove that RSMC is sound and optimal for the POWER memory model, in the sense that each complete program behavior is explored exactly once. We show the feasibility of our technique by providing an implementation for programs written in C/pthreads.

Connected through hyperedge HE-1 (induced by source paper "dynamic verification with observational equivalence of c c concurrency"):
  with members:
    - "thread modular static analysis for relaxed memory models"
    - "data centric dynamic partial order reduction"
    - "unfolding based partial order reduction"
    - "stateless model checking for tso and pso"

Connected through hyperedge HE-2 (induced by source paper "a load buffer semantics for total store ordering"):
  with members:
    - "stateless model checking for tso and pso"
    - "robustness against power is pspace complete"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-3 (induced by source paper "thread modular static analysis for relaxed memory models"):
  with members:
    - "flow sensitive composition of thread modular abstract interpretation"
    - "stateless model checking for tso and pso"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "software verification for weak memory via program transformation"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"

Connected through hyperedge HE-4 (induced by source paper "context bounded model checking for power"):
  with members:
    - "a load buffer semantics for total store ordering"
    - "stateless model checking for tso and pso"
    - "robustness against power is pspace complete"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-5 (induced by source paper "automating deductive verification for weak memory programs"):
  with members:
    - "automatic verification of iterated separating conjunctions using symbolic execution"
    - "the relationship between separation logic and implicit dynamic frames"

Connected through hyperedge HE-6 (induced by source paper "portability analysis for axiomatic memory models porthos one tool for all models"):
  with members:
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-7 (induced by source paper "a partial order reduction technique for event driven multi threaded programs"):
  with members:
    - "stateless model checking for tso and pso"

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)