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: "a deterministic polynomial time algorithm for non commutative rational identity testing"
  Abstract: In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in {\emph non-commuting} variables over $\mathbb{Q}$ is invertible or not. The analogous question for commuting variables is the celebrated polynomial identity testing (PIT) for symbolic determinants. In contrast to the commutative case, which has an efficient probabilistic algorithm, the best previous algorithm for the non-commutative setting required exponential time [IQS15] (whether or not randomization is allowed). The algorithm efficiently solves the "word problem" for the free skew field, and the identity testing problem for arithmetic formulae with division over non-commuting variables, two problems which had only exponential-time algorithms prior to this work. #R##N#The main (and simple) technical contribution of this paper is an analysis of an existing algorithm due to Gurvits which solved the same problem in some special cases. We also extend the algorithm to compute the (non-commutative) rank of a symbolic matrix, yielding a factor 2 approximation on the commutative rank. #R##N#Symbolic matrices in non-commuting variables, and the related structural and algorithmic questions, have a remarkable number of diverse origins and motivations. They arise independently in (commutative) invariant theory and representation theory, linear algebra, optimization, linear system theory, quantum information theory, approximation of the permanent and naturally in non-commutative algebra. We provide a detailed account of some of these sources and their interconnections. In particular we explain how some of these sources played an important role in the development of Gurvits' algorithm and in our analysis of it here.

Connected through hyperedge HE-1 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion"):
  with members:
    - "spectral analysis of matrix scaling and operator scaling"
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "efficient algorithms for tensor scaling quantum marginals and moment polytopes"
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "maximum entropy distributions bit complexity and stability"
    - "computing maximum entropy distributions everywhere"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"

Connected through hyperedge HE-2 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions"):
  with members:
    - "linear algebraic analogues of the graph isomorphism problem and the erd h o s r enyi model"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the matching problem in general graphs is in quasi nc"
    - "bipartite perfect matching is in quasi nc"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "graph isomorphism in quasipolynomial time"
    - "non commutative edmonds problem and matrix semi invariants"
    - "generalized wong sequences and their applications to edmonds problems"

Connected through hyperedge HE-3 (induced by source paper "spectral analysis of matrix scaling and operator scaling"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "testing halfspaces over rotation invariant distributions"
    - "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"
    - "algorithms and hardness for robust subspace recovery"
    - "perfect matchings in o n 1 5 time in regular bipartite graphs"

Connected through hyperedge HE-4 (induced by source paper "derandomization and absolute reconstruction for sums of powers of linear forms"):
  with members:
    - "isomorphism problems for tensors groups and cubic forms completeness and reductions"
    - "orbits of monomials and factorization into products of linear forms"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "reconstruction algorithms for sums of affine powers"
    - "non commutative edmonds problem and matrix semi invariants"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "symmetric tensor decomposition"

Connected through hyperedge HE-5 (induced by source paper "search problems in algebraic complexity gct and hardness of generator for invariant rings"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "no occurrence obstructions in geometric complexity theory"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "geometric complexity theory v efficient algorithms for noether normalization"

Connected through hyperedge HE-6 (induced by source paper "computing the maximum degree of minors in skew polynomial matrices"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "computing the hermite form of a matrix of ore polynomials"

Connected through hyperedge HE-7 (induced by source paper "efficient algorithms for tensor scaling quantum marginals and moment polytopes"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "membership in moment polytopes is in np and conp"
    - "on vanishing of kronecker coefficients"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "computing multiplicities of lie group representations"

Connected through hyperedge HE-8 (induced by source paper "orbits of monomials and factorization into products of linear forms"):
  with members:
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "no occurrence obstructions in geometric complexity theory"

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)