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 vii nonstandard quantum group for the plethysm problem"
  Abstract: This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group can be used to derive the positive Littlewood-Richardson rule for arbitrary complex semisimple Lie groups. The sequel \cite{GCT8} gives conjecturally correct algorithms to construct canonical bases of the coordinate rings of these nonstandard quantum groups and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra. A positive $#P$-formula for the plethysm constant follows from the conjectural properties of these canonical bases and the duality and reciprocity conjectures herein.

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"
    - "on vanishing of kronecker coefficients"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "explicit proofs and the flip"):
  with members:
    - "geometric complexity theory viii on canonical bases for the nonstandard quantum groups"
    - "geometric complexity theory v on deciding nonvanishing of a generalized littlewood richardson coefficient"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-3 (induced by source paper "an overview of mathematical issues arising in the geometric complexity theory approach to vp v s vnp"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "geometric complexity theory and tensor rank"
    - "geometric complexity theory vi the flip via saturated and positive integer programming in representation theory and algebraic geometry"
    - "geometric complexity theory v on deciding nonvanishing of a generalized littlewood richardson coefficient"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-4 (induced by source paper "on p vs np geometric complexity theory explicit proofs and the complexity barrier"):
  with members:
    - "on p vs np geometric complexity theory and the riemann hypothesis"
    - "geometric complexity theory viii on canonical bases for the nonstandard quantum groups"
    - "geometric complexity theory v on deciding nonvanishing of a generalized littlewood richardson coefficient"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-5 (induced by source paper "on p vs np geometric complexity theory and the riemann hypothesis"):
  with members:
    - "geometric complexity theory viii on canonical bases for the nonstandard quantum groups"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-6 (induced by source paper "geometric complexity theory vi the flip via saturated and positive integer programming in representation theory and algebraic geometry"):
  with members:
    - "geometric complexity theory viii on canonical bases for the nonstandard quantum groups"
    - "geometric complexity theory v on deciding nonvanishing of a generalized littlewood richardson coefficient"
    - "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)