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 "set similarity search for skewed data"):
  Abstract: Set similarity join, as well as the corresponding indexing problem set similarity search, are fundamental primitives for managing noisy or uncertain data. For example, these primitives can be used in data cleaning to identify different representations of the same object. In many cases one can represent an object as a sparse 0-1 vector, or equivalently as the set of nonzero entries in such a vector. A set similarity join can then be used to identify those pairs that have an exceptionally large dot product (or intersection, when viewed as sets). We choose to focus on identifying vectors with large Pearson correlation, but results extend to other similarity measures. In particular, we consider the indexing problem of identifying correlated vectors in a set S of vectors sampled from {0,1}^d. Given a query vector y and a parameter alpha in (0,1), we need to search for an alpha-correlated vector x in a data structure representing the vectors of S. This kind of similarity search has been intensely studied in worst-case (non-random data) settings. #R##N#Existing theoretically well-founded methods for set similarity search are often inferior to heuristics that take advantage of skew in the data distribution, i.e., widely differing frequencies of 1s across the d dimensions. The main contribution of this paper is to analyze the set similarity problem under a random data model that reflects the kind of skewed data distributions seen in practice, allowing theoretical results much stronger than what is possible in worst-case settings. Our indexing data structure is a recursive, data-dependent partitioning of vectors inspired by recent advances in set similarity search. Previous data-dependent methods do not seem to allow us to exploit skew in item frequencies, so we believe that our work sheds further light on the power of data dependence.

Includes members:
  Member "distributed pcp theorems for hardness of approximation in p":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "embedjoin efficient edit similarity joins via embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "monotonic cardinality estimation of similarity selection a deep learning approach")
  Member "scalable and robust set similarity join":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "blocking and filtering techniques for entity resolution a survey")
  Member "a framework for similarity search with space time tradeoffs using locality sensitive filtering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lsf join locality sensitive filtering for distributed all pairs set similarity under skew")
  Member "optimal hashing based time space trade offs for approximate near neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the i o complexity of the k nearest neighbor problem")
  Member "on the complexity of inner product similarity join":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lsf join locality sensitive filtering for distributed all pairs set similarity under skew")
  Member "polynomial representations of threshold functions and algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating text to pattern hamming distances")
  Member "explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a faster algorithm enumerating relevant features over finite fields")

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)