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 polygonal domains"):
  Abstract: We consider the problem of routing a data packet through the visibility graph of a polygonal domain $P$ with $n$ vertices and $h$ holes. 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 data packet between any two vertices $p$ and $q$ of $P$, where each step must use only the label of the target node $q$ and the routing table of the current node. #R##N#For any fixed $\varepsilon > 0$, we present a routing scheme that always achieves a routing path whose length exceeds the shortest path by a factor of at most $1 + \varepsilon$. The labels have $O(\log n)$ bits, and the routing tables are of size $O((\varepsilon^{-1}+h)\log n)$. The preprocessing time is $O(n^2\log n)$. It can be improved to $O(n^2)$ for simple polygons.

Includes members:
  Member "routing in unit disk graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "routing in histograms")
  Member "routing on the visibility graph":
    also connected through other hyperedges:
      (none)
  Member "constrained routing between non visible vertices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "routing on the visibility graph")
  Member "the θ 5 graph is a spanner":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximum matchings and minimum blocking sets in θ 6 graphs")
  Member "towards tight bounds on theta graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "expected complexity of routing in theta 6 and half theta 6 graphs")
  Member "optimal local routing on delaunay triangulations defined by empty equilateral triangles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "routing in histograms")
  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 in histograms")

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)