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 "nearly optimal edge estimation with independent set queries"):
  Abstract: We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+\epsilon)$-approximation of the number of edges $m$ of the graph using $\min(\sqrt{m},n / \sqrt{m})\cdot\textrm{poly}(\log n,1/\epsilon)$ independent set queries. This improves the upper bound of $\min(\sqrt{m},n^2/m)\cdot\textrm{poly}(\log n,1/\epsilon)$ by Beame et al. \cite{BHRRS18}. Our second main result shows that ${\min(\sqrt{m},n/\sqrt{m}))/\textrm{polylog}(n)}$ independent set queries are necessary, thus establishing that our algorithm is optimal up to a factor of $\textrm{poly}(\log n, 1/\epsilon)$.

Includes members:
  Member "a simple sublinear time algorithm for counting arbitrary subgraphs via edge sampling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear time subgraph counting graph degeneracy and the chasm at size six")
  Member "fiding forbidden minors in sublinear time a o n 1 2 o 1 query one sided tester for minor closed properties on bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a lower bound on cycle finding in sparse digraphs")
  Member "edge estimation with independent set oracles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximately counting and sampling small witnesses using a colourful decision oracle")
  Member "on approximating the number of k cliques in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear time subgraph counting graph degeneracy and the chasm at size six")
  Member "on sampling edges almost uniformly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing and testing small connectivity in near linear time and queries via fast local cut algorithms")
  Member "sublinear time algorithms for counting star subgraphs with applications to join selectivity estimation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sublinear time estimation of degree distribution moments the arboricity connection")
  Member "approximately counting triangles in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "the power of an example hidden set size approximation using group queries and conditional sampling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal randomized group testing algorithm to determine the number of defectives")

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)