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 "sketched representations and orthogonal planarity of bounded treewidth graphs"):
  Abstract: Given a planar graph $G$ and an integer $b$, OrthogonalPlanarity is the problem of deciding whether $G$ admits an orthogonal drawing with at most $b$ bends in total. We show that OrthogonalPlanarity can be solved in polynomial time if $G$ has bounded treewidth. Our proof is based on an FPT algorithm whose parameters are the number of bends, the treewidth and the number of degree-2 vertices of $G$. This result is based on the concept of sketched orthogonal representation that synthetically describes a family of equivalent orthogonal representations. Our approach can be extended to related problems such as HV-Planarity and FlexDraw. In particular, both OrthogonalPlanarity and HV-Planarity can be decided in $O(n^3 \log n)$ time for series-parallel graphs, which improves over the previously known $O(n^4)$ bounds.

Includes members:
  Member "drawing hv restricted planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on smooth orthogonal and octilinear drawings relations complexity and kandinsky drawings")
  Member "parameterized complexity of 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "bend minimum orthogonal drawings in quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an spqr tree like embedding representation for upward planarity")
  Member "crossing minimization for 1 page and 2 page drawings of graphs with bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "upward book embeddings of st graphs")
  Member "orthogonal graph drawing with inflexible edges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an spqr tree like embedding representation for upward planarity")

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)