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: "rounding semidefinite programming hierarchies via global correlation"
  Abstract: We show a new way to round vector solutions of semidefinite programming (SDP) hierarchies into integral solutions, based on a connection between these hierarchies and the spectrum of the input graph. We demonstrate the utility of our method by providing a new SDP-hierarchy based algorithm for constraint satisfaction problems with 2-variable constraints (2-CSP's). #R##N#More concretely, we show for every 2-CSP instance I a rounding algorithm for r rounds of the Lasserre SDP hierarchy for I that obtains an integral solution that is at most \eps worse than the relaxation's value (normalized to lie in [0,1]), as long as r > k\cdot\rank_{\geq \theta}(\Ins)/\poly(\e) \;, where k is the alphabet size of I, $\theta=\poly(\e/k)$, and $\rank_{\geq \theta}(\Ins)$ denotes the number of eigenvalues larger than $\theta$ in the normalized adjacency matrix of the constraint graph of $\Ins$. #R##N#In the case that $\Ins$ is a \uniquegames instance, the threshold $\theta$ is only a polynomial in $\e$, and is independent of the alphabet size. Also in this case, we can give a non-trivial bound on the number of rounds for \emph{every} instance. In particular our result yields an SDP-hierarchy based algorithm that matches the performance of the recent subexponential algorithm of Arora, Barak and Steurer (FOCS 2010) in the worst case, but runs faster on a natural family of instances, thus further restricting the set of possible hard instances for Khot's Unique Games Conjecture. #R##N#Our algorithm actually requires less than the $n^{O(r)}$ constraints specified by the $r^{th}$ level of the Lasserre hierarchy, and in some cases $r$ rounds of our program can be evaluated in time $2^{O(r)}\poly(n)$.

Connected through hyperedge HE-1 (induced by source paper "new dependencies of hierarchies in polynomial optimization"):
  with members:
    - "optimization over the boolean hypercube via sums of nonnegative circuit polynomials"
    - "on the bit complexity of sum of squares proofs"
    - "exact tensor completion with sum of squares"
    - "fast and robust tensor decomposition with applications to dictionary learning"
    - "the power of sherali adams relaxations for general valued csps"
    - "a 1 epsilon approximation for makespan scheduling with precedence constraints using lp hierarchies"
    - "noisy tensor completion via the sum of squares hierarchy"
    - "fast spectral algorithms from sum of squares proofs tensor decomposition and planted sparse vectors"

Connected through hyperedge HE-2 (induced by source paper "approximating constraint satisfaction problems on high dimensional expanders"):
  with members:
    - "agreement testing theorems on layered set systems"
    - "good distance lattices from high dimensional expanders"
    - "log concave polynomials ii high dimensional walks and an fpras for counting bases of a matroid"
    - "sum of squares lower bounds for refuting any csp"
    - "high dimensional random walks and colorful expansion"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "a new regularity lemma and faster approximation algorithms for low threshold rank graphs"
    - "faster sdp hierarchy solvers for local rounding algorithms"

Connected through hyperedge HE-3 (induced by source paper "lasserre integrality gaps for graph spanners and related problems"):
  with members:
    - "characterizing demand graphs for fixed parameter shallow light steiner network"
    - "approximating spanners and directed steiner forest upper and lower bounds"
    - "parallel metric tree embedding based on an algebraic view on moore bellman ford"
    - "everywhere sparse spanners via dense subgraphs"
    - "label cover instances with large girth and the hardness of approximating basic k spanner"
    - "fault tolerant spanners better and simpler"
    - "directed steiner tree and the lasserre hierarchy"
    - "directed spanners via flow based linear programs"

Connected through hyperedge HE-4 (induced by source paper "approximation algorithms for partially colorable graphs"):
  with members:
    - "a new algorithm for the robust semi random independent set problem"
    - "does robustness imply tractability a lower bound for planted clique in the semi random model"
    - "on the effect of randomness on planted 3 coloring models"
    - "combinatorial coloring of 3 colorable graphs"
    - "faster parameterized algorithms using linear programming"
    - "approximate graph coloring by semidefinite programming"

Connected through hyperedge HE-5 (induced by source paper "subexponential lps approximate max cut"):
  with members:
    - "sherali adams strikes back"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "approximation limits of linear programs beyond hierarchies"
    - "approximating csps with global cardinality constraints using sdp hierarchies"

Connected through hyperedge HE-6 (induced by source paper "matrix decompositions and sparse graph regularity"):
  with members:
    - "a new regularity lemma and faster approximation algorithms for low threshold rank graphs"
    - "faster sdp hierarchy solvers for local rounding algorithms"
    - "approximating non uniform sparsest cut via generalized spectra"

Connected through hyperedge HE-7 (induced by source paper "graph and string parameters connections between pathwidth cutwidth and the locality number"):
  with members:
    - "deterministic regular expressions with back references"
    - "reductions between expansion problems"

Connected through hyperedge HE-8 (induced by source paper "mean field approximation convex hierarchies and the optimality of correlation rounding a unified perspective"):
  with members:
    - "the vertex sample complexity of free energy is polynomial"
    - "the mean field approximation information inequalities algorithms and complexity"
    - "how to calculate partition functions using convex programming hierarchies provable bounds for variational methods"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "sub exponential approximation schemes for csps from dense to almost sparse"
    - "conditioning and covariance on caterpillars"
    - "approximating csps with global cardinality constraints using sdp hierarchies"

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