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: "geometric complexity theory iv nonstandard quantum group for the kronecker problem"
  Abstract: The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W), where V, W are \mathbb{C}-vector spaces and X = V \otimes W. A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for these coefficients. #R##N#We construct two quantum objects for this problem, which we call the nonstandard quantum group and nonstandard Hecke algebra. We show that the nonstandard quantum group has a compact real form and its representations are completely reducible, that the nonstandard Hecke algebra is semisimple, and that they satisfy an analog of quantum Schur-Weyl duality. #R##N#Using these nonstandard objects as a guide, we follow the approach of Adsul, Sohoni, and Subrahmanyam to construct, in the case dim(V) = dim(W) =2, a representation \check{X}_\nu of the nonstandard quantum group that specializes to Res_{GL(V) \times GL(W)} X_\nu at q=1. We then define a global crystal basis +HNSTC(\nu) of \check{X}_\nu that solves the two-row Kronecker problem: the number of highest weight elements of +HNSTC(\nu) of weight (\lambda,\mu) is the Kronecker coefficient g_{\lambda \mu \nu}. We go on to develop the beginnings of a graphical calculus for this basis, along the lines of the U_q(\sl_2) graphical calculus, and use this to organize the crystal components of +HNSTC(\nu) into eight families. This yields a fairly simple, explicit and positive formula for two-row Kronecker coefficients, generalizing a formula of Brown, van Willigenburg, and Zabrocki. As a byproduct of the approach, we also obtain a rule for the decomposition of Res_{GL_2 \times GL_2 \rtimes \S_2} X_\nu into irreducibles.

Connected through hyperedge HE-1 (induced by source paper "on vanishing of kronecker coefficients"):
  with members:
    - "membership in moment polytopes is in np and conp"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "permanent versus determinant obstructions and kronecker coefficients"
    - "computing multiplicities of lie group representations"
    - "explicit lower bounds via geometric complexity theory"
    - "explicit proofs and the flip"
    - "an overview of mathematical issues arising in the geometric complexity theory approach to vp v s vnp"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-2 (induced by source paper "unifying known lower bounds via geometric complexity theory"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "lower bounds for the circuit size of partially homogeneous polynomials"
    - "using elimination theory to construct rigid matrices"
    - "equations for lower bounds on border rank"
    - "complexity of linear circuits and geometry"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "natural proofs versus derandomization"
    - "explicit lower bounds via geometric complexity theory"

Connected through hyperedge HE-3 (induced by source paper "geometric complexity theory v efficient algorithms for noether normalization"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "unifying known lower bounds via geometric complexity theory"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "arithmetic circuits and the hadamard product of polynomials"
    - "the multivariate resultant is np hard in any characteristic"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

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)