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 "coveringlsh locality sensitive hashing without false negatives"):
  Abstract: We consider a new construction of locality-sensitive hash functions for Hamming space that is \emph{covering} in the sense that is it guaranteed to produce a collision for every pair of vectors within a given radius $r$. The construction is \emph{efficient} in the sense that the expected number of hash collisions between vectors at distance~$cr$, for a given $c>1$, comes close to that of the best possible data independent LSH without the covering guarantee, namely, the seminal LSH construction of Indyk and Motwani (STOC '98). The efficiency of the new construction essentially \emph{matches} their bound when the search radius is not too large --- e.g., when $cr = o(\log(n)/\log\log n)$, where $n$ is the number of points in the data set, and when $cr = \log(n)/k$ where $k$ is an integer constant. In general, it differs by at most a factor $\ln(4)$ in the exponent of the time bounds. As a consequence, LSH-based similarity search in Hamming space can avoid the problem of false negatives at little or no cost in efficiency.

Includes members:
  Member "optimal las vegas locality sensitive data structures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "optimal hashing based time space trade offs for approximate near neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the i o complexity of the k nearest neighbor problem")
  Member "scalability and total recall with fast coveringlsh":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal las vegas approximate near neighbors in ell_p")
  Member "tradeoffs for nearest neighbors on the sphere":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithms for similarity search and pseudorandomness")
  Member "optimal data dependent hashing for approximate near neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "autoblock a hands off blocking framework for entity matching")
  Member "probabilistic polynomials and hamming nearest neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithms for similarity search and pseudorandomness")
  Member "beyond locality sensitive hashing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic streaming spectral sparsification in nearly linear time and space")
  Member "optimal lower bounds for locality sensitive hashing except when q is tiny":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on deep hashing methods")

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)