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 "the query complexity of cake cutting"):
  Abstract: We study the query complexity of cake cutting and give lower and upper bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. The lower bounds are tight for computing connected envy-free allocations among n=3 players and for computing perfect and equitable allocations with minimum number of cuts between n=2 players. #R##N#We also formalize moving knife procedures and show that a large subclass of this family, which captures all the known moving knife procedures, can be simulated efficiently with arbitrarily small error in the Robertson-Webb query model.

Includes members:
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "almost envy freeness with general valuations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equitable allocations of indivisible chores")
  Member "consensus halving is ppa complete":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "consenus halving does it ever get easier")
  Member "resource monotonicity and population monotonicity in connected cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "monotonicity and competitive equilibrium in cake cutting")
  Member "fair division of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "a discrete and bounded envy free cake cutting protocol for any number of agents":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "to give or not to give fair division for single minded valuations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithms for competitive division of chores")
  Member "characterization and computation of equilibria for indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algorithms for competitive division of chores")

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)