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: "verifying monadic second order properties of graph programs"
  Abstract: The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditions of Habel, Pennemann, and Rensink to make them equivalently expressive to monadic second-order logic on graphs. We present a weakest liberal precondition construction for these assertions, and demonstrate its use in verifying non-local correctness specifications of graph programs in the sense of Habel et al.

Connected through hyperedge HE-1 (induced by source paper "improving the gp 2 compiler"):
  with members:
    - "efficient graph rewriting"
    - "the design of gp 2"

Connected through hyperedge HE-2 (induced by source paper "efficient graph rewriting"):
  with members:
    - "the design of gp 2"

Connected through hyperedge HE-3 (induced by source paper "efficient recognition of graph languages"):
  with members:
    - "efficient graph rewriting"

Connected through hyperedge HE-4 (induced by source paper "a semantics comparison workbench for a concurrent asynchronous distributed programming language"):
  with members:
    - "an interference free programming model for network objects"
    - "a graph based semantics workbench for concurrent asynchronous programs"
    - "on the verification of scoop programs"
    - "towards practical graph based verification for an object oriented concurrency model"
    - "efficient and reasonable object oriented concurrency"
    - "the design of gp 2"

Connected through hyperedge HE-5 (induced by source paper "reasoning about graph programs"):
  with members:
    - "a reference interpreter for the graph programming language gp 2"
    - "graphs as models preface"
    - "the design of gp 2"

Connected through hyperedge HE-6 (induced by source paper "towards practical graph based verification for an object oriented concurrency model"):
  with members:
    - "efficient and reasonable object oriented concurrency"
    - "coffman deadlocks in scoop"
    - "queue dispatch asynchronous systems"

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)