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 "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"):
  Abstract: It is shown that the problem of derandomizing Noether's Normalization Lemma (NNL) for any explicit variety can be brought down from EXPSPACE, where it is currently, to P assuming a strengthened form of the black-box derandomization hypothesis (BDH) for polynomial identity testing (PIT), and to quasi-P assuming that some exponential-time-computable multilinear polynomial cannot be approximated infinitesimally closely by arithmetic circuits of sub-exponential size. The converse also holds for a strict form of NNL. This equivalence between the strengthened BDH for PIT and the problem of derandomizing NNL in a strict form reveals that the fundamental problems of Geometry and Complexity Theory share a common root difficulty, namely, the problem of overcoming the EXPSPACE vs. P gap in the complexity of NNL for explicit varieties. This gap is called the GCT chasm. #R##N#On the positive side, it is shown that NNL for the ring of invariants for any finite dimensional representation of the special linear group of fixed dimension can be brought down from EXPSPACE to quasi-P unconditionally in characteristic zero. #R##N#On the positive side, it has also been shown recently by Forbes and Shpilka that a variant of a conditional derandomization result in this article in conjunction with the quasi-derandomization of ROABP that was known earlier implies unconditional quasi-derandomization of NNL for the ring of matrix invariants in characteristic zero.

Includes members:
  Member "the complexity of factors of multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "unifying known lower bounds via geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")
  Member "explicit noether normalization for simultaneous conjugation via polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "new lower bounds for the rank of matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of matrix multiplication developments since 2014 extended abstract of 2018 oberwolfach complexity meeting plenary lecture")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bounds for matrix factorization")
  Member "quasi polynomial hitting set for set depth delta formulas":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")
  Member "arithmetic circuits the chasm at depth four gets wider":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lower bounds for matrix factorization")
  Member "the multivariate resultant is np hard in any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the complexity of the multivariate resultant")

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)