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: "fairly allocating contiguous blocks of indivisible items"
  Abstract: Abstract   In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that is contiguous, meaning that the bundle of each agent forms a contiguous block on the line. While allocations satisfying the classical fairness notions of proportionality, envy-freeness, and equitability are not guaranteed to exist even without the contiguity requirement, we show the existence of contiguous allocations satisfying approximate versions of these notions that do not degrade as the number of agents or items increases. We also study the efficiency loss of contiguous allocations due to fairness constraints.

Connected through hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores"):
  with members:
    - "fair division with minimal sharing"
    - "algorithms for competitive division of chores"
    - "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "an algorithmic framework for approximating maximin share allocation of chores"
    - "strategyproof and approximately maxmin fair share allocation of chores"
    - "almost envy freeness and welfare efficiency in fair division with goods or bads"
    - "fair allocation of combinations of indivisible goods and chores"

Connected through hyperedge HE-2 (induced by source paper "the price of connectivity in fair division"):
  with members:
    - "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"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-3 (induced by source paper "almost envy freeness in group resource allocation"):
  with members:
    - "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"
    - "envy free cake cutting among families"

Connected through hyperedge HE-4 (induced by source paper "dividing a graphical cake"):
  with members:
    - "maximin share allocations on cycles"
    - "connected fair allocation of indivisible goods"
    - "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-5 (induced by source paper "contiguous cake cutting hardness results and approximation algorithms"):
  with members:
    - "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"
    - "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-6 (induced by source paper "the price of fairness for indivisible goods"):
  with members:
    - "fair division under cardinality constraints"
    - "when do envy free allocations exist"
    - "almost envy freeness with general valuations"
    - "the price of fairness for a small number of indivisible items"

Connected through hyperedge HE-7 (induced by source paper "almost envy free allocations with connected bundles"):
  with members:
    - "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"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"

Connected through hyperedge HE-8 (induced by source paper "chore division on a graph"):
  with members:
    - "maximin share allocations on cycles"
    - "almost envy free allocations with connected bundles"
    - "pareto optimal allocation of indivisible goods with connectivity constraints"
    - "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)