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 "a new algorithm for finding closest pair of vectors"):
  Abstract: Given $n$ vectors $x_0, x_1, \ldots, x_{n-1}$ in $\{0,1\}^{m}$, how to find two vectors whose pairwise Hamming distance is minimum? This problem is known as the Closest Pair Problem. If these vectors are generated uniformly at random except two of them are correlated with Pearson-correlation coefficient $\rho$, then the problem is called the Light Bulb Problem. In this work, we propose a novel coding-based scheme for the Close Pair Problem. We design both randomized and deterministic algorithms, which achieve the best-known running time when the minimum distance is very small compared to the length of input vectors. When applied to the Light Bulb Problem, our algorithms yields state-of-the-art deterministic running time when the Pearson-correlation coefficient $\rho$ is very large.

Includes members:
  Member "an illuminating algorithm for the light bulb problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a faster algorithm enumerating relevant features over finite fields")
  Member "fast feasible and unfeasible matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new ways to multiply 3 x 3 matrices")
  Member "distributed pcp theorems for hardness of approximation in p":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "generating families of practical fast matrix multiplication algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strassen s 2x2 matrix multiplication algorithm a conceptual perspective")
  Member "polynomial representations of threshold functions and algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "a faster algorithm enumerating relevant features over finite fields")
  Member "a faster subquadratic algorithm for finding outlier correlations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subsets and supermajorities unifying hashing based set similarity search")
  Member "probabilistic polynomials and hamming nearest neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algorithms for similarity search and pseudorandomness")

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)