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 "certifying random polynomials over the unit sphere via sum of squares hierarchy"):
  Abstract: Given a random n-variate degree-d homogeneous polynomial f , we study the following problem:

Includes members:
  Member "strongly refuting random csps below the spectral threshold":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "time space tradeoffs for distinguishing distributions and applications to security of goldreich s prg")
  Member "tensor principal component analysis via sum of squares proofs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational hardness of certifying bounds on constrained pca problems")
  Member "dictionary learning and tensor decomposition via the sum of squares method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "a statistical model for tensor pca":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "community detection on mixture multi layer networks via regularized tensor decomposition")
  Member "rounding sum of squares relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "hypercontractivity sum of squares proofs and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sum of squares bounds for the ordering principle")

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)