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: "an improved approximation algorithm for maximin shares"
  Abstract: We study the problem of fair allocation of m indivisible items among n agents with additive valuations using the popular notion of maximin share as our measure of fairness. The maximin share (MMS) of an agent is the maximum she can guarantee herself if she is allowed to choose a partition of items into n bundles (one for each agent), with the condition that all other agents get to choose a bundle before her. An MMS allocation provides each agent a bundle worth at least her maximin share. While it is known that such an allocation need not exist, a series of remarkable work provided 2/3 approximation algorithms in which each agent receives a bundle worth at least 2/3 times her maximin share. Recently, in a groundbreaking work, Ghodsi et al. showed the existence of 3/4 MMS allocation and a PTAS to find a 3/4-\epsilon MMS allocation. Most of the previous work utilize intricate algorithms and require agents' approximate MMS values, which are computationally expensive to obtain. #R##N#We present a simple algorithm that obtains a 3/4 MMS allocation and runs in \tilde{O}(n^5m) time. The idea is to start with a trivial upper bound on the MMS values based on the average and greedily assign high-value items to agents. Then, try to satisfy the remaining agents with remaining items using tentative assignment and bag-filling procedures. If the MMS upper bounds are tight enough, then these procedures are guaranteed to succeed. Otherwise, we update it for a certain agent and run the procedures again. We show that the bounds need to be updated at most O(n^3) times.

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 algorithmic framework for approximating maximin share allocation of chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "comparing approximate relaxations of envy freeness"

Connected through hyperedge HE-2 (induced by source paper "maximum nash welfare and other stories about efx"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "almost envy freeness in group resource allocation"
    - "approximating nash social welfare under submodular valuations through un matchings"
    - "maximin aware allocations of indivisible goods"
    - "greedy algorithms for fair division of mixed manna"
    - "greedy algorithms for maximizing nash social welfare"
    - "groupwise maximin fair allocation of indivisible goods"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-3 (induced by source paper "efx exists for three agents"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "approximating nash social welfare under submodular valuations through un matchings"
    - "a little charity guarantees almost envy freeness"
    - "on fair division of indivisible items"
    - "almost envy freeness with general valuations"
    - "approximating the nash social welfare with budget additive valuations"
    - "finding fair and efficient allocations"
    - "convex program duality fisher markets and nash social welfare"

Connected through hyperedge HE-4 (induced by source paper "a little charity guarantees almost envy freeness"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "almost envy free allocations with connected bundles"
    - "on fair division of indivisible items"
    - "groupwise maximin fair allocation of indivisible goods"
    - "almost envy freeness with general valuations"
    - "approximating the nash social welfare with budget additive valuations"
    - "finding fair and efficient allocations"
    - "convex program duality fisher markets and nash social welfare"

Connected through hyperedge HE-5 (induced by source paper "an algorithmic framework for approximating maximin share allocation of chores"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "a little charity guarantees almost envy freeness"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "fair allocation of combinations of indivisible goods and chores"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-6 (induced by source paper "fair division of mixed divisible and indivisible goods"):
  with members:
    - "efx exists for three agents"
    - "monotonicity and competitive equilibrium in cake cutting"
    - "truthful fair division without free disposal"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "the query complexity of 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"

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)