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 "search problems in algebraic complexity gct and hardness of generator for invariant rings"):
  Abstract: We consider the problem of outputting succinct encodings of lists of generators for invariant rings. Mulmuley conjectured that there are always polynomial sized such encodings for all invariant rings. We provide simple examples that disprove this conjecture (under standard complexity assumptions).

Includes members:
  Member "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "alternating minimization scaling algorithms and the null cone problem from invariant theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "no occurrence obstructions in geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "a deterministic polynomial time algorithm for non commutative rational identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "circuit complexity proof complexity and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic natural proofs barrier via polynomial identity testing")
  Member "geometric complexity theory v efficient algorithms for noether normalization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")

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)