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 "maximum matchings and minimum blocking sets in θ 6 graphs"):
  Abstract: $\Theta_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is $n/3$, where $n$ is the number of vertices of the graph. Babu et al. (2014) conjectured that any $\Theta_6$-graph has a (near-)perfect matching (as is true for standard Delaunay graphs). Although this conjecture remains open, we improve the lower bound to $(3n-8)/7$. #R##N#We also relate the size of maximum matchings in $\Theta_6$-graphs to the minimum size of a blocking set. Every edge of a $\Theta_6$-graph on point set $P$ corresponds to an empty triangle that contains the endpoints of the edge but no other point of $P$. A blocking set has at least one point in each such triangle. We prove that the size of a maximum matching is at least $\beta(n)/2$ where $\beta(n)$ is the minimum, over all theta-six graphs with $n$ vertices, of the minimum size of a blocking set. In the other direction, lower bounds on matchings can be used to prove bounds on $\beta$, allowing us to show that $\beta(n)\geq 3n/4-2$.

Includes members:
  Member "spanning properties of theta theta 6":
    also connected through other hyperedges:
      (none)
  Member "on the spanning and routing ratio of theta four":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "truly optimal euclidean spanners")
  Member "the θ 5 graph is a spanner":
    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 "higher order triangular distance delaunay graphs graph theoretical properties":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "matchings in geometric graphs")
  Member "on the average number of edges in theta graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the θ 5 graph is a spanner")
  Member "fixed orientation equilateral triangle matching of point sets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "matchings in geometric graphs")
  Member "witness gabriel graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "matchings in geometric graphs")
  Member "witness delaunay graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a short proof of the toughness of delaunay triangulations")

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)