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: "envy free cake cutting among families"
  Abstract: This paper extends the classic cake-cutting problem to a situation in which the "cake" is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the classic no-envy criterion: (a) Average envy-freeness means that for each family, the average value of its share (averaged over all family members) is weakly larger than the average value of any other share; (b) Unanimous envy-freeness means that in each family, each member values the family's share weakly more than any other share; (c) Democratic envy-freeness means that in each family, at least half the members value the family's share weakly more than any other share. We study each of these definitions from both an existential and a computational perspective.

Connected through hyperedge HE-1 (induced by source paper "computing a small agreeable set of indivisible items"):
  with members:
    - "fair division under cardinality constraints"
    - "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"
    - "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-2 (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"
    - "fair division under cardinality constraints"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "approximate maximin shares for groups of agents"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "truthful allocation mechanisms without payments characterization and implications on fairness"
    - "approximation algorithms for computing maximin share allocations"
    - "fair division of a graph"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "on truthful mechanisms for maximin share allocations"
    - "asymptotic existence of proportionally fair allocations"

Connected through hyperedge HE-4 (induced by source paper "proportional cake cutting among families"):
  with members:
    - "envy free cake cutting in two dimensions"

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)