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: "shortest non trivial cycles in directed and undirected surface graphs"
  Abstract: Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest non-separating cycle in 2^O(g) n log log n time. Similar algorithms are given to compute a shortest non-contractible or non-null-homologous cycle in 2^O(g+b) n log log n time. Our algorithms for undirected G combine an algorithm of Kutz with known techniques for efficiently enumerating homotopy classes of curves that may be shortest non-trivial cycles. #R##N#Our main technical contributions in this work arise from assuming G is a directed graph with possibly asymmetric edge weights. For this case, we give an algorithm to compute a shortest non-contractible cycle in G in O((g^3 + g b)n log n) time. In order to achieve this time bound, we use a restriction of the infinite cyclic cover that may be useful in other contexts. We also describe an algorithm to compute a shortest non-null-homologous cycle in G in O((g^2 + g b)n log n) time, extending a known algorithm of Erickson to compute a shortest non-separating cycle. In both the undirected and directed cases, our algorithms improve the best time bounds known for many values of g and b.

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 "a strongly polynomial algorithm for finding a shortest non zero path in group labeled graphs"):
  with members:
    - "a weighted linear matroid parity algorithm"
    - "computational topology of graphs on surfaces"
    - "optimally cutting a surface into a disk"

Connected through hyperedge HE-3 (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-4 (induced by source paper "topologically trivial closed walks in directed surface graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "computing the geometric intersection number of curves"
    - "multiple source shortest paths in embedded graphs"
    - "on the homotopy test on surfaces"

Connected through hyperedge HE-5 (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-6 (induced by source paper "minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths"):
  with members:
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "submatrix maximum queries in monge matrices are equivalent to predecessor search"
    - "computing the girth of a planar graph in linear time"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "algorithmic applications of baur strassen s theorem shortest cycles diameter and matchings"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"
    - "optimally cutting a surface into a disk"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-7 (induced by source paper "minimum cycle and homology bases of surface embedded graphs"):
  with members:
    - "multiple source shortest paths in embedded 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"
    - "approximating loops in a shortest homology basis from point data"
    - "dynamic generators of topologically embedded graphs"

Connected through hyperedge HE-8 (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"
    - "computing shortest non trivial cycles on orientable surfaces of bounded genus in almost linear time"
    - "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)