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: "quantifying homology classes ii localization and stability"
  Abstract: In the companion paper (7), we measured homology classes and computed the optimal homology basis. This paper addresses two related problems, namely, localization and stability. We localize a class with the cycle minimizing a certain objective function. We explore three dierent objective functions, namely, volume, diameter and radius. We show that it is NP-hard to compute the smallest cycle using the former two. We also prove that the measurement dened in (7) is stable with regard to small changes of the geometry of the concerned space.

Connected through hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "computational topology and the unique games conjecture"
    - "finding all useless arcs in directed planar graphs"
    - "local flow partitioning for faster edge connectivity"
    - "minor free graphs have light spanners"
    - "minimum cycle and homology bases of surface embedded graphs"
    - "recognizing weakly simple polygons"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"

Connected through hyperedge HE-2 (induced by source paper "persistent 1 cycles definition computation and its application"):
  with members:
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "the compressed annotation matrix an efficient data structure for computing persistent cohomology"
    - "computing topological persistence for simplicial maps"
    - "approximating loops in a shortest homology basis from point data"

Connected through hyperedge HE-3 (induced by source paper "shortest non trivial cycles in directed and undirected surface graphs"):
  with members:
    - "multiple source shortest paths in embedded graphs"
    - "randomly removing g handles at once"
    - "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs"
    - "computing shortest non trivial cycles on orientable surfaces of bounded genus in almost linear time"
    - "dynamic generators of topologically embedded graphs"
    - "optimally cutting a surface into a disk"

Connected through hyperedge HE-4 (induced by source paper "annotating simplices with a homology basis and its applications"):
  with members:
    - "determining edge expansion and other connectivity measures of graphs of bounded genus"
    - "approximating loops in a shortest homology basis from point data"
    - "quantifying homology classes"
    - "dynamic generators of topologically embedded graphs"

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)