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 tso and pso"
  Abstract: We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces. Chronological traces induce a partial order relation on relaxed memory executions, capturing dependencies that are needed to represent the interaction via shared variables. They are optimal in the sense that they only distinguish computations that are inequivalent under the widely-used representation by Shasha and Snir. This allows an optimal dynamic partial order reduction algorithm to explore a minimal number of executions while still guaranteeing full coverage. We apply our techniques to check, under the TSO and PSO memory models, LLVM assembly produced for C/pthreads programs. Our experiments show that our technique reduces the verification effort for relaxed memory models to be almost that for the standard model of sequential consistency. In many cases, our implementation significantly outperforms other comparable tools.

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"
    - "stateless model checking for power"
    - "unfolding based partial order reduction"

Connected through hyperedge HE-2 (induced by source paper "a load buffer semantics for total store ordering"):
  with members:
    - "stateless model checking for power"
    - "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 "quasi optimal partial order reduction"):
  with members:
    - "abstract interpretation with unfoldings"
    - "unfolding based partial order reduction"

Connected through hyperedge HE-4 (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 power"
    - "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-5 (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"
    - "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-6 (induced by source paper "generating representative executions extended abstract"):
  with members:
    - "relaxed operational semantics of concurrent programming languages"

Connected through hyperedge HE-7 (induced by source paper "stateless model checking for power"):
  with members:
    - "robustness against power is pspace complete"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "efficient verification of concurrent programs over tso memory model"):
  with members:
    - "lazy tso reachability"
    - "property driven fence insertion using reorder bounded model checking"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

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)