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 "the offset filtration of convex objects"):
  Abstract: We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested cell complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based on the Voronoi partition with respect to the given convex objects. We prove that, in two and three dimensions, the size of the filtration is proportional to the size of the Voronoi diagram. Our algorithm runs in $\Theta(n \log{n})$ in the $2$-dimensional case and in expected time $O(n^{3 + \epsilon})$, for any $\epsilon > 0$, in the $3$-dimensional case. Our approach is inspired by alpha-complexes for point sets, but requires more involved machinery and analysis primarily since Voronoi regions of general convex objects do not form a good cover. We show by experiments that our approach results in a similarly fast and topologically more stable method for computing a filtration compared to approximating the input by point samples.

Includes members:
  Member "approximate cech complexes in low and high dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "persistent homology of geospatial data a case study with voting")
  Member "the compressed annotation matrix an efficient data structure for computing persistent cohomology":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gpu accelerated computation of vietoris rips persistence barcodes")
  Member "graph induced complex on point data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "topological data analysis with epsilon net induced lazy witness complex")
  Member "linear size approximations to the vietoris rips filtration":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "topological autoencoders")
  Member "towards persistence based reconstruction in euclidean spaces":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time series featurization via topological data analysis")

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)