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 lower bound for the determinantal complexity of a hypersurface"
  Abstract: We prove that the determinantal complexity of a hypersurface of degree $d > 2$ is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least $5$. As a result, we obtain that the determinantal complexity of the $3 \times 3$ permanent is $7$. We also prove that for $n> 3$, there is no nonsingular hypersurface in $\mathbf{P}^n$ of degree $d$ that has an expression as a determinant of a $d \times d$ matrix of linear forms while on the other hand for $n \le 3$, a general determinantal expression is nonsingular. Finally, we answer a question of Ressayre by showing that the determinantal complexity of the unique (singular) cubic surface containing a single line is $5$.

Connected through hyperedge HE-1 (induced by source paper "algebraic branching programs border complexity and tangent spaces"):
  with members:
    - "strongly exponential separation between monotone vp and monotone vnp"
    - "on top fan in vs formal degree for depth 3 arithmetic circuits"
    - "the complexity of factors of multivariate polynomials"
    - "on algebraic branching programs of small width"
    - "geometric complexity theory and matrix powering"
    - "boundaries of vp and vnp"
    - "identity testing and lower bounds for read k oblivious algebraic branching programs"
    - "an overview of mathematical issues arising in the geometric complexity theory approach to vp v s vnp"

Connected through hyperedge HE-2 (induced by source paper "on algebraic branching programs of small width"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "succinct hitting sets and barriers to proving algebraic circuits lower bounds"
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "no occurrence obstructions in geometric complexity theory"
    - "a 2n 2 log n 1 lower bound for the border rank of matrix multiplication"
    - "boundaries of vp and vnp"
    - "unifying known lower bounds via geometric complexity theory"
    - "equations for lower bounds on border rank"

Connected through hyperedge HE-3 (induced by source paper "no occurrence obstructions in geometric complexity theory"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "on vanishing of kronecker coefficients"
    - "geometric complexity theory and matrix powering"
    - "permanent versus determinant not via saturations"
    - "binary determinantal complexity"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "bi polynomial rank and determinantal complexity"
    - "permanent versus determinant obstructions and kronecker coefficients"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of the permanent in various computational models"):
  with members:
    - "geometric complexity theory and matrix powering"
    - "no occurrence obstructions in geometric complexity theory"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "on the expressive power of read once determinants"
    - "deterministic polynomial time algorithms for matrix completion problems"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-5 (induced by source paper "permanent versus determinant not via saturations"):
  with members:
    - "binary determinantal complexity"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-6 (induced by source paper "binary determinantal complexity"):
  with members:
    - "practical graph isomorphism ii"

Connected through hyperedge HE-7 (induced by source paper "rectangular kronecker coefficients and plethysms in geometric complexity theory"):
  with members:
    - "on vanishing of kronecker coefficients"
    - "no occurrence obstructions in geometric complexity theory"
    - "permanent versus determinant not via saturations"
    - "binary determinantal complexity"
    - "bi polynomial rank and determinantal complexity"
    - "permanent versus determinant obstructions and kronecker coefficients"
    - "the p versus np problem"
    - "an overview of mathematical issues arising in the geometric complexity theory approach to vp v s vnp"

Connected through hyperedge HE-8 (induced by source paper "permanent versus determinant obstructions and kronecker coefficients"):
  with members:
    - "membership in moment polytopes is in np and conp"
    - "on vanishing of kronecker coefficients"
    - "no occurrence obstructions in geometric complexity theory"
    - "permanent versus determinant not via saturations"
    - "binary determinantal complexity"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "bi polynomial rank and determinantal complexity"
    - "computing multiplicities of lie group representations"

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)