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 the expected diameter width and complexity of a stochastic convex hull"):
  Abstract: We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of a realization of the dataset, i.e., a random sample including each point with its existence probability. We are interested in computing certain expected statistics of a SCH, including diameter, width, and combinatorial complexity. For diameter, we establish the first deterministic 1.633-approximation algorithm with a time complexity polynomial in both $n$ and $d$. For width, two approximation algorithms are provided: a deterministic $O(1)$-approximation running in $O(n^{d+1} \log n)$ time, and a fully polynomial-time randomized approximation scheme (FPRAS). For combinatorial complexity, we propose an exact $O(n^d)$-time algorithm. Our solutions exploit many geometric insights in Euclidean space, some of which might be of independent interest.

Includes members:
  Member "stochastic closest pair problem and most likely nearest neighbor search in tree spaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the separability of stochastic geometric objects with applications")
  Member "colored stochastic dominance problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the separability of stochastic geometric objects with applications")
  Member "nearest neighbor searching under uncertainty ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "updating dynamic random hyperbolic graphs in sublinear time")
  Member "on the separability of stochastic geometric objects with applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing shapley values in the plane")
  Member "epsilon kernel coresets for stochastic points":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "convex hulls under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "approximating the expected values for combinatorial optimization problems over stochastic points":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic k center and j flat center problems")

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)