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: "verification of hierarchical artifact systems"
  Abstract: Data-driven workflows, of which IBM's Business Artifacts are a prime exponent, have been successfully deployed in practice, adopted in industrial standards, and have spawned a rich body of research in academia, focused primarily on static analysis. The present work represents a significant advance on the problem of artifact verification, by considering a much richer and more realistic model than in previous work, incorporating core elements of IBM's successful Guard-Stage-Milestone model. In particular, the model features task hierarchy, concurrency, and richer artifact data. It also allows database key and foreign key dependencies, as well as arithmetic constraints. The results show decidability of verification and establish its complexity, making use of novel techniques including a hierarchy of Vector Addition Systems and a variant of quantifier elimination tailored to our context.

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"
    - "monotonic abstraction techniques from parametric to software model checking"
    - "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 data aware bpmn"):
  with members:
    - "formal modeling and smt based parameterized verification of data aware bpmn extended version"
    - "formal modeling and smt based parameterized verification of multi case data aware bpmn"
    - "verifas a practical verifier for artifact systems"
    - "db nets on the marriage of colored petri nets and relational databases"
    - "interactive learning based realizability for heyting arithmetic with em1"
    - "backward reachability of array based systems by smt solving termination and invariant synthesis"

Connected through hyperedge HE-3 (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"
    - "monotonic abstraction techniques from parametric to software model checking"
    - "backward reachability of array based systems by smt solving termination and invariant synthesis"

Connected through hyperedge HE-4 (induced by source paper "quantifier elimination for database driven verification"):
  with members:
    - "formal modeling and smt based parameterized verification of data aware bpmn"
    - "verification of data aware processes via array based systems extended version"
    - "on interpolation and symbol elimination in theory extensions"

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.DB(Databases)