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: "envy free cake cutting in two dimensions"
  Abstract: We consider the problem of fairly dividing a two-dimensional heterogeneous resource among several agents with different preferences. Potential applications include dividing land-estates among heirs, museum space among presenters or space in print and electronic media among advertisers. Classic cake-cutting procedures either consider a one-dimensional resource, or allocate each agent a collection of disconnected pieces. In practice, however, the two-dimensional shape of the allotted piece is of crucial importance in many applications. For example, when building houses or designing advertisements, in order to be useful, the allotments should be squares or rectangles with bounded aspect-ratio. We thus introduce the problem of fair two-dimensional division wherein the allocated piece must have a pre-specified geometric shape. We present constructive cake-cutting procedures that satisfy the two most prominent fairness criteria, namely envy-freeness and proportionality. In scenarios where proportionality cannot be achieved due to the geometric constraints, our procedures provide a partially-proportional division, guaranteeing that the fraction allocated to each agent be at least a certain positive constant. We prove that in many natural scenarios the envy-freeness requirement is compatible with the best attainable partial-proportionality.

Connected through hyperedge HE-1 (induced by source paper "developments in multi agent fair allocation"):
  with members:
    - "from matching with diversity constraints to matching with regional quotas"
    - "fair division with minimal sharing"
    - "fairly allocating many goods with few queries"
    - "fair knapsack"
    - "competitive division of a mixed manna"
    - "approximation algorithms for computing maximin share allocations"
    - "proportionally representative participatory budgeting axioms and algorithms"
    - "fair mixing the case of dichotomous preferences"

Connected through hyperedge HE-2 (induced by source paper "fair and square cake cutting in two dimensions"):
  with members:
    - "rental harmony with roommates"
    - "mechanism design for fair division"
    - "truthful fair division"

Connected through hyperedge HE-3 (induced by source paper "fair division of a graph"):
  with members:
    - "fair division via social comparison"

Connected through hyperedge HE-4 (induced by source paper "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"):
  with members:
    - "building fences straight and high an optimal algorithm for finding the maximum length you can cut k times from given sticks"
    - "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"
    - "a generalization of the al method for fair allocation of indivisible objects"
    - "an algorithmic framework for strategic fair division"
    - "throw one s cake and have it too"

Connected through hyperedge HE-5 (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"
    - "web and internet economics"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "online cake cutting"
    - "graph theoretic solutions to computational geometry problems"

Connected through hyperedge HE-6 (induced by source paper "to give or not to give fair division for single minded valuations"):
  with members:
    - "fair and square cake cutting in two dimensions"
    - "characterization and computation of equilibria for indivisible goods"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "clearing markets via bundles"
    - "a unifying hierarchy of valuations with complements and substitutes"
    - "the complexity of fairness through equilibrium"

Connected through hyperedge HE-7 (induced by source paper "envy free division of land"):
  with members:
    - "monotonicity and competitive equilibrium in cake cutting"
    - "fair and square cake cutting in two dimensions"
    - "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"
    - "redividing the cake"
    - "rental harmony with roommates"

Connected through hyperedge HE-8 (induced by source paper "redividing the cake"):
  with members:
    - "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.GT(Computer Science and Game Theory)