human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "new results on noncommutative and commutative polynomial identity testing"
  Abstract: Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the reconstruction of black-box noncommuting algebraic branching programs. Assuming the black-box model allows us to query the ABP for the output at any given gate, we can reconstruct an (equivalent) ABP in deterministic polynomial time. Finally, we explore commutative identity testing when the coefficients of the input polynomial come from an arbitrary finite commutative ring with unity.

Connected through hyperedge HE-1 (induced by source paper "efficient black box identity testing over free group algebra"):
  with members:
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"

Connected through hyperedge HE-2 (induced by source paper "sparse multivariate polynomial interpolation on the basis of schubert polynomials"):
  with members:
    - "a structured view on weighted counting with relations to counting quantum computation and applications"
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of noncommutative polynomial factorization"):
  with members:
    - "noncommutative valiant s classes structure and complete problems"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"

Connected through hyperedge HE-4 (induced by source paper "reconstruction of real depth 3 circuits with top fan in 2"):
  with members:
    - "progress on polynomial identity testing ii"
    - "from sylvester gallai configurations to rank bounds improved black box identity test for depth 3 circuits"

Connected through hyperedge HE-5 (induced by source paper "progress on polynomial identity testing ii"):
  with members:
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "hitting sets for low distance multilinear depth 3"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "algebraic independence in positive characteristic a p adic calculus"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"

Connected through hyperedge HE-6 (induced by source paper "new algorithms and hard instances for non commutative computation"):
  with members:
    - "progress on polynomial identity testing ii"
    - "almost settling the hardness of noncommutative determinant"
    - "monomials in arithmetic circuits complete problems in the counting hierarchy"
    - "arithmetic circuits and the hadamard product of polynomials"
    - "on the expressive power of permanents and perfect matchings of matrices of bounded pathwidth cliquewidth"
    - "on the expressive power of planar perfect matching and permanents of bounded treewidth matrices"

Connected through hyperedge HE-7 (induced by source paper "pseudorandomness for multilinear read once algebraic branching programs in any order"):
  with members:
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "factoring bivariate lacunary polynomials without heights"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"

Connected through hyperedge HE-8 (induced by source paper "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"):
  with members:
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "almost settling the hardness of noncommutative determinant"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"
    - "deterministic black box identity testing pi ordered algebraic branching programs"

Question: Please tell me which class the center node 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)