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 "complexity hierarchies beyond elementary"):
  Abstract: We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many nonelementary problems. This hierarchy allows the classification of many decision problems with a nonelementary complexity, which occur naturally in areas such as logic, combinatorics, formal languages, and verification, with complexities ranging from simple towers of exponentials to Ackermannian and beyond.

Includes members:
  Member "relating timed and register automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symbolic register automata")
  Member "demystifying reachability in vector addition systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "nonelementary complexities for branching vass mell and extensions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the reachability problem for petri nets is not elementary")
  Member "on freeze ltl with ordered attributes":
    also connected through other hyperedges:
      (none)
  Member "trace inclusion for one counter nets revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the fixed initial credit problem for partial observation energy games is ack complete")
  Member "the power of priority channel systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "the parametric ordinal recursive complexity of post embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on reachability for unidirectional channel systems extended with regular tests")
  Member "graph logics with rational relations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decision procedures for path feasibility of string manipulating programs with complex operations")

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)