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 "contiguous cake cutting hardness results and approximation algorithms"):
  Abstract: We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. While it is known that no finite envy-free algorithm exists in this setting, we exhibit efficient algorithms that produce allocations with low envy among the agents. We then establish NP-hardness results for various decision problems on the existence of envy-free allocations, such as when we fix the ordering of the agents or constrain the positions of certain cuts. In addition, we consider a discretized setting where indivisible items lie on a line and show a number of hardness results strengthening those from prior work.

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 "fair and efficient cake division with connected pieces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consenus halving does it ever get easier")
  Member "connected fair allocation of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dividing a graphical cake")
  Member "dividing a graphical cake":
    also connected through other hyperedges:
      (none)
  Member "almost envy free allocations with connected bundles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "communication complexity of cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the existence of pareto efficient and envy free allocations")
  Member "the query complexity of cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair division of 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.GT(Computer Science and Game Theory)