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: "fair division under cardinality constraints"
  Abstract: We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of the entire set of goods---i.e., the goods are categorized---and a limit is specified on the number of goods that can be allocated from each category to any agent. The objective here is to find a fair allocation in which the subset of goods assigned to any agent satisfies the given cardinality constraints. This problem naturally captures a number of resource-allocation applications, and is a generalization of the well-studied (unconstrained) fair division problem. #R##N#The two central notions of fairness, in the context of fair division of indivisible goods, are envy freeness up to one good (EF1) and the (approximate) maximin share guarantee (MMS). We show that the existence and algorithmic guarantees established for these solution concepts in the unconstrained setting can essentially be achieved under cardinality constraints. Specifically, we develop efficient algorithms which compute EF1 and approximately MMS allocations in the constrained setting. #R##N#Furthermore, focusing on the case wherein all the agents have the same additive valuation, we establish that EF1 allocations exist and can be computed efficiently even under matroid constraints.

Connected through hyperedge HE-1 (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"
    - "groupwise maximin fair allocation of indivisible goods"

Connected through hyperedge HE-2 (induced by source paper "the price of connectivity in fair division"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "fairly allocating many goods with few queries"
    - "chore division on a graph"
    - "almost envy free allocations with connected bundles"
    - "when do envy free allocations exist"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-3 (induced by source paper "computing a small agreeable set of indivisible items"):
  with members:
    - "approximation algorithms for computing maximin share allocations"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "envy free cake cutting among families"
    - "proportional cake cutting among families"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-4 (induced by source paper "almost envy freeness in group resource allocation"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fairly allocating many goods with few queries"
    - "almost envy free allocations with connected bundles"
    - "almost envy freeness with general valuations"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "envy free cake cutting among families"

Connected through hyperedge HE-5 (induced by source paper "the constrained round robin algorithm for fair and efficient allocation"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "the conference paper assignment problem using order weighted averages to assign indivisible goods"
    - "fair allocation based on diminishing differences"
    - "redividing the cake"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"

Connected through hyperedge HE-6 (induced by source paper "the price of fairness for indivisible goods"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "when do envy free allocations exist"
    - "almost envy freeness with general valuations"
    - "the price of fairness for a small number of indivisible items"

Connected through hyperedge HE-7 (induced by source paper "almost envy free allocations with connected bundles"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "comparing approximate relaxations of envy freeness"
    - "fair allocation of combinations of indivisible goods and chores"
    - "fairly allocating many goods with few queries"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-8 (induced by source paper "when do envy free allocations exist"):
  with members:
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "asymptotic existence of proportionally fair allocations"

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)