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: "don t sit on the fence a static analysis approach to automatic fence insertion"
  Abstract: Modern architectures rely on memory fences to prevent undesired weakenings of memory consistency. As the fences' semantics may be subtle, the automation of their placement is highly desirable. But precise methods for restoring consistency do not scale to deployed systems code. We choose to trade some precision for genuine scalability: our technique is suitable for large code bases. We implement it in our new musketeer tool, and detail experiments on more than 350 executables of packages found in Debian Linux 7.1, e.g. memcached (about 10000 LoC).

Connected through hyperedge HE-1 (induced by source paper "locality and singularity for store atomic memory models"):
  with members:
    - "lazy tso reachability"
    - "robustness against power is pspace complete"
    - "a theory of partitioned global address spaces"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-2 (induced by source paper "the efficient server audit problem deduplicated re execution and the web"):
  with members:
    - "practical verified computation with streaming interactive proofs"

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"
    - "property driven fence insertion using reorder bounded model checking"

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"
    - "property driven fence insertion using reorder bounded model checking"

Connected through hyperedge HE-5 (induced by source paper "optimizing solution quality in synchronization synthesis"):
  with members:
    - "from non preemptive to preemptive scheduling using synchronization synthesis"
    - "regression free synthesis for concurrency"
    - "logical concurrency control from sequential proofs"

Connected through hyperedge HE-6 (induced by source paper "lazy tso reachability"):
  with members:
    - "partial orders for efficient bmc of concurrent software"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-7 (induced by source paper "property driven fence insertion using reorder bounded model checking"):
  with members:
    - "incremental cardinality constraints for maxsat"
    - "software verification for weak memory via program transformation"

Connected through hyperedge HE-8 (induced by source paper "from non preemptive to preemptive scheduling using synchronization synthesis"):
  with members:
    - "regression free synthesis for concurrency"
    - "logical concurrency control from sequential proofs"

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)