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: "building efficient and compact data structures for simplicial complexes"
  Abstract: The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the ST while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree and the Simplex Array List. We analyze the compressed ST, the Maximal Simplex Tree, and the Simplex Array List under various settings.

Connected through hyperedge HE-1 (induced by source paper "optimal bound on the combinatorial complexity of approximating polytopes"):
  with members:
    - "approximate convex intersection detection with applications to width and minkowski sums"
    - "near optimal epsilon kernel construction and related problems"
    - "optimal approximate polytope membership"
    - "on the combinatorial complexity of approximating polytopes"

Connected through hyperedge HE-2 (induced by source paper "computing discrete morse complexes from simplicial complexes"):
  with members:
    - "the stellar tree a compact representation for simplicial complexes and beyond"
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "reducing complexes in multidimensional persistent homology theory"
    - "the compressed annotation matrix an efficient data structure for computing persistent cohomology"
    - "graph induced complex on point data"
    - "distributed computation of persistent homology"
    - "random discrete morse theory and a new library of triangulations"

Connected through hyperedge HE-3 (induced by source paper "the topology toolkit"):
  with members:
    - "a persistence landscapes toolbox for topological statistics"
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "introduction to the r package tda"
    - "optimal topological simplification of discrete functions on surfaces"
    - "computing topological persistence for simplicial maps"

Connected through hyperedge HE-4 (induced by source paper "the stellar tree a compact representation for simplicial complexes and beyond"):
  with members:
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "multicore homology via mayer vietoris"

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)