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 "hardness of approximate nearest neighbor search"):
  Abstract: We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every $\delta>0$ there exists a constant $\epsilon>0$ such that computing a $(1+\epsilon)$-approximation to the Bichromatic Closest Pair requires $n^{2-\delta}$ time. In particular, this implies a near-linear query time for Approximate Nearest Neighbor search with polynomial preprocessing time. #R##N#Our reduction uses the Distributed PCP framework of [ARW'17], but obtains improved efficiency using Algebraic Geometry (AG) codes. Efficient PCPs from AG codes have been constructed in other settings before [BKKMS'16, BCGRS'17], but our construction is the first to yield new hardness results.

Includes members:
  Member "on the hardness of approximate and exact bichromatic maximum inner product":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating subset sum is equivalent to min plus convolution")
  Member "distributed pcp theorems for hardness of approximation in p":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "optimal las vegas locality sensitive data structures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "randomized approximate nearest neighbor search with limited adaptivity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lower bounds on time space trade offs for approximate near neighbors")
  Member "the curse of medium dimension for geometric problems in almost every norm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed pcp theorems for hardness of approximation in p")
  Member "optimal hashing based time space trade offs for approximate near neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the i o complexity of the k nearest neighbor problem")
  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 "a faster subquadratic algorithm for finding outlier correlations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "subsets and supermajorities unifying hashing based set similarity search")

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.CC(Computational Complexity)