human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "approximate convex hull of data streams"
  Abstract: Given a finite set of points $P \subseteq \mathbb{R}^d$, we would like to find a small subset $S \subseteq P$ such that the convex hull of $S$ approximately contains $P$. More formally, every point in $P$ is within distance $\epsilon$ from the convex hull of $S$. Such a subset $S$ is called an $\epsilon$-hull. Computing an $\epsilon$-hull is an important problem in computational geometry, machine learning, and approximation algorithms. #R##N#In many real world applications, the set $P$ is too large to fit in memory. We consider the streaming model where the algorithm receives the points of $P$ sequentially and strives to use a minimal amount of memory. Existing streaming algorithms for computing an $\epsilon$-hull require $O(\epsilon^{-(d-1)/2})$ space, which is optimal for a worst-case input. However, this ignores the structure of the data. The minimal size of an $\epsilon$-hull of $P$, which we denote by $\text{OPT}$, can be much smaller. A natural question is whether a streaming algorithm can compute an $\epsilon$-hull using only $O(\text{OPT})$ space. #R##N#We begin with lower bounds that show that it is not possible to have a single-pass streaming algorithm that computes an $\epsilon$-hull with $O(\text{OPT})$ space. We instead propose three relaxations of the problem for which we can compute $\epsilon$-hulls using space near-linear to the optimal size. Our first algorithm for points in $\mathbb{R}^2$ that arrive in random-order uses $O(\log n\cdot \text{OPT})$ space. Our second algorithm for points in $\mathbb{R}^2$ makes $O(\log(\frac{1}{\epsilon}))$ passes before outputting the $\epsilon$-hull and requires $O(\text{OPT})$ space. Our third algorithm for points in $\mathbb{R}^d$ for any fixed dimension $d$ outputs an $\epsilon$-hull for all but $\delta$-fraction of directions and requires $O(\text{OPT} \cdot \log \text{OPT})$ space.

Question: Please tell me which class the center node 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)