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: "resource monotonicity and population monotonicity in connected cake cutting"
  Abstract: In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way --- giving each agent a piece with a value of at least 1/n of the total. In many applications, such as dividing a land-estate or a time-interval, it is also important that the pieces are connected. We propose two additional requirements: resource-monotonicity (RM) and population-monotonicity (PM). When either the cake or the set of agents changes and the cake is re-divided using the same rule, the utility of all remaining agents must change in the same direction. #R##N#Classic cake-cutting protocols are neither RM nor PM. Moreover, we prove that no Pareto-optimal proportional division rule can be either RM or PM. Motivated by this negative result, we search for division rules that are weakly-Pareto-optimal --- no other division is strictly better for all agents. #R##N#We present two such rules. The relative-equitable rule, which assigns the maximum possible relative value equal for all agents, is proportional and PM. The so-called rightmost-mark rule, which is an improved version of the Cut and Choose protocol, is proportional and RM for two agents.

Connected through hyperedge HE-1 (induced by source paper "monotonicity and competitive equilibrium in cake cutting"):
  with members:
    - "competitive division of a mixed manna"
    - "nash social welfare approximation for strategic agents"
    - "continuity assumptions in cake cutting"
    - "redividing the cake"
    - "an algorithmic framework for strategic fair division"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "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"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "truthful fair division"

Connected through hyperedge HE-3 (induced by source paper "cake cutting explicit examples for impossibility results"):
  with members:
    - "don t cry to be the first symmetric fair division algorithms exist"
    - "existence of a simple and equitable fair division a short proof"
    - "the query complexity of cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-4 (induced by source paper "the query complexity of cake cutting"):
  with members:
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "consensus halving is ppa complete"
    - "fair division of a graph"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "to give or not to give fair division for single minded valuations"
    - "characterization and computation of equilibria for indivisible goods"
    - "the complexity of fairness through equilibrium"

Connected through hyperedge HE-5 (induced by source paper "how to cut a cake with a gram matrix"):
  with members:
    - "existence of a simple and equitable fair division a short proof"
    - "resource monotonicity and population monotonicity in cake cutting"

Connected through hyperedge HE-6 (induced by source paper "fair cake cutting among families"):
  with members:
    - "almost envy freeness in group resource allocation"
    - "monotonicity and competitive equilibrium in cake cutting"
    - "the complexity of cake cutting with unequal shares"
    - "competitive division of a mixed manna"
    - "approximate maximin shares for groups of agents"
    - "fair and square cake cutting in two dimensions"
    - "democratic fair allocation of indivisible goods"

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)