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 "the computational complexity of plethysm coefficients"):
  Abstract: In two papers, Burgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix multiplication tensor. A key ingredient was information about certain Kronecker coefficients. While tensors are an interesting test bed for GCT ideas, the far-away goal is the separation of algebraic complexity classes. The role of the Kronecker coefficients in that setting is taken by the so-called plethysm coefficients: These are the multiplicities in the coordinate rings of spaces of polynomials. Even though several hardness results for Kronecker coefficients are known, there are almost no results about the complexity of computing the plethysm coefficients or even deciding their positivity. #R##N#In this paper we show that deciding positivity of plethysm coefficients is NP-hard, and that computing plethysm coefficients is #P-hard. In fact, both problems remain hard even if the inner parameter of the plethysm coefficient is fixed. In this way we obtain an inner versus outer contrast: If the outer parameter of the plethysm coefficient is fixed, then the plethysm coefficient can be computed in polynomial time. #R##N#Moreover, we derive new lower and upper bounds and in special cases even combinatorial descriptions for plethysm coefficients, which we consider to be of independent interest. Our technique uses discrete tomography in a more refined way than the recent work on Kronecker coefficients by Ikenmeyer, Mulmuley, and Walter (Comput Compl 2017). This makes our work the first to apply techniques from discrete tomography to the study of plethysm coefficients. Quite surprisingly, that interpretation also leads to new equalities between certain plethysm coefficients and Kronecker coefficients.

Includes members:
  Member "on geometric complexity theory multiplicity obstructions are stronger than occurrence obstructions":
    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 "implementing geometric complexity theory on the separation of orbit closures via symmetries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of evaluating highest weight vectors")
  Member "on vanishing of kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "geometric complexity theory and matrix powering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "no occurrence obstructions in geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "permanent versus determinant not via saturations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "implementing geometric complexity theory on the separation of orbit closures via symmetries")
  Member "permanent versus determinant obstructions and kronecker coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on vanishing of kronecker 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)