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 "routing in histograms"):
  Abstract: Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points $p$ and $q$ in $P$ are co-visible if and only if the (axis-parallel) rectangle spanned by $p$ and $q$ completely lies in $P$. In the $r$-visibility graph $G(P)$ of $P$, we connect two vertices of $P$ with an edge if and only if they are co-visible. #R##N#We consider routing with preprocessing in $G(P)$. We may preprocess $P$ to obtain a label and a routing table for each vertex of $P$. Then, we must be able to route a packet between any two vertices $s$ and $t$ of $P$, where each step may use only the label of the target node $t$, the routing table and neighborhood of the current node, and the packet header. #R##N#We present a routing scheme for double histograms that sends any data packet along a path whose length is at most twice the (unweighted) shortest path distance between the endpoints. In our scheme, the labels, routing tables, and headers need $O(\log n)$ bits. For the case of simple histograms, we obtain a routing scheme with optimal routing paths, $O(\log n)$-bit labels, one-bit routing tables, and no headers.

Includes members:
  Member "plane hop spanners for unit disk graphs simpler and better":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a short proof of the toughness of delaunay triangulations")
  Member "routing in unit disk graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "routing in polygonal domains")
  Member "routing in polygonal domains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "routing in unit disk graphs without dynamic headers")
  Member "constant approximation algorithms for guarding simple polygons using vertex guards":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "optimal local routing on delaunay triangulations defined by empty equilateral triangles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "expected complexity of routing in theta 6 and half theta 6 graphs")
  Member "new routing techniques and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "routing in unit disk graphs without dynamic headers")
  Member "competitive local routing with constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "routing on the visibility graph")
  Member "approximability of guarding weak visibility polygons":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the parameterized complexity of guarding almost convex polygons")

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)