human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "cutting a cake without harming the toppings"
  Abstract: On a two-dimensional cake, there are $m$ pairwise-disjoint toppings. It is required to cut the cake to $m+b$ pieces, such that each topping is entirely contained in a unique piece, and the total number of empty pieces ($b$, "blanks") is minimized. The minimal number of blanks naturally depends on the geometric constraints of the cake and its pieces. The paper presents tight bounds on the number of blanks when the pieces must be connected, convex or rectangular.

Connected through hyperedge HE-1 (induced by source paper "how to re divide a cake fairly"):
  with members:
    - "fair and square cake cutting in two dimensions"
    - "envy free cake cutting in two dimensions"
    - "web and internet economics"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "online cake cutting"
    - "graph theoretic solutions to computational geometry problems"

Question: Please tell me which class the center node 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)