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: "progress on polynomial identity testing ii"
  Abstract: We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years.

Connected through hyperedge HE-1 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials"):
  with members:
    - "the matching problem in general graphs is in quasi nc"
    - "reconstruction of real depth 3 circuits with top fan in 2"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "geometric complexity theory v efficient algorithms for noether normalization"
    - "algebraic independence and blackbox identity testing"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"

Connected through hyperedge HE-2 (induced by source paper "subspace arrangements graph rigidity and derandomization through submodular optimization"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "operator scaling theory and applications"
    - "deterministic polynomial time algorithms for matrix completion problems"

Connected through hyperedge HE-3 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds"):
  with members:
    - "towards an algebraic natural proofs barrier via polynomial identity testing"
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "proof complexity lower bounds from algebraic circuit complexity"
    - "bipartite perfect matching is in quasi nc"
    - "boundaries of vp and vnp"
    - "unifying known lower bounds via geometric complexity theory"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"

Connected through hyperedge HE-4 (induced by source paper "exact learning from an honest teacher that answers membership queries"):
  with members:
    - "exact learning of juntas from membership queries"
    - "almost optimal cover free families"
    - "linear time constructions of some d restriction problems"
    - "on exact learning monotone dnf from membership queries"
    - "learning boolean halfspaces with small weights from membership queries"
    - "bounds on the rate of disjunctive codes"
    - "efficient computation of representative sets with applications in parameterized and exact algorithms"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-5 (induced by source paper "small hitting sets for tiny arithmetic circuits or how to turn bad designs into good"):
  with members:
    - "on the complexity of partial derivatives"
    - "bipartite perfect matching is in quasi nc"
    - "the chasm at depth four and tensor rank old results new insights"
    - "identity testing for constant width and commutative read once oblivious abps"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "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"
    - "algebraic independence and blackbox identity testing"

Connected through hyperedge HE-6 (induced by source paper "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"):
  with members:
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "non commutative edmonds problem and matrix semi invariants"
    - "solving the isomorphism of polynomials with two secrets problem for all pairs of quadratic forms"
    - "algorithms for group isomorphism via group extensions and cohomology"
    - "deterministic polynomial time algorithms for matrix completion problems"

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

Connected through hyperedge HE-8 (induced by source paper "hitting sets for roabp and sum of set multilinear circuits"):
  with members:
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "hitting sets for low distance multilinear depth 3"
    - "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"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"

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)