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 "on p vs np geometric complexity theory explicit proofs and the complexity barrier"):
  Abstract: Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.

Includes members:
  Member "on p vs np geometric complexity theory and the riemann hypothesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a proof for p np problem")
  Member "geometric complexity theory vii nonstandard quantum group for the plethysm problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "geometric complexity theory viii on canonical bases for the nonstandard quantum groups":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit proofs and the flip")
  Member "geometric complexity theory v on deciding nonvanishing of a generalized littlewood richardson coefficient":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit proofs and the flip")
  Member "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of plethysm coefficients")

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)