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: "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
  Abstract: Cake cutting is one of the most fundamental settings in fair division and mechanism design without money. In this paper, we consider different levels of three fundamental goals in cake cutting: fairness, Pareto optimality, and strategyproofness. In particular, we present robust versions of envy-freeness and proportionality that are not only stronger than their standard counter-parts but also have less information requirements. We then focus on cake cutting with piecewise constant valuations and present three desirable algorithms: CCEA (Controlled Cake Eating Algorithm), MEA (Market Equilibrium Algorithm) and CSD (Constrained Serial Dictatorship). CCEA is polynomial-time, robust envy-free, and non-wasteful. It relies on parametric network flows and recent generalizations of the probabilistic serial algorithm. For the subdomain of piecewise uniform valuations, we show that it is also group-strategyproof. Then, we show that there exists an algorithm (MEA) that is polynomial-time, envy-free, proportional, and Pareto optimal. MEA is based on computing a market-based equilibrium via a convex program and relies on the results of Reijnierse and Potters [24] and Devanur et al. [15]. Moreover, we show that MEA and CCEA are equivalent to mechanism 1 of Chen et. al. [12] for piecewise uniform valuations. We then present an algorithm CSD and a way to implement it via randomization that satisfies strategyproofness in expectation, robust proportionality, and unanimity for piecewise constant valuations. For the case of two agents, it is robust envy-free, robust proportional, strategyproof, and polynomial-time. Many of our results extend to more general settings in cake cutting that allow for variable claims and initial endowments. We also show a few impossibility results to complement our algorithms.

Connected through hyperedge HE-1 (induced by source paper "monotonicity and competitive equilibrium in cake cutting"):
  with members:
    - "competitive division of a mixed manna"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "nash social welfare approximation for strategic agents"
    - "continuity assumptions in cake cutting"
    - "redividing the cake"
    - "an algorithmic framework for strategic fair division"
    - "online cake cutting"

Connected through hyperedge HE-2 (induced by source paper "obvious manipulations in cake cutting"):
  with members:
    - "fair cake cutting in practice"
    - "deterministic strategyproof and fair cake cutting"
    - "fair and square cake cutting in two dimensions"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "truthful fair division"

Connected through hyperedge HE-3 (induced by source paper "fair and efficient cake division with connected pieces"):
  with members:
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "computing socially efficient cake divisions"

Connected through hyperedge HE-4 (induced by source paper "truthful fair division without free disposal"):
  with members:
    - "on the complexity of chore division"
    - "deterministic strategyproof and fair cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "incentive compatible two player cake cutting"
    - "truthful fair division"

Connected through hyperedge HE-5 (induced by source paper "an improved envy free cake cutting protocol for four agents"):
  with members:
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"
    - "a discrete and bounded envy free cake cutting protocol for four agents"

Connected through hyperedge HE-6 (induced by source paper "deterministic strategyproof and fair cake cutting"):
  with members:
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "better strategyproof mechanisms without payments or prior an analytic approach"
    - "incentive compatible two player cake cutting"
    - "truthful fair division"

Connected through hyperedge HE-7 (induced by source paper "resource monotonicity and population monotonicity in connected cake cutting"):
  with members:
    - "online cake cutting"

Connected through hyperedge HE-8 (induced by source paper "how to re divide a cake fairly"):
  with members:
    - "fair and square cake cutting in two dimensions"
    - "cutting a cake without harming the toppings"
    - "envy free cake cutting in two dimensions"
    - "web and internet economics"
    - "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.GT(Computer Science and Game Theory)