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: "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
  Abstract: We extend our techniques developed in our manuscript mentioned in the subtitle to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with certificates of linear spaces of matrices over sufficiently large base fields. #R##N#The key new idea is a reduction procedure that keeps the blow-up parameter small, and there are two methods to implement this idea: the first one is a greedy argument that removes certain rows and columns, and the second one is an efficient algorithmic version of a result of Derksen and Makam. Both methods rely crucially on the regularity lemma in the aforementioned manuscript, and in this note we improve that lemma by removing a coprime condition there. arXiv:1508.00690

Connected through hyperedge HE-1 (induced by source paper "on a weighted linear matroid intersection algorithm by deg det computation"):
  with members:
    - "operator scaling theory and applications"

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"
    - "non commutative edmonds problem and matrix semi invariants"

Connected through hyperedge HE-3 (induced by source paper "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"):
  with members:
    - "sum of square proof for brascamp lieb type inequality"
    - "information theoretic perspectives on brascamp lieb inequality and its reverse"
    - "polynomial time tensor decompositions with sum of squares"
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "speeding up sum of squares for tensor decomposition and planted sparse vectors"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"

Connected through hyperedge HE-4 (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 is in deterministic polynomial time"
    - "non commutative edmonds problem and matrix semi invariants"
    - "generalized wong sequences and their applications to edmonds problems"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "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-5 (induced by source paper "a deterministic polynomial time algorithm for non commutative rational identity testing"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "non commutative edmonds problem and matrix semi invariants"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "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)