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 "geometric secluded paths and planar satisfiability"):
  Abstract: We consider paths with low "exposure" to a polygonal domain, i.e., paths which are seen as little as possible; we differentiate between "integral" exposure (when we care for how long the path sees every point of the domain) and "0/1" exposure (just counting whether a point is seen by the path or not). For the integral exposure, we give a PTAS for finding the minimum-exposure path between two given points in the domain; for the 0/1 version, we prove that in a simple polygon the shortest path has the minimum exposure, while in domains with holes the problem becomes NP-hard. We also highlight connection of the problem to minimum satisfiability and settle hardness of variants of planar min- and max-SAT.

Includes members:
  Member "on the computational complexity of length and neighborhood constrained path problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "an efficient algorithm for computing high quality paths amid polygonal obstacles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient sampling based bottleneck pathfinding over cost maps")
  Member "on the complexity of minimum link path problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "global curve simplification")
  Member "quickest visibility queries in polygonal domains":
    also connected through other hyperedges:
      (none)
  Member "planar 3 sat with a clause variable cycle":
    also connected through other hyperedges:
      (none)
  Member "a polynomial time algorithm for finding an approximate shortest path amid weighted regions":
    also connected through other hyperedges:
      (none)
  Member "parameterized complexity of secluded connectivity problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "a note on the unsolvability of the weighted region shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient motion planning for problems lacking optimal substructure")

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)