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 faster algorithm for the discrete frechet distance under translation"):
  Abstract: The discrete Frechet distance is a useful similarity measure for comparing two sequences of points P = (p1;:::;pm) and Q = (q1;:::;qn). In many applications, the quality of the matching can be improved if we letQ undergo some transformation relative toP . In this paper we consider the problem of finding a translation of Q that brings the discrete Frechet distance between P and Q to a minimum. We devise an algorithm that computes the minimum discrete Frechet distance under translation in R 2 , and runs in O(m 3 n 2 (1 + log(n=m)) log(m + n)) time, assuming m n. This improves a previous algorithm of Jiang et al. [10], which runs inO(m 3 n 3 log(m +n)) time.

Includes members:
  Member "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails":
    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 "four soviets walk the dog with an application to alt s conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fresh fr echet similarity with hashing")
  Member "computing the discrete fr echet distance in subquadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient nearest neighbor query and clustering of planar curves")

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)