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 "approximating unweighted tree augmentation via lift and project part i stemless tap"):
  Abstract: In Part I, we study a special case of the unweighted Tree Augmentation Problem (TAP) via the Lasserre (Sum of Squares) system. In the special case, we forbid so-called stems; these are a particular type of subtree configuration. For stemless TAP, we prove that the integrality ratio of an SDP relaxation (the Lasserre tightening of an LP relaxation) is $\leq \frac{3}{2}+\epsilon$, where $\epsilon>0$ can be any small constant. We obtain this result by designing a polynomial-time algorithm for stemless TAP that achieves an approximation guarantee of ($\frac32+\epsilon$) relative to the SDP relaxation. The algorithm is combinatorial and does not solve the SDP relaxation, but our analysis relies on the SDP relaxation. #R##N#We generalize the combinatorial analysis of integral solutions from the previous literature to fractional solutions by identifying some properties of fractional solutions of the Lasserre system via the decomposition result of Karlin, Mathieu and Nguyen (IPCO 2011). #R##N#Also, we present an example of stemless TAP such that the approximation guarantee of $\frac32$ is tight for the algorithm. #R##N#In Part II of this paper, we extend the methods of Part I to prove the same results relative to the same SDP relaxation for TAP.

Includes members:
  Member "approximating unweighted tree augmentation via lift and project part 0 1 8 e approximation for unweighted tap":
    also connected through other hyperedges:
      (none)
  Member "a 1 75 lp approximation for the tree augmentation problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coloring down 3 2 approximation for special cases of the weighted tree augmentation problem")
  Member "a simplified 1 5 approximation algorithm for augmenting edge connectivity of a graph from 1 to 2":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "2 node connectivity network design")
  Member "directed steiner tree and the lasserre hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polylogarithmic approximation algorithm for k connected directed steiner tree on quasi bipartite graphs")
  Member "integrality gaps of linear and semi definite programming relaxations for knapsack":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking symmetries to rescue sum of squares the case of makespan scheduling")

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)