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 "the maximum number of faces of the minkowski sum of two convex polytopes"):
  Abstract: We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes. #R##N#For even dimensions $d\ge{}2$, the maximum values are attained when $P_1$ and $P_2$ are cyclic $d$-polytopes with disjoint vertex sets. For odd dimensions $d\ge{}3$, the maximum values are attained when $P_1$ and $P_2$ are $\lfloor\frac{d}{2}\rfloor$-neighborly $d$-polytopes, whose vertex sets are chosen appropriately from two distinct $d$-dimensional moment-like curves.

Includes members:
  Member "a geometric approach for the upper bound theorem for minkowski sums of convex polytopes":
    also connected through other hyperedges:
      (none)
  Member "tight lower bounds on the number of faces of the minkowski sum of convex polytopes via the cayley trick":
    also connected through other hyperedges:
      (none)
  Member "maximal f vectors of minkowski sums of large numbers of polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a geometric approach for the upper bound theorem for minkowski sums of convex polytopes")
  Member "convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight lower bounds on the number of faces of the minkowski sum of convex polytopes via the cayley trick")
  Member "minkowski sum construction and other applications of arrangements of geodesic arcs on the sphere":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight lower bounds on the number of faces of the minkowski sum of convex polytopes via the cayley trick")

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)