human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn"):
  Abstract: We propose DAB -- a data-aware extension of BPMN where the process operates over case and persistent data (partitioned into a read-only database called catalog and a read-write database called repository). The model trades off between expressiveness and the possibility of supporting parameterized verification of safety properties on top of it. Specifically, taking inspiration from the literature on verification of artifact systems, we study verification problems where safety properties are checked irrespectively of the content of the read-only catalog, and accepting the potential presence of unboundedly many tuples in the catalog and repository. We tackle such problems using an array-based backward reachability procedure fully implemented in MCMT -- a state-of-the-art array-based SMT model checker. Notably, we prove that the procedure is sound and complete for checking safety of DABs, and single out additional conditions that guarantee its termination and, in turn, show decidability of checking

Includes members:
  Member "formal modeling and smt based parameterized verification of data aware bpmn extended version":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "formal modeling and smt based parameterized verification of multi case data aware bpmn")
  Member "formal modeling and smt based parameterized verification of multi case data aware bpmn":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version")
  Member "verifas a practical verifier for artifact systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version")
  Member "db nets on the marriage of colored petri nets and relational databases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version")
  Member "verification of hierarchical artifact systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version")
  Member "interactive learning based realizability for heyting arithmetic with em1":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an algorithmic approach to the existence of ideal objects in commutative algebra")
  Member "backward reachability of array based systems by smt solving termination and invariant synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn extended version")

Question: Please tell me which class the source paper 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)