human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "chore division on a graph"):
  Abstract: The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph. Although a similar model has been investigated before for goods, we show that the goods and chores settings are inherently different. In particular, it is impossible to derive the solution of the chores instance from the solution of its naturally associated fair division instance. We consider three common fair division solution concepts, namely proportionality, envy-freeness and equitability, and two individual disutility aggregation functions: additive and maximum based. We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.

Includes members:
  Member "fairly allocating contiguous blocks of indivisible items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "maximin share allocations on cycles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "almost envy free allocations with connected bundles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "pareto optimal allocation of indivisible goods with connectivity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equitable allocations of indivisible chores")
  Member "on the complexity of chore division":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truthful fair division without free disposal")
  Member "networked fairness in cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the price of connectivity in fair division")
  Member "fair division of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")

Question: Please tell me which class the source paper 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.AI(Artificial Intelligence)