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 "spanning properties of theta theta graphs"):
  Abstract: We study the spanning properties of Theta-Theta graphs. Similar in spirit with the Yao-Yao graphs, Theta-Theta graphs partition the space around each vertex into a set of k cones, for some fixed integer k > 1, and select at most one edge per cone. The difference is in the way edges are selected. Yao-Yao graphs select an edge of minimum length, whereas Theta-Theta graphs select an edge of minimum orthogonal projection onto the cone bisector. It has been established that the Yao-Yao graphs with parameter k = 6k' have spanning ratio 11.67, for k' >= 6. In this paper we establish a first spanning ratio of $7.82$ for Theta-Theta graphs, for the same values of $k$. We also extend the class of Theta-Theta spanners with parameter 6k', and establish a spanning ratio of $16.76$ for k' >= 5. We surmise that these stronger results are mainly due to a tighter analysis in this paper, rather than Theta-Theta being superior to Yao-Yao as a spanner. We also show that the spanning ratio of Theta-Theta graphs decreases to 4.64 as k' increases to 8. These are the first results on the spanning properties of Theta-Theta graphs.

Includes members:
  Member "the θ 5 graph is a spanner":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "expected complexity of routing in theta 6 and half theta 6 graphs")
  Member "the yao graph y_5 is a spanner":
    also connected through other hyperedges:
      (none)
  Member "new and improved spanning ratios for yao graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "truly optimal euclidean spanners")
  Member "on the stretch factor of the theta 4 graph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "routing in polygonal domains")
  Member "an infinite class of sparse yao spanners":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "truly optimal euclidean spanners")
  Member "π 2 angle yao graphs are spanners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truly optimal euclidean 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)