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 vanishing of kronecker coefficients"
  Abstract: We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood–Richardson coefficients. Our result establishes in a formal way that Kronecker coefficients are more difficult than Littlewood–Richardson coefficients, unless P = NP.

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"
    - "geometric complexity theory and matrix powering"
    - "no occurrence obstructions in geometric complexity theory"
    - "permanent versus determinant not via saturations"
    - "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"
    - "geometric complexity theory and matrix powering"
    - "no occurrence obstructions in geometric complexity theory"
    - "permanent versus determinant not via saturations"

Connected through hyperedge HE-3 (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"
    - "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"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "computing multiplicities of lie group representations"

Connected through hyperedge HE-4 (induced by source paper "membership in moment polytopes is in np and conp"):
  with members:
    - "computing multiplicities of lie group representations"
    - "geometric complexity theory vi the flip via saturated and positive integer programming in representation theory and algebraic geometry"

Connected through hyperedge HE-5 (induced by source paper "no occurrence obstructions in geometric complexity theory"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "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"
    - "a lower bound for the determinantal complexity of a hypersurface"

Connected through hyperedge HE-6 (induced by source paper "np hard sets are not sparse unless p np an exposition of a simple proof of mahaney s theorem with applications"):
  with members:
    - "no occurrence obstructions in geometric complexity theory"
    - "classic nintendo games are computationally hard"
    - "explicit lower bounds via geometric complexity theory"

Connected through hyperedge HE-7 (induced by source paper "rectangular kronecker coefficients and plethysms in geometric complexity theory"):
  with members:
    - "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"
    - "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-8 (induced by source paper "permanent versus determinant obstructions and kronecker coefficients"):
  with members:
    - "membership in moment polytopes is in np and conp"
    - "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"
    - "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)