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: "overhauling sc atomics in c11 and opencl"
  Abstract: Despite the conceptual simplicity of sequential consistency (SC), the semantics of SC atomic operations and fences in the C11 and OpenCL memory models is subtle, leading to convoluted prose descriptions that translate to complex axiomatic formalisations. We conduct an overhaul of SC atomics in C11, reducing the associated axioms in both number and complexity. A consequence of our simplification is that the SC operations in an execution no longer need to be totally ordered. This relaxation enables, for the first time, efficient and exhaustive simulation of litmus tests that use SC atomics. We extend our improved C11 model to obtain the first rigorous memory model formalisation for OpenCL (which extends C11 with support for heterogeneous many-core programming). In the OpenCL setting, we refine the SC axioms still further to give a sensible semantics to SC operations that employ a ‘memory scope’ to restrict their visibility to specific threads. Our overhaul requires slight strengthenings of both the C11 and the OpenCL memory models, causing some behaviours to become disallowed. We argue that these strengthenings are natural, and that all of the formalised C11 and OpenCL compilation schemes of which we are aware (Power and x86 CPUs for C11, AMD GPUs for OpenCL) remain valid in our revised models. Using the HERD memory model simulator, we show that our overhaul leads to an exponential improvement in simulation time for C11 litmus tests compared with the original model, making *exhaustive* simulation competitive, time-wise, with the *non-exhaustive* CDSChecker tool.

Connected through hyperedge HE-1 (induced by source paper "pridemm a solver for relaxed memory models"):
  with members:
    - "an achilles heel of term resolution"
    - "on the quest for an acyclic graph"
    - "on thin air reads towards an event structures model of relaxed memory"
    - "syntax and analytic semantics of lisa"
    - "q resolution with generalized axioms"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-2 (induced by source paper "constructing a weak memory model"):
  with members:
    - "weak memory models with matching axiomatic and operational definitions"
    - "weak memory models balancing definitional simplicity and implementation flexibility"
    - "tricheck memory model verification at the trisection of software hardware and isa"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-3 (induced by source paper "a denotational account of c11 style memory"):
  with members:
    - "on thin air reads towards an event structures model of relaxed memory"
    - "a denotational semantics for sparc tso"

Connected through hyperedge HE-4 (induced by source paper "verifying c11 programs operationally"):
  with members:
    - "operational aspects of c c concurrency"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-5 (induced by source paper "causal linearizability compositionality for partially ordered executions"):
  with members:
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-6 (induced by source paper "the semantics of transactions and weak memory in x86 power arm and c"):
  with members:
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-7 (induced by source paper "weak memory models with matching axiomatic and operational definitions"):
  with members:
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-8 (induced by source paper "weak memory models balancing definitional simplicity and implementation flexibility"):
  with members:
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "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.PL(Programming Languages)