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 "flip distance to some plane configurations"):
  Abstract: We study an old geometric optimization problem in the plane. Given a perfect matching $M$ on a set of $n$ points in the plane, we can transform it to a non-crossing perfect matching by a finite sequence of flip operations. The flip operation removes two crossing edges from $M$ and adds two non-crossing edges. Let $f(M)$ and $F(M)$ denote the minimum and maximum lengths of a flip sequence on $M$, respectively. It has been proved by Bonnet and Miltzow (2016) that $f(M)=O(n^2)$ and by van Leeuwen and Schoone (1980) that $F(M)=O(n^3)$. We prove that $f(M)=O(n\Delta)$ where $\Delta$ is the spread of the point set, which is defined as the ratio between the longest and the shortest pairwise distances. This improves the previous bound if the point set has sublinear spread. For a matching $M$ on $n$ points in convex position we prove that $f(M)=n/2-1$ and $F(M)={{n/2} \choose 2}$; these bounds are tight. #R##N#Any bound on $F(\cdot)$ carries over to the bichromatic setting, while this is not necessarily true for $f(\cdot)$. Let $M'$ be a bichromatic matching. The best known upper bound for $f(M')$ is the same as for $F(M')$, which is essentially $O(n^3)$. We prove that $f(M')\le n-2$ for points in convex position, and $f(M')= O(n^2)$ for semi-collinear points. #R##N#The flip operation can also be defined on spanning trees. For a spanning tree $T$ on a convex point set we show that $f(T)=O(n\log n)$.

Includes members:
  Member "flip distance to a non crossing perfect matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "matchings in geometric graphs")
  Member "flip distance between triangulations of a simple polygon is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "bichromatic compatible matchings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on maximum sum matchings of points")
  Member "a history of flips in combinatorial triangulations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "arc diagrams flip distances and hamiltonian 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)