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 "on strict outer confluent graphs"):
  Abstract: A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs. If all vertices of the graph lie in the outer face of the drawing, the drawing is called a strict outerconfluent (SOC) drawing. SC and SOC graphs were first considered by Eppstein et al. in Graph Drawing 2013. Here, we establish several new relationships between the class of SC graphs and other graph classes, in particular string graphs and unit-interval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like ($\Delta$-)SOC graphs have bounded cliquewidth.

Includes members:
  Member "strict confluent drawing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "further towards unambiguous edge bundling investigating power confluent drawings for network visualization")
  Member "confluent hasse diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strict confluent drawing")
  Member "split decomposition and graph labelled trees characterizations and fully dynamic algorithms for totally decomposable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs")
  Member "confluent layered drawings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "delta confluent drawings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "further towards unambiguous edge bundling investigating power confluent drawings for network visualization")
  Member "confluent drawings visualizing non planar diagrams in a planar way":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "confluent drawing parallel coordinates web based interactive visual analytics of large multi dimensional data")

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)