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 viii on canonical bases for the nonstandard quantum groups"
  Abstract: This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra therein. These are generalizations of the canonical bases of the irreducible polynomial representations and the matrix coordinate ring of the standard quantum group, as constructed by Kashiwara and Lusztig, and the Kazhdan-Lusztig basis of the Hecke algebra. A positive ($#P$-) formula for the well-known plethysm constants follows from their conjectural properties and the duality and reciprocity conjectures in \cite{GCT7}.

Connected through hyperedge HE-1 (induced by source paper "explicit proofs and the flip"):
  with members:
    - "geometric complexity theory vii nonstandard quantum group for the plethysm problem"
    - "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-2 (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 vii nonstandard quantum group for the plethysm problem"
    - "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 "on p vs np geometric complexity theory and the riemann hypothesis"):
  with members:
    - "geometric complexity theory vii nonstandard quantum group for the plethysm problem"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-4 (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 vii nonstandard quantum group for the plethysm problem"
    - "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)