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: "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
  Abstract: Mulmuley recently gave an explicit version of Noether's Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are deterministic black-box algorithms for polynomial identity testing (PIT). He argued that this gives evidence that constructing such algorithms for PIT is beyond current techniques. In this work, we show this is not the case. That is, we improve Mulmuley's reduction and correspondingly weaken the conjecture regarding PIT needed to give explicit Noether Normalization. We then observe that the weaker conjecture has recently been nearly settled by the authors, who gave quasipolynomial size hitting sets for the class of read-once oblivious algebraic branching programs (ROABPs). This gives the desired explicit Noether Normalization unconditionally, up to quasipolynomial factors. #R##N#As a consequence of our proof we give a deterministic parallel polynomial-time algorithm for deciding if two matrix tuples have intersecting orbit closures, under simultaneous conjugation. #R##N#We also study the strength of conjectures that Mulmuley requires to obtain similar results as ours. We prove that his conjectures are stronger, in the sense that the computational model he needs PIT algorithms for is equivalent to the well-known algebraic branching program (ABP) model, which is provably stronger than the ROABP model. #R##N#Finally, we consider the depth-3 diagonal circuit model as defined by Saxena, as PIT algorithms for this model also have implications in Mulmuley's work. Previous work have given quasipolynomial size hitting sets for this model. In this work, we give a much simpler construction of such hitting sets, using techniques of Shpilka and Volkovich.

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"
    - "progress on polynomial identity testing ii"
    - "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 "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"):
  with members:
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the paulsen problem continuous operator scaling and smoothed analysis"
    - "much faster algorithms for matrix scaling"
    - "matrix scaling and balancing via box constrained newton s method and interior point methods"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"

Connected through hyperedge HE-3 (induced by source paper "interactions of computational complexity theory and mathematics"):
  with members:
    - "no occurrence obstructions in geometric complexity theory"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "uniform sampling through the lov asz local lemma"
    - "approximate counting the lovasz local lemma and inference in graphical models"
    - "graph isomorphism in quasipolynomial time"
    - "operator scaling theory and applications"
    - "non commutative edmonds problem and matrix semi invariants"
    - "analysis of boolean functions"

Connected through hyperedge HE-4 (induced by source paper "proof complexity lower bounds from algebraic circuit complexity"):
  with members:
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "an exponential lower bound for homogeneous depth 5 circuits over finite fields"
    - "identity testing and lower bounds for read k oblivious algebraic branching programs"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"

Connected through hyperedge HE-5 (induced by source paper "boundaries of vp and vnp"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "unifying known lower bounds via geometric complexity theory"
    - "deterministic polynomial time algorithms for matrix completion problems"

Connected through hyperedge HE-6 (induced by source paper "identity testing and lower bounds for read k oblivious algebraic branching programs"):
  with members:
    - "some lower bound results for set multilinear arithmetic computations"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "the limits of depth reduction for arithmetic formulas it s all about the top fan in"
    - "pseudorandomness for regular branching programs via fourier analysis"

Connected through hyperedge HE-7 (induced by source paper "operator scaling theory and applications"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "non commutative edmonds problem and matrix semi invariants"
    - "generalized wong sequences and their applications to edmonds problems"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "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 "a deterministic polynomial time algorithm for non commutative rational identity testing"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
    - "non commutative edmonds problem and matrix semi invariants"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "deterministic polynomial time algorithms for matrix completion problems"

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)