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: "pareto optimal allocation of indivisible goods with connectivity constraints"
  Abstract: We study the problem of allocating indivisible items to agents with additive valuations, under the additional constraint that bundles must be connected in an underlying item graph. Previous work has considered the existence and complexity of fair allocations. We study the problem of finding an allocation that is Pareto-optimal. While it is easy to find an efficient allocation when the underlying graph is a path or a star, the problem is NP-hard for many other graph topologies, even for trees of bounded pathwidth or of maximum degree 3. We show that on a path, there are instances where no Pareto-optimal allocation satisfies envy-freeness up to one good, and that it is NP-hard to decide whether such an allocation exists, even for binary valuations. We also show that, for a path, it is NP-hard to find a Pareto-optimal allocation that satisfies maximin share, but show that a moving-knife algorithm can find such an allocation when agents have binary valuations that have a non-nested interval structure.

Connected through hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods"):
  with members:
    - "computing envy freeable allocations with limited subsidies"
    - "one dollar each eliminates envy"
    - "fair division of mixed divisible and indivisible goods"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "maximin share allocations on cycles"
    - "an improved approximation algorithm for maximin shares"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"

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"
    - "fair division under cardinality constraints"
    - "when do envy free allocations exist"
    - "almost envy freeness with general valuations"

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

Connected through hyperedge HE-4 (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"
    - "connected fair allocation of indivisible goods"
    - "dividing a graphical cake"
    - "almost envy free allocations with connected bundles"
    - "communication complexity of cake cutting"
    - "the query complexity of cake cutting"
    - "fair division of a graph"

Connected through hyperedge HE-5 (induced by source paper "good things come to those who swap objects on paths"):
  with members:
    - "stable roommates with narcissistic single peaked and single crossing preferences"
    - "social networks and stable matchings in the job market"

Connected through hyperedge HE-6 (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"
    - "fair division under cardinality constraints"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-7 (induced by source paper "chore division on a graph"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "maximin share allocations on cycles"
    - "almost envy free allocations with connected bundles"
    - "competitive division of a mixed manna"
    - "on the complexity of chore division"
    - "networked fairness in cake cutting"
    - "fair division of a graph"
    - "fair division via social comparison"

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)