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: "permanent versus determinant not via saturations"
  Abstract: Let Det_n denote the closure of the GL_{n^2}(C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_{n^2}(C)-representations occurring in the coordinate ring of Det_n form a finitely generated monoid S(Det_n). We prove that the saturation of S(Det_n) contains all partitions lambda with length at most n and size divisible by n. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid S(Det_n).

Connected through hyperedge HE-1 (induced by source paper "the computational complexity of plethysm coefficients"):
  with members:
    - "on geometric complexity theory multiplicity obstructions are stronger than occurrence obstructions"
    - "implementing geometric complexity theory on the separation of orbit closures via symmetries"
    - "on vanishing of kronecker coefficients"
    - "geometric complexity theory and matrix powering"
    - "no occurrence obstructions in geometric complexity theory"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "permanent versus determinant obstructions and kronecker coefficients"
    - "explicit lower bounds via geometric complexity theory"

Connected through hyperedge HE-2 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries"):
  with members:
    - "on geometric complexity theory multiplicity obstructions are stronger than occurrence obstructions"
    - "the complexity of factors of multivariate polynomials"
    - "succinct hitting sets and barriers to proving algebraic circuits lower bounds"
    - "towards an algebraic natural proofs barrier via polynomial identity testing"
    - "membership in moment polytopes is in np and conp"
    - "on vanishing of kronecker coefficients"
    - "geometric complexity theory and matrix powering"
    - "no occurrence obstructions in geometric complexity theory"

Connected through hyperedge HE-3 (induced by source paper "on geometric complexity theory multiplicity obstructions are stronger than occurrence obstructions"):
  with members:
    - "no occurrence obstructions in geometric complexity theory"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "explicit lower bounds via geometric complexity theory"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-4 (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"
    - "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"
    - "a lower bound for the determinantal complexity of a hypersurface"

Connected through hyperedge HE-5 (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"
    - "binary determinantal complexity"
    - "bi polynomial rank and determinantal complexity"
    - "permanent versus determinant obstructions and kronecker coefficients"
    - "a lower bound for the determinantal complexity of a hypersurface"
    - "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-6 (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"
    - "binary determinantal complexity"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "bi polynomial rank and determinantal complexity"
    - "a lower bound for the determinantal complexity of a hypersurface"
    - "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)