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 "uniform 2d monotone minimum spanning graphs"):
  Abstract: A geometric graph $G$ is $xy-$monotone if each pair of vertices of $G$ is connected by a $xy-$monotone path. We study the problem of producing the $xy-$monotone spanning geometric graph of a point set $P$ that (i) has the minimum cost, where the cost of a geometric graph is the sum of the Euclidean lengths of its edges, and (ii) has the least number of edges, in the cases that the Cartesian System $xy$ is specified or freely selected. Building upon previous results, we easily obtain that the two solutions coincide when the Cartesian System is specified and are both equal to the rectangle of influence graph of $P$. The rectangle of influence graph of $P$ is the geometric graph with vertex set $P$ such that two points $p,q \in P$ are adjacent if and only if the rectangle with corners $p$ and $q$ does not include any other point of $P$. When the Cartesian System can be freely chosen, we note that the two solutions do not necessarily coincide, however we show that they can both be obtained in $O(|P|^3)$ time. We also give a simple $2-$approximation algorithm for the problem of computing the spanning geometric graph of a $k-$rooted point set $P$, in which each root is connected to all the other points (including the other roots) of $P$ by $y-$monotone paths, that has the minimum cost.

Includes members:
  Member "angle monotone graphs construction and local routing":
    also connected through other hyperedges:
      (none)
  Member "drawing a rooted tree as a rooted y monotone minimum spanning tree":
    also connected through other hyperedges:
      (none)
  Member "simple compact monotone tree drawings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "drawing a rooted tree as a rooted y monotone minimum spanning tree")
  Member "angle monotone paths in non obtuse triangulations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the area requirements of planar greedy drawings of triconnected planar graphs")
  Member "optimal monotone drawings of trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "drawing graphs as spanners")
  Member "rooted uniform monotone minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drawing a rooted tree as a rooted y monotone minimum spanning tree")
  Member "gabriel triangulations and angle monotone graphs local routing and recognition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the area requirements of planar greedy drawings of triconnected planar graphs")
  Member "on self approaching and increasing chord drawings of 3 connected planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drawing graphs as spanners")

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)