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: "property driven fence insertion using reorder bounded model checking"
  Abstract: Modern architectures provide weaker memory consistency guarantees than sequential consistency. These weaker guarantees allow programs to exhibit behaviours where the program statements appear to have executed out of program order. Fortunately, modern architectures provide memory barriers (fences) to enforce the program order between a pair of statements if needed. Due to the intricate semantics of weak memory models, the placement of fences is challenging even for experienced programmers. Too few fences lead to bugs whereas overuse of fences results in performance degradation. This motivates automated placement of fences. Tools that restore sequential consistency in the program may insert more fences than necessary for the program to be correct. Therefore, we propose a property-driven technique that introduces reorder-bounded exploration to identify the smallest number of program locations for fence placement. We implemented our technique on top of Cbmc; however, in principle, our technique is generic enough to be used with any model checker. Our experimental results show that our technique is faster and solves more instances of relevant benchmarks than earlier approaches.

Connected through hyperedge HE-1 (induced by source paper "phase transition behavior of cardinality and xor constraints"):
  with members:
    - "combining the k cnf and xor phase transitions"
    - "the hard problems are almost everywhere for random cnf xor formulas"
    - "distribution aware sampling and weighted model counting for sat"
    - "a scalable approximate model counter"
    - "taming the curse of dimensionality discrete integration by hashing and optimization"
    - "list decoding of polar codes"
    - "probabilistic planning via heuristic forward search and weighted model counting"

Connected through hyperedge HE-2 (induced by source paper "reflections on incremental cardinality constraints for maxsat"):
  with members:
    - "exploiting resolution based representations for maxsat solving"
    - "algorithms for weighted boolean optimization"

Connected through hyperedge HE-3 (induced by source paper "efficient verification of concurrent programs over tso memory model"):
  with members:
    - "stateless model checking for tso and pso"
    - "lazy tso reachability"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

Connected through hyperedge HE-4 (induced by source paper "the virtues of conflict analyzing modern concurrency"):
  with members:
    - "stateless model checking for tso and pso"
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

Connected through hyperedge HE-5 (induced by source paper "don t sit on the fence a static analysis approach to automatic fence insertion"):
  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.SE(Software Engineering)