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: "robustness against power is pspace complete"
  Abstract: Power is a RISC architecture developed by IBM, Freescale, and several other companies and implemented in a series of POWER processors. The architecture features a relaxed memory model providing very weak guarantees with respect to the ordering and atomicity of memory accesses. #R##N#Due to these weaknesses, some programs that are correct under sequential consistency (SC) show undesirable effects when run under Power. We call these programs not robust against the Power memory model. Formally, a program is robust if every computation under Power has the same data and control dependencies as some SC computation. #R##N#Our contribution is a decision procedure for robustness of concurrent programs against the Power memory model. It is based on three ideas. First, we reformulate robustness in terms of the acyclicity of a happens-before relation. Second, we prove that among the computations with cyclic happens-before relation there is one in a certain normal form. Finally, we reduce the existence of such a normal-form computation to a language emptiness problem. Altogether, this yields a PSPACE algorithm for checking robustness against Power. We complement it by a matching lower bound to show PSPACE-completeness.

Connected through hyperedge HE-1 (induced by source paper "checking robustness against snapshot isolation"):
  with members:
    - "automated detection of serializability violations under weak consistency"
    - "reasoning about tso programs using reduction and abstraction"
    - "a critique of ansi sql isolation levels"

Connected through hyperedge HE-2 (induced by source paper "robustness against transactional causal consistency"):
  with members:
    - "causal consistency beyond memory"
    - "on verifying causal consistency"
    - "herding cats modelling simulation testing and data mining for weak memory"

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

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 power"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "locality and singularity for store atomic memory models"):
  with members:
    - "lazy tso reachability"
    - "a theory of partitioned global address spaces"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-6 (induced by source paper "stateless model checking for power"):
  with members:
    - "stateless model checking for tso and pso"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "relaxed operational semantics of concurrent programming languages"
    - "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)