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 "how hard is it to verify flat affine counter systems with the finite monoid property"):
  Abstract: We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved by imposing two restrictions: (i) the control structure of the counter system is flat, meaning that nested loops are forbidden, and (ii) the set of matrix powers is finite, for any affine update matrix in the system. We provide tight complexity bounds for several decision problems of such systems, by proving that reachability and model checking for Past Linear Temporal Logic are complete for the second level of the polynomial hierarchy $\Sigma^P_2$, while model checking for First Order Logic is PSPACE-complete.

Includes members:
  Member "reachability in two dimensional vector addition systems with states is pspace complete":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reachability in fixed dimension vector addition systems with states")
  Member "a concurrent pattern calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a formal approach to the engineering of domain specific distributed systems")
  Member "subclasses of presburger arithmetic and the weak exp hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "succinct population protocols for presburger arithmetic")
  Member "deciding conditional termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a calculus for modular loop acceleration")
  Member "on the complexity of verifying regular properties on flat counter systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "verification of flat fifo systems")
  Member "invariant generation through strategy iteration in succinctly represented control flow graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of satisfiability modulo theory")
  Member "taming past ltl and flat counter systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "verification of flat fifo systems")

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.CC(Computational Complexity)