human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "practical reduction of edge flip sequences in two dimensional triangulations"):
  Abstract: The development of laser scanning techniques has popularized the representation of 3D shapes by triangular meshes with a large number of vertices. Compression techniques dedicated to such meshes have emerged, which exploit the idea that the connectivity of a dense mesh does not deviate much from the connectivity that can be constructed automatically from the vertex positions (while possibly being guided by additional codes). The edge flip is one of the tools that can encode the differences between two meshes, and it is important to control the length of a sequence of flips that transform one triangulation into another. This paper provides a practical solution to this problem. Indeed, the problem of determining a minimal sequence of edge flips between two triangulations is NP-complete for some types of triangulations including manifold triangulations of surfaces, so that it is necessary to develop heuristics. Moreover, it is sometimes difficult to establish a first sequence of flips between two meshes, and we advocate a solution based on the reduction of an existing sequence. The new approach we propose is founded on the assignment of labels to identify the edges, with a property of label transfer during a flip. This gives a meaning to the tracking of an edge in a sequence of flips and offers the exploitation of very simple combinatorial properties. All the operations are performed directly on the sequence of labels denoting the edges to be flipped, almost regardless of the underlying surface, since only local temporary connectivity is involved.

Includes members:
  Member "flip distance between triangulations of a simple polygon is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "flip distance between triangulations of a planar point set is apx hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "making triangulations 4 connected using flips":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "arc diagrams flip distances and hamiltonian triangulations")
  Member "flip distance between two triangulations of a point set is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "happy endings for flip graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a proof of the orbit conjecture for flipping edge labelled triangulations")

Question: Please tell me which class the source paper 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)