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 "weighted maximum independent set of geometric objects in turnstile streams"):
  Abstract: We study the Maximum Independent Set problem for geometric objects given in the data stream model. A set of geometric objects is said to be independent if the objects are pairwise disjoint. We consider geometric objects in one and two dimensions, i.e., intervals and disks. Let $\alpha$ be the cardinality of the largest independent set. Our goal is to estimate $\alpha$ in a small amount of space, given that the input is received as a one-pass turnstile stream. We also consider a generalization of this problem by assigning weights to each object and estimating $\beta$, the largest value of a weighted independent set. We provide the first algorithms for estimating $\alpha$ and $\beta$ in turnstile streams. #R##N#For unit-length intervals, we obtain a $(2+\epsilon)$-approximation to $\alpha$ and $\beta$ in poly$\left(\frac{\log(n)}{\epsilon}\right)$ space. We also show a matching lower bound. For arbitrary-length intervals, we show any $c$-approximation to $\alpha$, and thus also $\beta$, requires $\Omega\left(\frac{n^{1/c}}{2^c}\right)$ space. To this end, we introduce a new communication problem and lower bound its information complexity. In light of the lower bound we provide algorithms for estimating $\alpha$ for arbitrary-length intervals under a bounded intersection assumption. We also study the parameterized space complexity of estimating $\alpha$ and $\beta$, where the parameter is the ratio of maximum to minimum interval length. For unit-radius disks, we obtain a $\left(\frac{8\sqrt{3}}{\pi}\right)$-approximation to $\alpha$ and $\beta$ in $\textrm{poly}\left(\frac{\log(n)}{\epsilon}\right)$ space, which is closely related to the hexagonal circle packing constant.

Includes members:
  Member "optimal streaming and tracking distinct elements with high probability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast hashing with strong concentration bounds")
  Member "independent set size approximation in graph streams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple and local independent set approximation")
  Member "on approximating maximum independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "maximum matching in turnstile streams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "interval selection in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the streaming complexity of fundamental geometric problems")
  Member "space constrained interval selection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the streaming complexity of fundamental geometric problems")

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)