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: "monotonic abstraction techniques from parametric to software model checking"
  Abstract: Monotonic abstraction is a technique introduced in model checking parameterized distributed systems in order to cope with transitions containing global conditions within guards. The technique has been re-interpreted in a declarative setting in previou s papers of ours and applied to the verification of fault tolerant systems under the so-called ‘sto pping failures’ model. The declarative reinterpretation consists in logical techniques (quantifi er relativizations and, especially, quantifier instantiations) making sense in a broader context. In fact, we recently showed that such techniques can over-approximate array accelerations, so that they can be employed as a meaningful (and practically effective) component of CEGAR loops in software model checking too.

Connected through hyperedge HE-1 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version"):
  with members:
    - "formal modeling and smt based parameterized verification of multi case data aware bpmn"
    - "formal modeling and smt based parameterized verification of data aware bpmn"
    - "verifas a practical verifier for artifact systems"
    - "db nets on the marriage of colored petri nets and relational databases"
    - "verification of hierarchical artifact systems"
    - "backward reachability of array based systems by smt solving termination and invariant synthesis"

Connected through hyperedge HE-2 (induced by source paper "formal modeling and smt based parameterized verification of multi case data aware bpmn"):
  with members:
    - "formal modeling and smt based parameterized verification of data aware bpmn extended version"
    - "verification of data aware processes via array based systems extended version"
    - "db nets on the marriage of colored petri nets and relational databases"
    - "verification of hierarchical artifact systems"
    - "backward reachability of array based systems by smt solving termination and invariant synthesis"

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)