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 "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"):
  Abstract: We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an deterministic white-box polynomial identity testing algorithm (due to Raz and Shpilka), but prior to this work there was no known such black-box algorithm. #R##N#The main result of this work gives the first quasi-polynomial sized hitting sets for size S circuits from this class, when the order of the variables is known. As our hitting set is of size exp(lg^2 S), this is analogous (in the terminology of boolean pseudorandomness) to a seed-length of lg^2 S, which is the seed length of the pseudorandom generators of Nisan and Impagliazzo-Nisan-Wigderson for read-once oblivious boolean branching programs. #R##N#Our results are stronger for branching programs of bounded width, where we give a hitting set of size exp(lg^2 S/lglg S), corresponding to a seed length of lg^2 S/lglg S. This is in stark contrast to the known results for read-once oblivious boolean branching programs of bounded width, where no pseudorandom generator (or hitting set) with seed length o(lg^2 S) is known. #R##N#In follow up work, we strengthened a result of Mulmuley, and showed that derandomizing a particular case of the Noether Normalization Lemma is reducible to black-box PIT of read-once oblivious ABPs. Using the results of the present work, this gives a derandomization of Noether Normalization in that case, which Mulmuley conjectured would difficult due to its relations to problems in algebraic geometry. #R##N#We also show that several other circuit classes can be black-box reduced to read-once oblivious ABPs, including set-multilinear ABPs (a generalization of depth-3 set-multilinear formulas), non-commutative ABPs (generalizing non-commutative formulas), and (semi-)diagonal depth-4 circuits (as introduced by Saxena).

Includes members:
  Member "explicit noether normalization for simultaneous conjugation via polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lower bounds for matrix factorization")
  Member "better pseudorandom generators from milder pseudorandom restrictions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "quasi polynomial hitting set for set depth delta formulas":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")
  Member "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "almost settling the hardness of noncommutative determinant":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on explicit branching programs for the rectangular determinant and permanent polynomials")
  Member "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "deterministic black box identity testing pi ordered algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "identity testing and lower bounds for read k oblivious algebraic branching programs")

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)