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: "optimal topological simplification of discrete functions on surfaces"
  Abstract: Given a function f on a surface and a tolerance δ>0, we construct a function f δ subject to ‖f δ −f‖∞≤δ such that f δ has a minimum number of critical points. Our construction relies on a connection between discrete Morse theory and persistent homology and completely removes homological noise with persistence ≤2δ from the input function f. The number of critical points of the resulting simplified function f δ achieves the lower bound dictated by the stability theorem of persistent homology. We show that the simplified function can be computed in linear time after persistence pairs have been computed.

Connected through hyperedge HE-1 (induced by source paper "persistent homology of unweighted complex networks via discrete morse theory"):
  with members:
    - "geometry helps to compare persistence diagrams"

Connected through hyperedge HE-2 (induced by source paper "the topology toolkit"):
  with members:
    - "building efficient and compact data structures for simplicial complexes"
    - "a persistence landscapes toolbox for topological statistics"
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "introduction to the r package tda"
    - "computing topological persistence for simplicial maps"

Connected through hyperedge HE-3 (induced by source paper "topology aware surface reconstruction for point clouds"):
  with members:
    - "parsing geometry using structure aware shape templates"

Connected through hyperedge HE-4 (induced by source paper "approximation algorithms for max morse matching"):
  with members:
    - "parameterized complexity of discrete morse theory"
    - "a new matching algorithm for multidimensional persistence"

Connected through hyperedge HE-5 (induced by source paper "min morse approximability applications"):
  with members:
    - "parameterized complexity of discrete morse theory"
    - "random discrete morse theory and a new library of triangulations"
    - "nearly maximum flows in nearly linear time"
    - "computing topological persistence for simplicial maps"
    - "randomized rounding without solving the linear program"

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)