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 "minimum weight connectivity augmentation for planar straight line graphs"):
  Abstract: Abstract   We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output. We show that every connected PSLG    G  =  (  V  ,  E  )    in general position can be augmented to a 2-connected PSLG    (  V  ,  E  ∪    E    +    )    by adding new edges of total Euclidean length    ‖    E    +    ‖    2  ‖  E  ‖   , and this bound is the best possible. An optimal edge set      E    +      can be computed in    O  (  |  V    |    4    )    time; however the problem becomes NP-hard when G is disconnected. Further, we show that there is a sequence of edge insertions and deletions that transforms a connected PSLG    G  =  (  V  ,  E  )    into a planar straight-line cycle      G    ′    =  (  V  ,    E    ′    )    such that    ‖    E    ′    ‖  ≤  2  ‖   MST   (  V  )  ‖   , and the graph remains connected with edge length below    ‖  E  ‖  +  ‖   MST   (  V  )  ‖    at all stages. These bounds are the best possible.

Includes members:
  Member "on the relationship between k planar and k quasi planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fan crossing free graphs")
  Member "crossing patterns in nonplanar road networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "two planar graphs are quasiplanar":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "on the density of non simple 3 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fan crossing free graphs")
  Member "a simplified 1 5 approximation algorithm for augmenting edge connectivity of a graph from 1 to 2":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "2 node connectivity network design")
  Member "on the recognition of fan planar and maximal outer fan planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fan crossing free graphs")

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)