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: "the complexity of cake cutting with unequal shares"
  Abstract: An unceasing problem of our prevailing society is the fair division of goods. The problem of fair cake cutting is dividing a heterogeneous and divisible resource, the cake, among $n$ players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share. #R##N#In this paper, we investigate the problem of proportional division with unequal shares, where each player is entitled to receive a predetermined portion of the cake. Our contribution is twofold. First we present a protocol that delivers a proportional solution in less queries than all known algorithms. We then show that our protocol is the fastest possible by giving an asymptotically matching lower bound. Both results remain valid in a highly general cake cutting model, which can be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods"):
  with members:
    - "computing envy freeable allocations with limited subsidies"
    - "one dollar each eliminates envy"
    - "fair division of mixed divisible and indivisible goods"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "maximin share allocations on cycles"
    - "an improved approximation algorithm for maximin shares"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"

Connected through hyperedge HE-2 (induced by source paper "on weighted envy freeness in indivisible item allocation"):
  with members:
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "when do envy free allocations exist"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-3 (induced by source paper "weighted maxmin fair share allocation of indivisible chores"):
  with members:
    - "fair allocation of combinations of indivisible goods and chores"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "competitive equilibria with indivisible goods and generic budgets"
    - "approximation algorithms for computing maximin share allocations"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-4 (induced by source paper "competitive equilibrium for almost all incomes existence and fairness"):
  with members:
    - "approximating nash social welfare under submodular valuations through un matchings"
    - "competitive equilibrium with generic budgets beyond additive"
    - "monotonicity and competitive equilibrium in cake cutting"
    - "negotiation strategies for agents with ordinal preferences"
    - "on the proximity of markets with integral equilibria"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "competitive division of a mixed manna"
    - "competitive equilibria with indivisible goods and generic budgets"

Connected through hyperedge HE-5 (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"
    - "competitive division of a mixed manna"
    - "approximate maximin shares for groups of agents"
    - "fair and square cake cutting in two dimensions"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "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.DM(Discrete Mathematics)