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 "four soviets walk the dog with an application to alt s conjecture"):
  Abstract: Given two polygonal curves in the plane, there are several ways to define a measure of similarity between them. One measure that has been extremely popular in the past is the Frechet distance. Since it has been proposed by Alt and Godau in 1992, many variants and extensions have been described. However, even 20 years later, the original O(n^2 log n) algorithm by Alt and Godau for computing the Frechet distance remains the state of the art (here n denotes the number of vertices on each curve). This has led Helmut Alt to conjecture that the associated decision problem is 3SUM-hard. #R##N#In recent work, Agarwal et al. show how to break the quadratic barrier for the discrete version of the Frechet distance, where we consider sequences of points instead of polygonal curves. Building on their work, we give an algorithm to compute the Frechet distance between two polygonal curves in time O(n^2 (log n)^(1/2) (\log\log n)^(3/2)) on a pointer machine and in time O(n^2 (loglog n)^2) on a word RAM. Furthermore, we show that there exists an algebraic decision tree for the Frechet problem of depth O(n^(2-epsilon)), for some epsilon > 0. This provides evidence that computing the Frechet distance may not be 3SUM-hard after all and reveals an intriguing new aspect of this well-studied problem.

Includes members:
  Member "computing the frechet distance with a retractable leash":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "four soviets walk the dog improved bounds for computing the frechet distance")
  Member "how to walk your dog in the mountains with no magic leash":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "homotopy height grid major height and graph drawing height")
  Member "locally correct frechet matchings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "four soviets walk the dog improved bounds for computing the frechet distance")
  Member "necklaces convolutions and x y":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an improved fptas for 0 1 knapsack")
  Member "on range searching with semialgebraic sets ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithmic and geometric aspects of data depth with focus on β skeleton depth")
  Member "computing the discrete fr echet distance in subquadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient nearest neighbor query and clustering of planar curves")
  Member "can we compute the similarity between surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computing the frechet distance of trees and graphs of bounded tree width")

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)