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: "connected fair allocation of indivisible goods"
  Abstract: We study the fair allocation of indivisible goods under the assumption that the goods form an undirected graph and each agent must receive a connected subgraph. Our focus is on well-studied fairness notions including envy-freeness and maximin share fairness. We establish graph-specific maximin share guarantees, which are tight for large classes of graphs in the case of two agents and for paths and stars in the general case. Unlike in previous work, our guarantees are with respect to the complete-graph maximin share, which allows us to compare possible guarantees for different graphs. For instance, we show that for biconnected graphs it is possible to obtain at least $3/4$ of the maximin share, while for the remaining graphs the guarantee is at most $1/2$. In addition, we determine the optimal relaxation of envy-freeness that can be obtained with each graph for two agents, and characterize the set of trees and complete bipartite graphs that always admit an allocation satisfying envy-freeness up to one good (EF1) for three agents. Our work demonstrates several applications of graph-theoretical tools and concepts to fair division problems.

Connected through hyperedge HE-1 (induced by source paper "dividing a graphical cake"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "chore division on a graph"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "fair and square cake cutting in two dimensions"
    - "fair division of a graph"

Connected through hyperedge HE-2 (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"
    - "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"
    - "groupwise maximin fair allocation of indivisible goods"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-3 (induced by source paper "contiguous cake cutting hardness results and approximation algorithms"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "fair and efficient cake division with connected pieces"
    - "dividing a graphical cake"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "communication complexity of cake cutting"
    - "the query complexity of cake cutting"
    - "fair division of a graph"

Connected through hyperedge HE-4 (induced by source paper "democratic fair allocation of indivisible goods"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "almost envy freeness in group resource allocation"
    - "computing a small agreeable set of indivisible items"
    - "comparing approximate relaxations of envy freeness"
    - "fair allocation of combinations of indivisible goods and chores"
    - "almost envy free allocations with connected bundles"
    - "lecture notes on fair division"
    - "competitive equilibria with indivisible goods and generic budgets"

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)