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 "bounds on the complexity of halfspace intersections when the bounded faces have small dimension"):
  Abstract: For a polyhedron $$P$$P let $$B(P)$$B(P) denote the polytopal complex that is formed by all bounded faces of $$P$$P. If $$P$$P is the intersection of $$n$$n halfspaces in $$\mathbb R ^D$$RD, but the maximum dimension $$d$$d of any face in $$B(P)$$B(P) is much smaller, we show that the combinatorial complexity of $$P$$P cannot be too high; in particular, that it is independent of $$D$$D. We show that the number of vertices of $$P$$P is $$O(n^d)$$O(nd) and the total number of bounded faces of the polyhedron is $$O(n^{d^2})$$O(nd2). For inputs in general position the number of bounded faces is $$O(n^d)$$O(nd). We show that for certain specific values of $$d$$d and $$D$$D, our bounds are tight. For any fixed $$d$$d, we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a number of linear programs that is polynomial in $$n$$n.

Includes members:
  Member "optimally fast incremental manhattan plane embedding and planar tight span construction":
    also connected through other hyperedges:
      (none)
  Member "trees with convex faces and optimal angles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "realization and connectivity of the graphs of origami flat foldings")
  Member "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improper learning for non stochastic control")

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)