human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "no occurrence obstructions in geometric complexity theory"):
  Abstract: The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a strengthened version of this conjecture over the complex numbers that amounts to separating the orbit closures of the determinant and padded permanent polynomials. In that paper it was also proposed to separate these orbit closures by exhibiting occurrence obstructions, which are irreducible representations of GL_{n^2}(C), which occur in one coordinate ring of the orbit closure, but not in the other. We prove that this approach is impossible. However, we do not rule out the general approach to the permanent versus determinant problem via multiplicity obstructions as proposed by Mulmuley and Sohoni.

Includes members:
  Member "the complexity of factors of multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "on vanishing of kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "geometric complexity theory and matrix powering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "permanent versus determinant not via saturations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "binary determinantal complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "permanent versus determinant not via saturations")
  Member "rectangular kronecker coefficients and plethysms in geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "bi polynomial rank and determinantal complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rectangular kronecker coefficients and plethysms in geometric complexity theory")
  Member "permanent versus determinant obstructions and kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the computational complexity of plethysm coefficients")

Question: Please tell me which class the source paper 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)