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 hierarchy lower bounds for symmetric formulations"):
  Abstract: We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive semidefiniteness to the analysis of "well-behaved" univariate polynomial inequalities. #R##N#We illustrate the technique on two problems, one unconstrained and the other with constraints. More precisely, we give a short elementary proof of Grigoriev/Laurent lower bound for finding the integer cut polytope of the complete graph. We also show that the SoS hierarchy requires a non-constant number of rounds to improve the initial integrality gap of 2 for the Min-Knapsack linear program strengthened with cover inequalities.

Includes members:
  Member "tight sum of squares lower bounds for binary polynomial optimization problems":
    also connected through other hyperedges:
      (none)
  Member "on the sum of squares degree of symmetric quadratic functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sum of squares lower bounds from symmetry and a good story")
  Member "on the hardest problem formulations for the 0 1 lasserre hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "breaking symmetries to rescue sum of squares the case of makespan scheduling")
  Member "a lasserre lower bound for the min sum single machine scheduling problem":
    also connected through other hyperedges:
      (none)
  Member "sum of squares lower bounds from pairwise independence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "breaking symmetries to rescue sum of squares the case of makespan scheduling")
  Member "sum of squares lower bounds for planted clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators")
  Member "a 4 approximation for scheduling on a single machine with general cost function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scheduling to approximate minimization objectives on identical machines")
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")

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.DS(Data Structures and Algorithms)