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: "computing shortest non trivial cycles on orientable surfaces of bounded genus in almost linear time"
  Abstract: We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon the current-best O(n^{3/2})-time algorithm by Cabello and Mohar (ESA 2005). Our algorithm uses universal-cover constructions to find short cycles and makes extensive use of existing tools from the field.

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 "holiest minimum cost paths and flows in surface graphs"):
  with members:
    - "minimum cycle and homology bases of surface embedded graphs"
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "faster parametric shortest path and minimum balance algorithms"
    - "all pairs minimum cuts in near linear time for surface embedded graphs"
    - "computing the girth of a planar graph in linear time"
    - "lattices and maximum flow algorithms in planar graphs"
    - "multiple source shortest paths in embedded graphs"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"

Connected through hyperedge HE-3 (induced by source paper "computational topology of graphs on surfaces"):
  with members:
    - "untangling planar curves"
    - "shortest path embeddings of graphs on surfaces"
    - "a direct proof of the strong hanani tutte theorem on the projective plane"
    - "minimum cycle and homology bases of surface embedded graphs"
    - "crossing number is hard for kernelization"
    - "computing the geometric intersection number of curves"
    - "how to walk your dog in the mountains with no magic leash"
    - "beyond the euler characteristic approximating the genus of general graphs"

Connected through hyperedge HE-4 (induced by source paper "multicuts in planar and bounded genus graphs with bounded number of terminals"):
  with members:
    - "a polynomial time algorithm for planar multicuts with few source sink pairs"
    - "shortest non trivial cycles in directed and undirected surface graphs"
    - "dynamic generators of topologically embedded graphs"

Connected through hyperedge HE-5 (induced by source paper "multiple source shortest paths in embedded graphs"):
  with members:
    - "faster parametric shortest path and minimum balance algorithms"
    - "linear space approximate distance oracles for planar bounded genus and minor free graphs"
    - "min st cut oracle for planar graphs with near linear preprocessing time"
    - "minimum cycle basis and all pairs min cut of a planar graph in subquadratic time"
    - "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs"
    - "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth"
    - "optimal embedding into star metrics"
    - "dynamic generators of topologically embedded graphs"

Connected through hyperedge HE-6 (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"
    - "quantifying homology classes ii localization and stability"
    - "dynamic generators of topologically embedded graphs"
    - "optimally cutting a surface into a disk"

Connected through hyperedge HE-7 (induced by source paper "quantifying homology classes ii localization and stability"):
  with members:
    - "optimally cutting a surface into a disk"

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)