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 "sum of squares lower bounds from symmetry and a good story"):
  Abstract: In this paper, we develop machinery for proving sum of squares lower bounds on symmetric problems based on the intuition that sum of squares has difficulty capturing integrality arguments, i.e. arguments that an expression must be an integer. Using this machinery, we prove a tight sum of squares lower bound for the following Turan type problem: Minimize the number of triangles in a graph $G$ with a fixed edge density. We also give an alternative proof of Grigoriev's sum of squares lower bound for the knapsack problem.

Includes members:
  Member "sum of squares lower bounds for refuting any csp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sum of squares meets square loss fast rates for agnostic tensor completion")
  Member "a nearly tight sum of squares lower bound for the planted clique problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators")
  Member "on the sum of squares degree of symmetric quadratic functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight sum of squares lower bounds for binary polynomial optimization problems")
  Member "sum of squares lower bounds from pairwise independence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking symmetries to rescue sum of squares the case of makespan scheduling")
  Member "dictionary learning and tensor decomposition via the sum of squares method":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "rounding sum of squares relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)