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: "asymptotic existence of proportionally fair allocations"
  Abstract: Fair division has long been an important problem in the economics literature. In this note, we consider the existence of proportionally fair allocations of indivisible goods, i.e., allocations of indivisible goods in which every agent gets at least her proportionally fair share according to her own utility function. We show that when utilities are additive and utilities for individual goods are drawn independently at random from a distribution, proportionally fair allocations exist with high probability if the number of goods is a multiple of the number of agents or if the number of goods grows asymptotically faster than the number of agents.

Connected through hyperedge HE-1 (induced by source paper "fairly allocating contiguous blocks of indivisible items"):
  with members:
    - "almost envy freeness in group resource allocation"
    - "fair division of a graph"
    - "computing socially efficient cake divisions"

Connected through hyperedge HE-2 (induced by source paper "when do envy free allocations exist"):
  with members:
    - "fair division under cardinality constraints"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"

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"
    - "envy free cake cutting among families"

Connected through hyperedge HE-4 (induced by source paper "upper bounds on number of steals in rooted trees"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "truthful allocation mechanisms without payments characterization and implications on fairness"
    - "approximation algorithms for computing maximin share allocations"
    - "approximate maximin shares for groups of agents"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "on truthful mechanisms for maximin share allocations"

Connected through hyperedge HE-5 (induced by source paper "upper bounds on number of steals in rooted trees"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "truthful allocation mechanisms without payments characterization and implications on fairness"
    - "approximation algorithms for computing maximin share allocations"
    - "approximate maximin shares for groups of agents"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "on truthful mechanisms for maximin share 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)