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 "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.

Includes members:
  Member "membership in moment polytopes is in np and conp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "rectangular kronecker coefficients and plethysms in geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "permanent versus determinant obstructions and kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "computing multiplicities of lie group representations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "explicit lower bounds via geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "explicit proofs and the flip":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unifying known lower bounds via geometric complexity theory")
  Member "an overview of mathematical issues arising in the geometric complexity theory approach to vp v s vnp":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "geometric complexity theory iv nonstandard quantum group for the kronecker problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "unifying known lower bounds via geometric complexity theory")

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)