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 "on pseudo disk hypergraphs"):
  Abstract: Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq \emptyset\}$, where $S$ is a pseudo-disk in $F$. We give an upper bound of $O(nk^3)$ for the number of edges in $H(P,F)$ of cardinality at most $k$. This generalizes a result of Buzaglo et al. (2013). #R##N#As an application of our bound, we obtain an algorithm that computes a constant-factor approximation to the smallest _weighted_ dominating set in a collection of pseudo-disks in the plane, in expected polynomial time.

Includes members:
  Member "approximation algorithms for polynomial expansion and low density graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "analytical approach to parallel repetition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an improved algorithm for dynamic set cover")

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)