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: "groupwise maximin fair allocation of indivisible goods"
  Abstract: We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as the minimum utility that an agent can guarantee for herself when asked to partition the set of goods into n bundles such that the remaining (n-1) agents pick their bundles adversarially. An allocation is deemed to be fair if every agent gets a bundle whose valuation is at least her maximin share. #R##N#Even though maximin shares provide a natural benchmark for fairness, it has its own drawbacks and, in particular, it is not sufficient to rule out unsatisfactory allocations. Motivated by these considerations, in this work we define a stronger notion of fairness, called groupwise maximin share guarantee (GMMS). In GMMS, we require that the maximin share guarantee is achieved not just with respect to the grand bundle, but also among all the subgroups of agents. Hence, this solution concept strengthens MMS and provides an ex-post fairness guarantee. We show that in specific settings, GMMS allocations always exist. We also establish the existence of approximate GMMS allocations under additive valuations, and develop a polynomial-time algorithm to find such allocations. Moreover, we establish a scale of fairness wherein we show that GMMS implies approximate envy freeness. #R##N#Finally, we empirically demonstrate the existence of GMMS allocations in a large set of randomly generated instances. For the same set of instances, we additionally show that our algorithm achieves an approximation factor better than the established, worst-case bound.

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 "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"
    - "an improved approximation algorithm for maximin shares"
    - "greedy algorithms for maximizing nash social welfare"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-3 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms"):
  with members:
    - "fairness aware ranking in search recommendation systems with application to linkedin talent search"
    - "incremental fairness in two sided market platforms on smoothly updating recommendations"
    - "estimating position bias without intrusive interventions"
    - "multi stakeholder recommendation and its connection to multi sided fairness"
    - "comparing approximate relaxations of envy freeness"
    - "equity of attention amortizing individual fairness in rankings"
    - "almost envy free allocations with connected bundles"
    - "fair division under cardinality constraints"

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"
    - "an improved approximation algorithm for maximin shares"
    - "almost envy free allocations with connected bundles"
    - "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-5 (induced by source paper "an improved approximation algorithm for maximin shares"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "a little charity guarantees almost envy freeness"
    - "maximin share allocations on cycles"
    - "connected fair allocation of indivisible goods"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "the fair division of hereditary set systems"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-6 (induced by source paper "group fairness in influence maximization"):
  with members:
    - "fair allocation of indivisible public goods"
    - "multi objective maximization of monotone submodular functions with cardinality constraint"
    - "diverse weighted bipartite b matching"
    - "approximate maximin shares for groups of agents"
    - "multiwinner elections with diversity constraints"
    - "stochastic submodular maximization the case of coverage functions"
    - "gradient methods for submodular maximization"
    - "democratic fair allocation of indivisible goods"

Connected through hyperedge HE-7 (induced by source paper "multiple birds with one stone beating 1 2 for efx and gmms via envy cycle elimination"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "a little charity guarantees almost envy freeness"
    - "maximin aware allocations of indivisible goods"
    - "truthful allocation mechanisms without payments characterization and implications on fairness"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "approximate maximin shares for groups of agents"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-8 (induced by source paper "maximin aware allocations of indivisible goods"):
  with members:
    - "an improved envy free cake cutting protocol for four agents"
    - "almost envy freeness with general valuations"
    - "networked fairness in cake cutting"
    - "fair division of a graph"
    - "fair division via social comparison"

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)