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 "dimension reduction techniques for ell_p 1 le p infty with applications"):
  Abstract: For Euclidean space ($\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\ell_p$ spaces $1 \le p \le 2$. Although strong lower bounds are known for dimension reduction in $\ell_1$, Ostrovsky and Rabani successfully circumvented these by presenting an $\ell_1$ embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to $\ell_1$ and do not naturally extend to other norms. #R##N#In this paper, we apply a range of advanced techniques and produce bounded range dimension reduction embeddings for all of $1 \le p \le 2$, thereby demonstrating that the approach initiated by Ostrovsky and Rabani for $\ell_1$ can be extended to a much more general framework. We also obtain improved bounds in terms of the intrinsic dimensionality. As a result we achieve improved bounds for proximity problems including snowflake embeddings and clustering.

Includes members:
  Member "approximate nearest neighbor search in ell_p":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "light spanners for high dimensional norms via stochastic decompositions")
  Member "fast precise and dynamic distance queries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on strong diameter padded decompositions")
  Member "a nonlinear approach to dimension reduction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme")
  Member "fast construction of nets in low dimensional metrics and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a data dependent algorithm for querying earth mover s distance with low doubling dimension")
  Member "entropy based nearest neighbor search in high dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithms for similarity search and pseudorandomness")
  Member "minimum enclosing polytope in high dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "minimum enclosing ball revisited stability sub linear time algorithms and extension")

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.CG(Computational Geometry)