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 "fresh fr echet similarity with hashing"):
  Abstract: This paper studies the $r$-range search problem for curves under the continuous Frechet distance: given a dataset $S$ of $n$ polygonal curves and a threshold $r>0$, construct a data structure that, for any query curve $q$, efficiently returns all entries in $S$ with distance at most $r$ from $q$. We propose FRESH, an approximate and randomized approach for $r$-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning step based on a cascade of curve simplifications. We experimentally compare \fresh to exact and deterministic solutions, and we show that high performance can be reached by suitably relaxing precision and recall.

Includes members:
  Member "approximate nearest neighbor search in high dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "copt coordinated optimal transport on graphs")
  Member "a fast implementation of near neighbors queries for frechet distance gis cup":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random projections and sampling algorithms for clustering of high dimensional polygonal curves")
  Member "locality sensitive hashing of curves":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the gaussiansketch for almost relative error kernel distance")
  Member "on the complexity of range searching among curves":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sublinear data structures for short fr echet queries")
  Member "products of euclidean metrics and applications to proximity questions among curves":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic time warping in strongly subquadratic time algorithms for the low distance regime and approximate evaluation")
  Member "fast locality sensitive hashing for approximate near neighbor search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithms for similarity search and pseudorandomness")
  Member "fast locality sensitive hashing frameworks for approximate near neighbor search":
    also connected through other hyperedges:
      (none)
  Member "spatio temporal analysis of team sports":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fsd 10 a dataset for competitive sports content analysis")

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)