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 "a note on the area requirement of euclidean greedy embeddings of christmas cactus graphs"):
  Abstract: An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices $s$ and $t$, the vertex $s$ has a neighbor $v$ with smaller distance to $t$ than $s$. This drawing style is motivated by greedy geometric routing in wireless sensor networks. #R##N#A Christmas cactus is a connected graph in which every two simple cycles have at most one vertex in common and in which every cutvertex is part of at most two biconnected blocks. It has been proved that Christmas cactus graphs have an Euclidean greedy embedding. This fact has played a crucial role in proving that every 3-connected planar graph has an Euclidean greedy embedding. The proofs construct greedy embeddings of Christmas cactuses of exponential size, and it has been an open question whether exponential area is necessary in the worst case for greedy embeddings of Christmas cactuses. We prove that this is indeed the case.

Includes members:
  Member "on self approaching and increasing chord drawings of 3 connected planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "drawing graphs as spanners")
  Member "succinct greedy geometric routing in the euclidean plane":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the area requirements of planar greedy drawings of triconnected planar 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)