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: "db nets on the marriage of colored petri nets and relational databases"
  Abstract: The integrated management of business processes and mas- ter data is being increasingly considered as a fundamental problem, by both the academia and the industry. In this position paper, we focus on the foundations of the problem, arguing that contemporary approaches struggle to find a suitable equilibrium between data- and process-related aspects. We then propose db-nets, a new formal model that balances such two pillars through the marriage of colored Petri nets and relational databases. We invite the research community to build on this model, discussing its potential in modeling, formal verification, and simulation.

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"
    - "verification of hierarchical artifact systems"
    - "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"
    - "verification of hierarchical artifact systems"
    - "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"
    - "verification of hierarchical artifact systems"
    - "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 "from db nets to coloured petri nets with priorities extended version"):
  with members:
    - "homogeneous equations of algebraic petri nets"

Connected through hyperedge HE-5 (induced by source paper "modeling and in database management of relational data aware processes extended version"):
  with members:
    - "verifas a practical verifier for artifact systems"
    - "verification of artifact centric systems decidability and modeling issues"
    - "verification of relational data centric dynamic systems with external services"

Connected through hyperedge HE-6 (induced by source paper "catalog of formalized application integration patterns"):
  with members:
    - "toward a collection of cloud integration patterns"

Connected through hyperedge HE-7 (induced by source paper "modelling and enactment of data aware processes"):
  with members:
    - "verification of relational data centric dynamic systems with external services"

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)