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 "sparsification of two variable valued csps"):
  Abstract: A valued constraint satisfaction problem (VCSP) instance $(V,\Pi,w)$ is a set of variables $V$ with a set of constraints $\Pi$ weighted by $w$. Given a VCSP instance, we are interested in a re-weighted sub-instance $(V,\Pi'\subset \Pi,w')$ such that preserves the value of the given instance (under every assignment to the variables) within factor $1\pm\epsilon$. A well-studied special case is cut sparsification in graphs, which has found various applications. #R##N#We show that a VCSP instance consisting of a single boolean predicate $P(x,y)$ (e.g., for cut, $P=\mbox{XOR}$) can be sparsified into $O(|V|/\epsilon^2)$ constraints if and only if the number of inputs that satisfy $P$ is anything but one (i.e., $|P^{-1}(1)| \neq 1$). Furthermore, this sparsity bound is tight unless $P$ is a relatively trivial predicate. We conclude that also systems of 2SAT (or 2LIN) constraints can be sparsified.

Includes members:
  Member "sparse sums of positive semidefinite matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a spectral approach to network design")
  Member "on sketching quadratic forms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "sketching cuts in graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "the sketching complexity of graph cuts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sublinear algorithms for maxcut and correlation clustering")
  Member "a sketching algorithm for spectral graph sparsification":
    also connected through other hyperedges:
      (none)
  Member "fast approximation algorithms for cut based problems in undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "graph sparsification in the semi streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "twice ramanujan sparsifiers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sketching transformed matrices with applications to natural language processing")

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)