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 "simultaneous visibility representations of plane st graphs using l shapes"):
  Abstract: Let $\langle G_r,G_b \rangle$ be a pair of plane $st$-graphs with the same vertex set $V$. A simultaneous visibility representation with L-shapes of $\langle G_r,G_b \rangle$ is a pair of bar visibility representations $\langle\Gamma_r,\Gamma_b\rangle$ such that, for every vertex $v \in V$, $\Gamma_r(v)$ and $\Gamma_b(v)$ are a horizontal and a vertical segment, which share an end-point. In other words, every vertex is drawn as an $L$-shape, every edge of $G_r$ is a vertical visibility segment, and every edge of $G_b$ is a horizontal visibility segment. Also, no two L-shapes intersect each other. An L-shape has four possible rotations, and we assume that each vertex is given a rotation for its L-shape as part of the input. Our main results are: (i) a characterization of those pairs of plane $st$-graphs admitting such a representation, (ii) a cubic time algorithm to recognize them, and (iii) a linear time drawing algorithm if the test is positive.

Includes members:
  Member "simultaneous drawing of planar graphs with right angle crossings and few bends":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the quasefe problem")
  Member "simultaneous embedding of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "simultaneous pq ordering with applications to constrained embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "simultaneous interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simultaneous representation of proper and unit interval graphs")
  Member "on a tree and a path with no geometric simultaneous embedding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the quasefe problem")
  Member "regular labelings and geometric structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "embedding the dual complex of hyper rectangular partitions")

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)