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 "from crossing free graphs on wheel sets to embracing simplices and polytopes with few vertices"):
  Abstract: A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is called a \emph{wheel set} if all points but $w$ are extreme. We show that for the purpose of counting crossing-free geometric graphs on $P$, it suffices to know the so-called \emph{frequency vector} of $P$. While there are roughly $2^n$ distinct order types that correspond to wheel sets, the number of frequency vectors is only about $2^{n/2}$. #R##N#We give simple formulas in terms of the frequency vector for the number of crossing-free spanning cycles, matchings, $w$-embracing triangles, and many more. Based on these formulas, the corresponding numbers of graphs can be computed efficiently. #R##N#Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the \emph{simplicial depth} of a point~$w$ in a set~$H$, i.e., the number of simplices spanned by~$H$ that contain~$w$. While the concept of frequency vectors does not generalize easily, we show how to apply similar methods in higher dimensions. The result is an $O(n^{d-1})$ time algorithm for computing the simplicial depth of a point $w$ in a set $H$ of $n$ $d$-dimensional points, improving on the previously best bound of $O(n^d\log n)$. #R##N#Configurations equivalent to wheel sets have already been used by Perles for counting the faces of high-dimensional polytopes with few vertices via the Gale dual. Based on that we can compute the number of facets of the convex hull of $n=d+k$ points in general position in $\mathbb{R}^d$ in time $O(n^{\max\{\omega,k-2\}})$ where $\omega \approx 2.373$, even though the asymptotic number of facets may be as large as $n^k$.

Includes members:
  Member "a new lower bound on the maximum number of plane graphs using production matrices":
    also connected through other hyperedges:
      (none)
  Member "approximating the simplicial depth":
    also connected through other hyperedges:
      (none)
  Member "counting plane graphs perfect matchings spanning cycles and kasteleyn s technique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "circumscribing polygons and polygonizations for disjoint line segments")
  Member "bounds on the maximum multiplicity of some common geometric graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new lower bound on the maximum number of plane graphs using production matrices")
  Member "counting triangulations of planar point sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "colored ray configurations")

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)