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: "randomly removing g handles at once"
  Abstract: Indyk and Sidiropoulos (2007) proved that any orientable graph of genus $g$ can be probabilistically embedded into a graph of genus $g-1$ with constant distortion. Viewing a graph of genus $g$ as embedded on the surface of a sphere with $g$ handles attached, Indyk and Sidiropoulos' method gives an embedding into a distribution over planar graphs with distortion $2^{O(g)}$, by iteratively removing the handles. By removing all $g$ handles at once, we present a probabilistic embedding with distortion $O(g^2)$ for both orientable and non-orientable graphs. Our result is obtained by showing that the nimum-cut graph of Erickson and Har Peled (2004) has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma of Lee and Sidiropoulos (2009).

Connected through hyperedge HE-1 (induced by source paper "quasimetric embeddings and their applications"):
  with members:
    - "optimal stochastic planarization"
    - "nearly tight low stretch spanning trees"
    - "measured descent a new embedding method for finite metrics"

Connected through hyperedge HE-2 (induced by source paper "cops robbers and threatening skeletons padded decomposition for minor free graphs"):
  with members:
    - "separator theorems for minor free and shallow minor free graphs with applications"
    - "optimal stochastic planarization"
    - "eigenvalue bounds spectral partitioning and metrical deformations via flows"

Connected through hyperedge HE-3 (induced by source paper "planarizing an unknown surface"):
  with members:
    - "optimal stochastic planarization"
    - "dynamic generators of topologically embedded graphs"

Connected through hyperedge HE-4 (induced by source paper "shortest non trivial cycles in directed and undirected surface graphs"):
  with members:
    - "multiple source shortest paths in embedded graphs"
    - "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs"
    - "quantifying homology classes ii localization and stability"
    - "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-5 (induced by source paper "flow cut gaps for integer and fractional multiflows"):
  with members:
    - "vertex sparsifiers new results from old techniques"
    - "when the cut condition is enough a complete characterization for multiflow problems in series parallel networks"
    - "measured descent a new embedding method for finite metrics"

Connected through hyperedge HE-6 (induced by source paper "optimal stochastic planarization"):
  with members:
    - "vertex sparsifiers new results from old techniques"

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)