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 "almost tight bounds for eliminating depth cycles in three dimensions"):
  Abstract: Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case. #R##N#Previous results on this topic could only handle restricted cases of the problem (such as handling only triangular cycles, by Aronov, Koltun, and Sharir (2005), or only cycles in grid-like patterns, by Chazelle et al. (1992)), and the bounds were considerably weaker---much closer to the trivial quadratic bound. #R##N#Our proof uses a recent variant of the polynomial partitioning technique, due to Guth, and some simple tools from algebraic geometry. It is much more straightforward than the previous "purely combinatorial" methods. #R##N#Our technique can be extended to eliminating all cycles in the depth relation among segments, and among constant-degree algebraic arcs. We hope that a suitable extension of this technique could be used to handle the much more difficult case of pairwise-disjoint triangles. #R##N#We also discuss several algorithms for constructing a small set of cuts so as to eliminate all depth-relation cycles among the lines (minimizing such a set, for the case of line segments, is known to be NP-complete). The performance of these algorithms improves due to our new bound, but, so far, none of them both (a) produce close to $n^{3/2}$ cuts, and (b) run in time close to $n^{3/2}$, in the worst case. #R##N#Our results almost completely settle a 35-year-old open problem in computational geometry, motivated by hidden-surface removal in computer graphics.

Includes members:
  Member "removing depth order cycles among triangles an efficient algorithm generating triangular fragments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructive polynomial partitioning for algebraic curves in mathbb r 3 with applications")
  Member "eliminating depth cycles among triangles in three dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructive polynomial partitioning for algebraic curves in mathbb r 3 with applications")
  Member "on range searching with semialgebraic sets ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithmic and geometric aspects of data depth with focus on β skeleton depth")
  Member "on lines and joints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "homotheties and incidences")

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)