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 "arrangements of approaching pseudo lines"):
  Abstract: We consider arrangements of $n$ pseudo-lines in the Euclidean plane where each pseudo-line $\ell_i$ is represented by a bi-infinite connected $x$-monotone curve $f_i(x)$, $x \in \mathbb{R}$, s.t.\ for any two pseudo-lines $\ell_i$ and $\ell_j$ with $i < j$, the function $x \mapsto f_j(x) - f_i(x)$ is monotonically decreasing and surjective (i.e., the pseudo-lines approach each other until they cross, and then move away from each other). We show that such \emph{arrangements of approaching pseudo-lines}, under some aspects, behave similar to arrangements of lines, while for other aspects, they share the freedom of general pseudo-line arrangements. #R##N#For the former, we prove: 1. There are arrangements of pseudo-lines that are not realizable with approaching pseudo-lines. 2. Every arrangement of approaching pseudo-lines has a dual generalized configuration of points with an underlying arrangement of approaching pseudo-lines. #R##N#For the latter, we show: 1. There are $2^{\Theta(n^2)}$ isomorphism classes of arrangements of approaching pseudo-lines (while there are only $2^{\Theta(n \log n)}$ isomorphism classes of line arrangements). 2. It can be decided in polynomial time whether an allowable sequence is realizable by an arrangement of approaching pseudo-lines. #R##N#Furthermore, arrangements of approaching pseudo-lines can be transformed into each other by flipping triangular cells, i.e., they have a connected flip graph, and every bichromatic arrangement of this type contains a bichromatic triangular cell.

Includes members:
  Member "from crossing free graphs on wheel sets to embracing simplices and polytopes with few vertices":
    also connected through other hyperedges:
      (none)
  Member "drawing arrangement graphs in small grids or how to play planarity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "variants of the segment number of a graph")
  Member "convex arc drawings of pseudolines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polyline drawings with topological constraints")

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)