human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "map matching with simplicity constraints"
  Abstract: We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path according to this measure. However, these methods cannot guarantee that the result is simple (i.e. it does not intersect itself) even if the given curve is simple. In this paper, we prove that it is in fact NP-complete to determine the existence a simple cycle in a planar straight-line embedding of a graph that has at most a given Fr\'echet distance to a given simple closed curve. We also consider the implications of our proof on some variants of the problem.

Connected through hyperedge HE-1 (induced by source paper "sampling based bottleneck pathfinding with applications to frechet matching"):
  with members:
    - "new perspective on sampling based motion planning via random geometric graphs"
    - "computing the frechet distance with a retractable leash"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "on the hardness of unlabeled multi robot motion planning"
    - "asymptotically optimal motion planning using lower bounds on cost"
    - "efficient high quality motion planning by fast all pairs r nearest neighbors"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"

Connected through hyperedge HE-2 (induced by source paper "discretized approaches to schematization"):
  with members:
    - "solving the maximum weight connected subgraph problem to optimality"
    - "intermittent map matching with the discrete frechet distance"
    - "simple curve embedding"
    - "locally correct frechet matchings"

Question: Please tell me which class the center node 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)