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: "when do envy free allocations exist"
  Abstract: We consider a fair division setting in which $m$ indivisible items are to be allocated among $n$ agents, where the agents have additive utilities and the agents' utilities for individual items are independently sampled from a distribution. Previous work has shown that an envy-free allocation is likely to exist when $m=\Omega(n\log n)$ but not when $m=n+o(n)$, and left open the question of determining where the phase transition from non-existence to existence occurs. We show that, surprisingly, there is in fact no universal point of transition---instead, the transition is governed by the divisibility relation between $m$ and $n$. On the one hand, if $m$ is divisible by $n$, an envy-free allocation exists with high probability as long as $m\geq 2n$. On the other hand, if $m$ is not "almost" divisible by $n$, an envy-free allocation is unlikely to exist even when $m=\Theta(n\log n/\log\log n)$.

Connected through hyperedge HE-1 (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"
    - "fair division under cardinality constraints"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-2 (induced by source paper "fair division through information withholding"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "fair division with minimal sharing"
    - "a little charity guarantees almost envy freeness"
    - "maximin aware allocations of indivisible goods"
    - "networked fairness in cake cutting"
    - "fair division via social comparison"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-3 (induced by source paper "on weighted envy freeness in indivisible item allocation"):
  with members:
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "the complexity of cake cutting with unequal shares"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-4 (induced by source paper "fairness efficiency tradeoffs in dynamic fair division"):
  with members:
    - "a simple online fair division problem"
    - "a strongly polynomial algorithm for linear exchange markets"
    - "dynamic fair division problem with general valuations"
    - "approximating the nash social welfare with budget additive valuations"
    - "finding fair and efficient allocations"
    - "online fair division analysing a food bank problem"

Connected through hyperedge HE-5 (induced by source paper "the price of fairness for indivisible goods"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair division under cardinality constraints"
    - "almost envy freeness with general valuations"
    - "the price of fairness for a small number of indivisible items"

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)