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 separability of stochastic geometric objects with applications"):
  Abstract: In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let $S=S_R \cup S_B$ be a given set of stochastic bichromatic points, and define $n = \min\{|S_R|, |S_B|\}$ and $N = \max\{|S_R|, |S_B|\}$. We show that the separable-probability (SP) of $S$ can be computed in $O(nN^{d-1})$ time for $d \geq 3$ and $O(\min\{nN \log N, N^2\})$ time for $d=2$, while the expected separation-margin (ESM) of $S$ can be computed in $O(nN^{d})$ time for $d \geq 2$. In addition, we give an $\Omega(nN^{d-1})$ witness-based lower bound for computing SP, which implies the optimality of our algorithm among all those in this category. Also, a hardness result for computing ESM is given to show the difficulty of further improving our algorithm. As an extension, we generalize the same problems from points to general geometric objects, i.e., polytopes and/or balls, and extend our algorithms to solve the generalized SP and ESM problems in $O(nN^{d})$ and $O(nN^{d+1})$ time, respectively. Finally, we present some applications of our algorithms to stochastic convex-hull related problems.

Includes members:
  Member "on the expected diameter width and complexity of a stochastic convex hull":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "stochastic closest pair problem and most likely nearest neighbor search in tree spaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the expected diameter width and complexity of a stochastic convex hull")
  Member "colored stochastic dominance problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the expected diameter width and complexity of a stochastic convex hull")
  Member "nearest neighbor searching under uncertainty ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "updating dynamic random hyperbolic graphs in sublinear time")
  Member "stochastic k center and j flat center problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic smallest enclosing ball in high dimensions via subgradient sampling")
  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")

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)