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 "computing shapley values in the plane"):
  Abstract: We consider the problem of computing Shapley values for points in the plane, where each point is interpreted as a player, and the value of a coalition is defined by the area of usual geometric objects, such as the convex hull or the minimum axis-parallel bounding box. #R##N#For sets of $n$ points in the plane, we show how to compute in roughly $O(n^{3/2})$ time the Shapley values for the area of the minimum axis-parallel bounding box and the area of the union of the rectangles spanned by the origin and the input points. When the points form an increasing or decreasing chain, the running time can be improved to near-linear. In all these cases, we use linearity of the Shapley values and fast multi-point evaluation of polynomials as a key subroutine. #R##N#We also show that Shapley values for the area and the perimeter of the convex hull or the minimum enclosing disk can be computed in polynomial time. In this case the computation is closely related to the model of stochastic point sets considered in computational geometry, but here we have to consider random insertion orders of the points instead of a probabilistic existence of points.

Includes members:
  Member "on the separability of stochastic geometric objects with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the expected diameter width and complexity of a stochastic convex hull")
  Member "batched point location in sinr diagrams via algebraic tools":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "convex hulls under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "area and perimeter of the convex hull of stochastic points":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "solving linear program with chubanov queries and bisection moves")
  Member "computing the distance between piecewise linear bivariate functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing the inverse geodesic length in planar graphs and graphs of bounded treewidth")

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)