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 "largest inscribed rectangles in geometric convex sets"):
  Abstract: We consider the problem of finding inscribed boxes and axis-aligned inscribed boxes of maximum volume, inside a compact and solid convex set. Our algorithms are capable of solving these two problems in any such set that can be represented with finite number of convex inequalities. For the axis-aligned case, we formulate the problem for higher dimensions and present an exact optimization algorithm which solves the problem in $\mathcal{O}(d^3+d^2n)$ time, where $d$ is the dimension and $n$ is the number of inequalities defining the convex set. For the general case, after formulating the problem for higher dimensions we investigate the traditional 2-dimensional problem, which is in the literature merely considered for convex polygons, for a broad range of convex sets. We first present a new exact algorithm that finds the largest inscribed axis-aligned rectangle in such convex sets for any given direction of axes in $\mathcal{O}(n)$ time. Using this exact algorithm as a subroutine, we present an $\epsilon$-approximation algorithm that computes $(1-\epsilon)$-approximation to the largest inscribed rectangle with computational complexity of $\mathcal{O}(\epsilon^{-1}n)$. Finally, we show that how this running time can be improved to $\mathcal{O}(\epsilon^{-1}\log n)$ with a $\mathcal{O}(\epsilon^{-1}n)$ pre-processing time when the convex set is a polygon.

Includes members:
  Member "finding all maximal area parallelograms in a convex polygon":
    also connected through other hyperedges:
      (none)
  Member "maximum area triangle in a convex polygon revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding all maximal area parallelograms in a convex polygon")
  Member "maximal area triangles in a convex polygon":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum area triangle in a convex polygon revisited")
  Member "maximal parallelograms in convex polygons a novel geometric structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding all maximal area parallelograms in a convex polygon")
  Member "when convexity meets parallelism a novel geometric structure and its application in an optimization problem":
    also connected through other hyperedges:
      (none)
  Member "finding largest rectangles in convex polygons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximum area triangle in a convex polygon revisited")

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)