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: "on generating the ring of matrix semi invariants"
  Abstract: For a field $\mathbb{F}$, let $R(n, m)$ be the ring of invariant polynomials for the action of $\mathrm{SL}(n, \mathbb{F}) \times \mathrm{SL}(n, \mathbb{F})$ on tuples of matrices -- $(A, C)\in\mathrm{SL}(n, \mathbb{F}) \times \mathrm{SL}(n, \mathbb{F})$ sends $(B_1, \dots, B_m)\in M(n, \mathbb{F})^{\oplus m}$ to $(AB_1C^{-1}, \dots, AB_mC^{-1})$. In this paper we call $R(n, m)$ the \emph{ring of matrix semi-invariants}. Let $\beta(R(n, m))$ be the smallest $D$ s.t. matrix semi-invariants of degree $\leq D$ generate $R(n, m)$. Guided by the Procesi-Razmyslov-Formanek approach of proving a strong degree bound for generating matrix invariants, we exhibit several interesting structural results for the ring of matrix semi-invariants $R(n, m)$ over fields of characteristic $0$. Using these results, we prove that $\beta(R(n, m))=\Omega(n^{3/2})$, and $\beta(R(2, m))\leq 4$.

Connected through hyperedge HE-1 (induced by source paper "non commutative edmonds problem and matrix semi invariants"):
  with members:
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "generalized wong sequences and their applications to edmonds problems"
    - "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"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

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)